./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 22:49:55,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:49:55,872 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:49:55,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:49:55,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:49:55,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:49:55,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:49:55,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:49:55,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:49:55,899 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:49:55,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:49:55,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:49:55,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:49:55,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:49:55,901 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:49:55,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:49:55,901 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:49:55,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:49:55,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:49:55,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:49:55,901 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:49:55,901 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:49:55,901 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:49:55,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:49:55,902 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:49:55,902 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:49:55,902 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:49:55,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:49:55,902 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:49:55,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:49:55,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:49:55,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:49:55,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:49:55,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:49:55,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:49:55,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:49:55,903 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:49:55,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:49:55,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:49:55,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:49:55,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:49:55,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:49:55,903 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-08 22:49:56,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:49:56,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:49:56,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:49:56,131 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:49:56,132 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:49:56,133 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-08 22:49:57,218 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd37d5eba/58a9efef63fc40ffa72752075b57bb2a/FLAGe671672d4 [2025-03-08 22:49:57,517 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:49:57,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0513.i [2025-03-08 22:49:57,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd37d5eba/58a9efef63fc40ffa72752075b57bb2a/FLAGe671672d4 [2025-03-08 22:49:57,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd37d5eba/58a9efef63fc40ffa72752075b57bb2a [2025-03-08 22:49:57,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:49:57,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:49:57,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:49:57,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:49:57,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:49:57,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:49:57" (1/1) ... [2025-03-08 22:49:57,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57d61911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:57, skipping insertion in model container [2025-03-08 22:49:57,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:49:57" (1/1) ... [2025-03-08 22:49:57,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:49:58,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:49:58,010 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:49:58,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:49:58,056 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:49:58,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58 WrapperNode [2025-03-08 22:49:58,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:49:58,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:49:58,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:49:58,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:49:58,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,088 INFO L138 Inliner]: procedures = 123, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 118 [2025-03-08 22:49:58,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:49:58,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:49:58,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:49:58,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:49:58,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,117 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-08 22:49:58,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,126 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:49:58,133 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:49:58,134 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:49:58,134 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:49:58,134 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (1/1) ... [2025-03-08 22:49:58,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:49:58,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:49:58,163 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-08 22:49:58,164 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-08 22:49:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:49:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:49:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:49:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:49:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:49:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:49:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:49:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:49:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:49:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:49:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:49:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:49:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:49:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:49:58,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:49:58,270 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:49:58,271 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:49:58,626 INFO L? ?]: Removed 146 outVars from TransFormulas that were not future-live. [2025-03-08 22:49:58,628 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:49:58,640 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:49:58,641 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:49:58,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:49:58 BoogieIcfgContainer [2025-03-08 22:49:58,643 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:49:58,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:49:58,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:49:58,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:49:58,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:49:57" (1/3) ... [2025-03-08 22:49:58,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82a158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:49:58, skipping insertion in model container [2025-03-08 22:49:58,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:49:58" (2/3) ... [2025-03-08 22:49:58,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82a158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:49:58, skipping insertion in model container [2025-03-08 22:49:58,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:49:58" (3/3) ... [2025-03-08 22:49:58,651 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0513.i [2025-03-08 22:49:58,661 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:49:58,662 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-08 22:49:58,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:49:58,701 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;@1cb6f9d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:49:58,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-03-08 22:49:58,705 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-08 22:49:58,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:49:58,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:58,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:49:58,709 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-08 22:49:58,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:58,714 INFO L85 PathProgramCache]: Analyzing trace with hash 166016006, now seen corresponding path program 1 times [2025-03-08 22:49:58,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:58,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382359469] [2025-03-08 22:49:58,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:58,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:58,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:49:58,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:49:58,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:58,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:58,817 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-08 22:49:58,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:58,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382359469] [2025-03-08 22:49:58,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382359469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:58,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:58,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:49:58,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816803373] [2025-03-08 22:49:58,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:58,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:49:58,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:58,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:49:58,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:49:58,847 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-08 22:49:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:58,863 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2025-03-08 22:49:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:49:58,865 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-08 22:49:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:58,869 INFO L225 Difference]: With dead ends: 131 [2025-03-08 22:49:58,870 INFO L226 Difference]: Without dead ends: 129 [2025-03-08 22:49:58,871 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-08 22:49:58,874 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-08 22:49:58,876 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-08 22:49:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-08 22:49:58,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-08 22:49:58,904 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-08 22:49:58,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2025-03-08 22:49:58,910 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 5 [2025-03-08 22:49:58,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:58,910 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2025-03-08 22:49:58,911 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-08 22:49:58,911 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2025-03-08 22:49:58,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:49:58,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:58,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:49:58,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:49:58,911 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-08 22:49:58,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:58,912 INFO L85 PathProgramCache]: Analyzing trace with hash 851534998, now seen corresponding path program 1 times [2025-03-08 22:49:58,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:58,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249823406] [2025-03-08 22:49:58,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:58,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:58,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:49:58,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:49:58,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:58,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:58,960 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-08 22:49:58,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:58,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249823406] [2025-03-08 22:49:58,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249823406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:58,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:58,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:49:58,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825669976] [2025-03-08 22:49:58,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:58,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:49:58,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:58,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:49:58,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:49:58,963 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-08 22:49:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:59,101 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2025-03-08 22:49:59,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:49:59,101 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-08 22:49:59,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:59,102 INFO L225 Difference]: With dead ends: 175 [2025-03-08 22:49:59,102 INFO L226 Difference]: Without dead ends: 174 [2025-03-08 22:49:59,103 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-08 22:49:59,103 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-08 22:49:59,103 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-08 22:49:59,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-08 22:49:59,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2025-03-08 22:49:59,109 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-08 22:49:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2025-03-08 22:49:59,110 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 6 [2025-03-08 22:49:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:59,110 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2025-03-08 22:49:59,110 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-08 22:49:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2025-03-08 22:49:59,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:49:59,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:59,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:49:59,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:49:59,113 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-08 22:49:59,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:59,113 INFO L85 PathProgramCache]: Analyzing trace with hash 851535129, now seen corresponding path program 1 times [2025-03-08 22:49:59,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:59,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600710418] [2025-03-08 22:49:59,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:59,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:59,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:49:59,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:49:59,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:59,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:49:59,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:59,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600710418] [2025-03-08 22:49:59,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600710418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:59,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:59,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:49:59,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233166089] [2025-03-08 22:49:59,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:59,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:49:59,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:59,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:49:59,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:49:59,161 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-08 22:49:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:59,222 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2025-03-08 22:49:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:49:59,223 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-08 22:49:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:59,224 INFO L225 Difference]: With dead ends: 142 [2025-03-08 22:49:59,224 INFO L226 Difference]: Without dead ends: 141 [2025-03-08 22:49:59,224 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-08 22:49:59,224 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:49:59,224 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.1s Time] [2025-03-08 22:49:59,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-08 22:49:59,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-03-08 22:49:59,230 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-08 22:49:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2025-03-08 22:49:59,231 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 6 [2025-03-08 22:49:59,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:59,231 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2025-03-08 22:49:59,231 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-08 22:49:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2025-03-08 22:49:59,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:49:59,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:59,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:49:59,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:49:59,232 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-08 22:49:59,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:59,232 INFO L85 PathProgramCache]: Analyzing trace with hash 851537052, now seen corresponding path program 1 times [2025-03-08 22:49:59,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:59,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485550419] [2025-03-08 22:49:59,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:59,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:59,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:49:59,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:49:59,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:59,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:59,282 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-08 22:49:59,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:59,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485550419] [2025-03-08 22:49:59,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485550419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:59,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:59,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:49:59,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262270659] [2025-03-08 22:49:59,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:59,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:49:59,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:59,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:49:59,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:49:59,284 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-08 22:49:59,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:59,368 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2025-03-08 22:49:59,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:49:59,369 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-08 22:49:59,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:59,369 INFO L225 Difference]: With dead ends: 144 [2025-03-08 22:49:59,369 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 22:49:59,371 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-08 22:49:59,372 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-08 22:49:59,372 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-08 22:49:59,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 22:49:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2025-03-08 22:49:59,379 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-08 22:49:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2025-03-08 22:49:59,380 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 6 [2025-03-08 22:49:59,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:59,381 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2025-03-08 22:49:59,381 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-08 22:49:59,381 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2025-03-08 22:49:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:49:59,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:59,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:49:59,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:49:59,382 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-08 22:49:59,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:59,382 INFO L85 PathProgramCache]: Analyzing trace with hash 851537053, now seen corresponding path program 1 times [2025-03-08 22:49:59,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:59,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645047603] [2025-03-08 22:49:59,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:59,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:59,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:49:59,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:49:59,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:59,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:59,454 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-08 22:49:59,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:59,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645047603] [2025-03-08 22:49:59,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645047603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:59,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:59,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:49:59,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481287394] [2025-03-08 22:49:59,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:59,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:49:59,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:59,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:49:59,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:49:59,455 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-08 22:49:59,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:59,523 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2025-03-08 22:49:59,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:49:59,523 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-08 22:49:59,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:59,524 INFO L225 Difference]: With dead ends: 136 [2025-03-08 22:49:59,524 INFO L226 Difference]: Without dead ends: 136 [2025-03-08 22:49:59,524 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-08 22:49:59,525 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-08 22:49:59,525 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-08 22:49:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-08 22:49:59,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-08 22:49:59,531 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-08 22:49:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2025-03-08 22:49:59,531 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 6 [2025-03-08 22:49:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:59,531 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2025-03-08 22:49:59,531 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-08 22:49:59,531 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2025-03-08 22:49:59,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:49:59,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:59,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:49:59,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:49:59,532 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-08 22:49:59,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1187815612, now seen corresponding path program 1 times [2025-03-08 22:49:59,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:59,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93819766] [2025-03-08 22:49:59,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:59,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:59,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:49:59,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:49:59,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:59,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:59,607 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-08 22:49:59,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:59,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93819766] [2025-03-08 22:49:59,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93819766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:59,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:59,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:49:59,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809048925] [2025-03-08 22:49:59,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:59,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:49:59,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:59,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:49:59,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:49:59,608 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-08 22:49:59,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:59,685 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2025-03-08 22:49:59,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:49:59,685 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-08 22:49:59,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:59,686 INFO L225 Difference]: With dead ends: 132 [2025-03-08 22:49:59,686 INFO L226 Difference]: Without dead ends: 132 [2025-03-08 22:49:59,686 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-08 22:49:59,687 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 18 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-08 22:49:59,687 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-08 22:49:59,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-08 22:49:59,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-08 22:49:59,692 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-08 22:49:59,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2025-03-08 22:49:59,693 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 11 [2025-03-08 22:49:59,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:59,693 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2025-03-08 22:49:59,693 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-08 22:49:59,693 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2025-03-08 22:49:59,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:49:59,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:59,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:49:59,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:49:59,693 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-08 22:49:59,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:59,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1187815611, now seen corresponding path program 1 times [2025-03-08 22:49:59,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:59,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816854719] [2025-03-08 22:49:59,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:59,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:59,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:49:59,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:49:59,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:59,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:59,751 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-08 22:49:59,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:59,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816854719] [2025-03-08 22:49:59,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816854719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:59,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:59,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:49:59,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918138730] [2025-03-08 22:49:59,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:59,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:49:59,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:59,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:49:59,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:49:59,752 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-08 22:49:59,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:49:59,826 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2025-03-08 22:49:59,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:49:59,827 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-08 22:49:59,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:49:59,827 INFO L225 Difference]: With dead ends: 129 [2025-03-08 22:49:59,827 INFO L226 Difference]: Without dead ends: 129 [2025-03-08 22:49:59,827 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-08 22:49:59,828 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-08 22:49:59,828 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-08 22:49:59,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-08 22:49:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-08 22:49:59,830 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-08 22:49:59,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2025-03-08 22:49:59,837 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 11 [2025-03-08 22:49:59,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:49:59,837 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2025-03-08 22:49:59,837 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-08 22:49:59,837 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2025-03-08 22:49:59,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:49:59,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:49:59,837 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:49:59,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:49:59,837 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-08 22:49:59,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:49:59,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1773804053, now seen corresponding path program 1 times [2025-03-08 22:49:59,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:49:59,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081813706] [2025-03-08 22:49:59,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:49:59,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:49:59,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:49:59,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:49:59,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:49:59,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:49:59,906 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-08 22:49:59,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:49:59,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081813706] [2025-03-08 22:49:59,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081813706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:49:59,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:49:59,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:49:59,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711631378] [2025-03-08 22:49:59,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:49:59,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:49:59,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:49:59,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:49:59,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:49:59,907 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-08 22:50:00,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:00,002 INFO L93 Difference]: Finished difference Result 198 states and 233 transitions. [2025-03-08 22:50:00,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:50:00,002 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-08 22:50:00,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:00,003 INFO L225 Difference]: With dead ends: 198 [2025-03-08 22:50:00,003 INFO L226 Difference]: Without dead ends: 198 [2025-03-08 22:50:00,003 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-08 22:50:00,003 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-08 22:50:00,004 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-08 22:50:00,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-08 22:50:00,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 129. [2025-03-08 22:50:00,010 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-08 22:50:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2025-03-08 22:50:00,010 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 18 [2025-03-08 22:50:00,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:00,010 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2025-03-08 22:50:00,010 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-08 22:50:00,010 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2025-03-08 22:50:00,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:50:00,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:00,011 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:50:00,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:50:00,011 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-08 22:50:00,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:00,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1773803922, now seen corresponding path program 1 times [2025-03-08 22:50:00,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:00,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690204330] [2025-03-08 22:50:00,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:00,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:00,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:50:00,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:50:00,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:00,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:00,100 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-08 22:50:00,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:00,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690204330] [2025-03-08 22:50:00,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690204330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:00,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:00,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:50:00,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278518395] [2025-03-08 22:50:00,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:00,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:50:00,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:00,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:50:00,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:50:00,103 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-08 22:50:00,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:00,241 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2025-03-08 22:50:00,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:50:00,241 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-08 22:50:00,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:00,242 INFO L225 Difference]: With dead ends: 122 [2025-03-08 22:50:00,242 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 22:50:00,242 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-08 22:50:00,242 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-08 22:50:00,243 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-08 22:50:00,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 22:50:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-08 22:50:00,245 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-08 22:50:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2025-03-08 22:50:00,246 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 18 [2025-03-08 22:50:00,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:00,246 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2025-03-08 22:50:00,246 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-08 22:50:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2025-03-08 22:50:00,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:50:00,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:00,247 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:50:00,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:50:00,248 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-08 22:50:00,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:00,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1773803921, now seen corresponding path program 1 times [2025-03-08 22:50:00,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:00,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648934527] [2025-03-08 22:50:00,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:00,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:00,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:50:00,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:50:00,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:00,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:00,358 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-08 22:50:00,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:00,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648934527] [2025-03-08 22:50:00,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648934527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:00,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:00,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:50:00,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116123162] [2025-03-08 22:50:00,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:00,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:50:00,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:00,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:50:00,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:50:00,360 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-08 22:50:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:00,492 INFO L93 Difference]: Finished difference Result 184 states and 204 transitions. [2025-03-08 22:50:00,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:50:00,492 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-08 22:50:00,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:00,493 INFO L225 Difference]: With dead ends: 184 [2025-03-08 22:50:00,493 INFO L226 Difference]: Without dead ends: 184 [2025-03-08 22:50:00,493 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-08 22:50:00,493 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-08 22:50:00,494 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-08 22:50:00,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-08 22:50:00,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 161. [2025-03-08 22:50:00,496 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-08 22:50:00,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 204 transitions. [2025-03-08 22:50:00,497 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 204 transitions. Word has length 18 [2025-03-08 22:50:00,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:00,497 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 204 transitions. [2025-03-08 22:50:00,497 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-08 22:50:00,497 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 204 transitions. [2025-03-08 22:50:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:50:00,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:00,497 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-08 22:50:00,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:50:00,498 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-08 22:50:00,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:00,498 INFO L85 PathProgramCache]: Analyzing trace with hash -955535214, now seen corresponding path program 1 times [2025-03-08 22:50:00,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:00,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005727514] [2025-03-08 22:50:00,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:00,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:00,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:50:00,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:50:00,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:00,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:00,621 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-08 22:50:00,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:00,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005727514] [2025-03-08 22:50:00,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005727514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:00,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:00,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:50:00,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979018995] [2025-03-08 22:50:00,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:00,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:50:00,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:00,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:50:00,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:50:00,622 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-08 22:50:00,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:00,786 INFO L93 Difference]: Finished difference Result 185 states and 230 transitions. [2025-03-08 22:50:00,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:50:00,786 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-08 22:50:00,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:00,788 INFO L225 Difference]: With dead ends: 185 [2025-03-08 22:50:00,788 INFO L226 Difference]: Without dead ends: 185 [2025-03-08 22:50:00,788 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-08 22:50:00,789 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:00,789 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.2s Time] [2025-03-08 22:50:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-08 22:50:00,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2025-03-08 22:50:00,792 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-08 22:50:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 218 transitions. [2025-03-08 22:50:00,792 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 218 transitions. Word has length 23 [2025-03-08 22:50:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:00,792 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 218 transitions. [2025-03-08 22:50:00,792 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-08 22:50:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 218 transitions. [2025-03-08 22:50:00,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:50:00,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:00,793 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-08 22:50:00,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:50:00,795 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-08 22:50:00,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:00,795 INFO L85 PathProgramCache]: Analyzing trace with hash -955535213, now seen corresponding path program 1 times [2025-03-08 22:50:00,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:00,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128477357] [2025-03-08 22:50:00,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:00,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:00,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:50:00,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:50:00,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:00,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:00,998 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-08 22:50:00,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:00,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128477357] [2025-03-08 22:50:00,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128477357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:00,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:01,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:50:01,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498504099] [2025-03-08 22:50:01,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:01,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:50:01,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:01,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:50:01,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:50:01,001 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-08 22:50:01,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:01,115 INFO L93 Difference]: Finished difference Result 173 states and 217 transitions. [2025-03-08 22:50:01,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:50:01,115 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-08 22:50:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:01,116 INFO L225 Difference]: With dead ends: 173 [2025-03-08 22:50:01,116 INFO L226 Difference]: Without dead ends: 173 [2025-03-08 22:50:01,116 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-08 22:50:01,117 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-08 22:50:01,117 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-08 22:50:01,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-08 22:50:01,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 168. [2025-03-08 22:50:01,119 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-08 22:50:01,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 212 transitions. [2025-03-08 22:50:01,120 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 212 transitions. Word has length 23 [2025-03-08 22:50:01,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:01,120 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 212 transitions. [2025-03-08 22:50:01,120 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-08 22:50:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 212 transitions. [2025-03-08 22:50:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:50:01,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:01,120 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-08 22:50:01,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:50:01,120 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-08 22:50:01,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:01,121 INFO L85 PathProgramCache]: Analyzing trace with hash -956858892, now seen corresponding path program 1 times [2025-03-08 22:50:01,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:01,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911790017] [2025-03-08 22:50:01,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:01,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:01,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:50:01,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:50:01,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:01,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:01,194 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-08 22:50:01,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:01,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911790017] [2025-03-08 22:50:01,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911790017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:01,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:01,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:50:01,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108421884] [2025-03-08 22:50:01,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:01,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:50:01,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:01,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:50:01,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:50:01,196 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-08 22:50:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:01,277 INFO L93 Difference]: Finished difference Result 192 states and 213 transitions. [2025-03-08 22:50:01,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:50:01,278 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-08 22:50:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:01,278 INFO L225 Difference]: With dead ends: 192 [2025-03-08 22:50:01,278 INFO L226 Difference]: Without dead ends: 192 [2025-03-08 22:50:01,278 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-08 22:50:01,279 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-08 22:50:01,279 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-08 22:50:01,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-08 22:50:01,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 169. [2025-03-08 22:50:01,282 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-08 22:50:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 213 transitions. [2025-03-08 22:50:01,282 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 213 transitions. Word has length 23 [2025-03-08 22:50:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:01,282 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 213 transitions. [2025-03-08 22:50:01,283 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-08 22:50:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 213 transitions. [2025-03-08 22:50:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:50:01,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:01,283 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-08 22:50:01,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:50:01,283 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-08 22:50:01,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:01,284 INFO L85 PathProgramCache]: Analyzing trace with hash -85323302, now seen corresponding path program 1 times [2025-03-08 22:50:01,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:01,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400600424] [2025-03-08 22:50:01,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:01,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:01,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:50:01,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:50:01,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:01,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:01,481 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-08 22:50:01,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:01,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400600424] [2025-03-08 22:50:01,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400600424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:01,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:01,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:50:01,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808605979] [2025-03-08 22:50:01,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:01,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:50:01,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:01,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:50:01,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:50:01,483 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-08 22:50:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:01,625 INFO L93 Difference]: Finished difference Result 178 states and 224 transitions. [2025-03-08 22:50:01,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:50:01,625 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-08 22:50:01,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:01,626 INFO L225 Difference]: With dead ends: 178 [2025-03-08 22:50:01,626 INFO L226 Difference]: Without dead ends: 178 [2025-03-08 22:50:01,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:50:01,627 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-08 22:50:01,627 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-08 22:50:01,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-08 22:50:01,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2025-03-08 22:50:01,629 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-08 22:50:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 219 transitions. [2025-03-08 22:50:01,629 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 219 transitions. Word has length 26 [2025-03-08 22:50:01,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:01,630 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 219 transitions. [2025-03-08 22:50:01,630 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-08 22:50:01,630 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 219 transitions. [2025-03-08 22:50:01,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:50:01,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:01,630 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-08 22:50:01,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:50:01,630 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-08 22:50:01,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:01,631 INFO L85 PathProgramCache]: Analyzing trace with hash -85322950, now seen corresponding path program 1 times [2025-03-08 22:50:01,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:01,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497368196] [2025-03-08 22:50:01,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:01,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:01,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:50:01,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:50:01,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:01,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:01,885 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-08 22:50:01,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:01,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497368196] [2025-03-08 22:50:01,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497368196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:01,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:01,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:50:01,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407010714] [2025-03-08 22:50:01,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:01,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:50:01,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:01,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:50:01,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:50:01,886 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-08 22:50:02,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:02,127 INFO L93 Difference]: Finished difference Result 188 states and 235 transitions. [2025-03-08 22:50:02,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:50:02,127 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-08 22:50:02,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:02,128 INFO L225 Difference]: With dead ends: 188 [2025-03-08 22:50:02,128 INFO L226 Difference]: Without dead ends: 188 [2025-03-08 22:50:02,128 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-08 22:50:02,128 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-08 22:50:02,128 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-08 22:50:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-08 22:50:02,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 176. [2025-03-08 22:50:02,131 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-08 22:50:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 221 transitions. [2025-03-08 22:50:02,131 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 221 transitions. Word has length 26 [2025-03-08 22:50:02,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:02,131 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 221 transitions. [2025-03-08 22:50:02,131 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-08 22:50:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 221 transitions. [2025-03-08 22:50:02,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:50:02,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:02,132 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-08 22:50:02,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:50:02,132 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-08 22:50:02,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:02,132 INFO L85 PathProgramCache]: Analyzing trace with hash -85322949, now seen corresponding path program 1 times [2025-03-08 22:50:02,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:02,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659234149] [2025-03-08 22:50:02,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:02,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:02,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:50:02,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:50:02,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:02,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:02,454 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-08 22:50:02,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:02,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659234149] [2025-03-08 22:50:02,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659234149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:02,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:02,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:50:02,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932275192] [2025-03-08 22:50:02,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:02,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:50:02,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:02,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:50:02,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:50:02,457 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-08 22:50:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:02,684 INFO L93 Difference]: Finished difference Result 187 states and 231 transitions. [2025-03-08 22:50:02,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:50:02,684 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-08 22:50:02,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:02,685 INFO L225 Difference]: With dead ends: 187 [2025-03-08 22:50:02,685 INFO L226 Difference]: Without dead ends: 187 [2025-03-08 22:50:02,686 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-08 22:50:02,686 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:02,686 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.1s Time] [2025-03-08 22:50:02,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-08 22:50:02,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 176. [2025-03-08 22:50:02,689 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-08 22:50:02,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 220 transitions. [2025-03-08 22:50:02,691 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 220 transitions. Word has length 26 [2025-03-08 22:50:02,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:02,691 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 220 transitions. [2025-03-08 22:50:02,691 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-08 22:50:02,691 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 220 transitions. [2025-03-08 22:50:02,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:50:02,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:02,691 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-08 22:50:02,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:50:02,692 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-08 22:50:02,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:02,692 INFO L85 PathProgramCache]: Analyzing trace with hash -390976968, now seen corresponding path program 1 times [2025-03-08 22:50:02,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:02,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491968545] [2025-03-08 22:50:02,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:02,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:02,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:50:02,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:50:02,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:02,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:02,850 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-08 22:50:02,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:02,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491968545] [2025-03-08 22:50:02,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491968545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:02,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:02,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:50:02,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259928826] [2025-03-08 22:50:02,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:02,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:50:02,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:02,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:50:02,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:50:02,851 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-08 22:50:03,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:03,026 INFO L93 Difference]: Finished difference Result 189 states and 233 transitions. [2025-03-08 22:50:03,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:50:03,027 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-08 22:50:03,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:03,027 INFO L225 Difference]: With dead ends: 189 [2025-03-08 22:50:03,028 INFO L226 Difference]: Without dead ends: 189 [2025-03-08 22:50:03,028 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-08 22:50:03,028 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:03,028 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.1s Time] [2025-03-08 22:50:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-08 22:50:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 178. [2025-03-08 22:50:03,031 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-08 22:50:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 222 transitions. [2025-03-08 22:50:03,031 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 222 transitions. Word has length 28 [2025-03-08 22:50:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:03,031 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 222 transitions. [2025-03-08 22:50:03,031 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-08 22:50:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 222 transitions. [2025-03-08 22:50:03,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 22:50:03,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:03,032 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-08 22:50:03,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:50:03,032 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-08 22:50:03,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:03,033 INFO L85 PathProgramCache]: Analyzing trace with hash 764615856, now seen corresponding path program 1 times [2025-03-08 22:50:03,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:03,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292656924] [2025-03-08 22:50:03,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:03,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:03,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 22:50:03,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:50:03,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:03,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:03,229 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-08 22:50:03,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:03,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292656924] [2025-03-08 22:50:03,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292656924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:03,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:03,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:50:03,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090552153] [2025-03-08 22:50:03,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:03,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:50:03,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:03,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:50:03,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:50:03,230 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-08 22:50:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:03,484 INFO L93 Difference]: Finished difference Result 190 states and 234 transitions. [2025-03-08 22:50:03,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:50:03,484 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-08 22:50:03,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:03,485 INFO L225 Difference]: With dead ends: 190 [2025-03-08 22:50:03,485 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 22:50:03,485 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-08 22:50:03,486 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 37 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-08 22:50:03,486 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-08 22:50:03,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 22:50:03,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 179. [2025-03-08 22:50:03,489 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-08 22:50:03,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 223 transitions. [2025-03-08 22:50:03,489 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 223 transitions. Word has length 29 [2025-03-08 22:50:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:03,489 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 223 transitions. [2025-03-08 22:50:03,490 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-08 22:50:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 223 transitions. [2025-03-08 22:50:03,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 22:50:03,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:03,490 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-08 22:50:03,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:50:03,490 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-08 22:50:03,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:03,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2066712266, now seen corresponding path program 1 times [2025-03-08 22:50:03,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:03,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109630308] [2025-03-08 22:50:03,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:03,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:03,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 22:50:03,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 22:50:03,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:03,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:03,533 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-08 22:50:03,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:03,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109630308] [2025-03-08 22:50:03,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109630308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:03,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:03,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:50:03,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926809361] [2025-03-08 22:50:03,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:03,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:50:03,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:03,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:50:03,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:50:03,539 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-08 22:50:03,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:03,671 INFO L93 Difference]: Finished difference Result 243 states and 310 transitions. [2025-03-08 22:50:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:50:03,671 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-08 22:50:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:03,672 INFO L225 Difference]: With dead ends: 243 [2025-03-08 22:50:03,672 INFO L226 Difference]: Without dead ends: 243 [2025-03-08 22:50:03,672 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-08 22:50:03,673 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-08 22:50:03,673 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-08 22:50:03,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-08 22:50:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 183. [2025-03-08 22:50:03,675 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-08 22:50:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 234 transitions. [2025-03-08 22:50:03,676 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 234 transitions. Word has length 30 [2025-03-08 22:50:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:03,676 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 234 transitions. [2025-03-08 22:50:03,676 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-08 22:50:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 234 transitions. [2025-03-08 22:50:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 22:50:03,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:03,676 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-08 22:50:03,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:50:03,676 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-08 22:50:03,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:03,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1835597741, now seen corresponding path program 1 times [2025-03-08 22:50:03,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:03,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289286113] [2025-03-08 22:50:03,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:03,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:03,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 22:50:03,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 22:50:03,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:03,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:03,952 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-08 22:50:03,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289286113] [2025-03-08 22:50:03,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289286113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328584800] [2025-03-08 22:50:03,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:03,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:03,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:03,955 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-08 22:50:03,957 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-08 22:50:04,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 22:50:04,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 22:50:04,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:04,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:04,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 22:50:04,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:04,189 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-08 22:50:04,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:50:04,288 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-08 22:50:04,581 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-08 22:50:04,589 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-08 22:50:04,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:50:04,712 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-08 22:50:09,220 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-08 22:50:09,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328584800] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:50:09,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:50:09,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 30 [2025-03-08 22:50:09,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335491765] [2025-03-08 22:50:09,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:50:09,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 22:50:09,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:09,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 22:50:09,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=773, Unknown=2, NotChecked=56, Total=930 [2025-03-08 22:50:09,223 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-08 22:50:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:10,103 INFO L93 Difference]: Finished difference Result 195 states and 246 transitions. [2025-03-08 22:50:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:50:10,103 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-08 22:50:10,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:10,104 INFO L225 Difference]: With dead ends: 195 [2025-03-08 22:50:10,104 INFO L226 Difference]: Without dead ends: 194 [2025-03-08 22:50:10,105 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-08 22:50:10,105 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-08 22:50:10,105 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-08 22:50:10,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-08 22:50:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 185. [2025-03-08 22:50:10,131 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-08 22:50:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 236 transitions. [2025-03-08 22:50:10,131 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 236 transitions. Word has length 32 [2025-03-08 22:50:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:10,131 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 236 transitions. [2025-03-08 22:50:10,131 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-08 22:50:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 236 transitions. [2025-03-08 22:50:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 22:50:10,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:10,132 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-08 22:50:10,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 22:50:10,332 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-08 22:50:10,333 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-08 22:50:10,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:10,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1835597389, now seen corresponding path program 1 times [2025-03-08 22:50:10,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:10,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492784365] [2025-03-08 22:50:10,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:10,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:10,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 22:50:10,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 22:50:10,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:10,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:10,800 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-08 22:50:10,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:10,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492784365] [2025-03-08 22:50:10,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492784365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:10,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100346999] [2025-03-08 22:50:10,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:10,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:10,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:10,803 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-08 22:50:10,805 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-08 22:50:10,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 22:50:10,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 22:50:10,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:10,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:10,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 22:50:10,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:10,900 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-08 22:50:10,903 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-08 22:50:10,918 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-08 22:50:10,923 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-08 22:50:10,966 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:50:10,967 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-08 22:50:10,986 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:50:10,987 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-08 22:50:11,053 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 22:50:11,054 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-08 22:50:11,061 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-08 22:50:11,245 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-08 22:50:11,413 INFO L349 Elim1Store]: treesize reduction 8, result has 50.0 percent of original size [2025-03-08 22:50:11,414 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-08 22:50:11,472 INFO L349 Elim1Store]: treesize reduction 28, result has 69.9 percent of original size [2025-03-08 22:50:11,472 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-08 22:50:11,518 INFO L349 Elim1Store]: treesize reduction 4, result has 91.8 percent of original size [2025-03-08 22:50:11,518 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-08 22:50:11,678 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-08 22:50:11,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:50:11,797 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-08 22:50:12,072 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-08 22:50:12,176 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-08 22:50:12,374 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-08 22:50:12,376 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-08 22:50:12,380 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-08 22:50:12,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100346999] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:50:12,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:50:12,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 40 [2025-03-08 22:50:12,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720867100] [2025-03-08 22:50:12,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:50:12,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 22:50:12,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:12,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 22:50:12,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1318, Unknown=6, NotChecked=74, Total=1560 [2025-03-08 22:50:12,382 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-08 22:50:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:13,216 INFO L93 Difference]: Finished difference Result 193 states and 243 transitions. [2025-03-08 22:50:13,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 22:50:13,217 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-08 22:50:13,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:13,217 INFO L225 Difference]: With dead ends: 193 [2025-03-08 22:50:13,217 INFO L226 Difference]: Without dead ends: 178 [2025-03-08 22:50:13,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=269, Invalid=1891, Unknown=6, NotChecked=90, Total=2256 [2025-03-08 22:50:13,219 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-08 22:50:13,219 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-08 22:50:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-08 22:50:13,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 170. [2025-03-08 22:50:13,221 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-08 22:50:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 220 transitions. [2025-03-08 22:50:13,221 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 220 transitions. Word has length 32 [2025-03-08 22:50:13,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:13,222 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 220 transitions. [2025-03-08 22:50:13,222 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-08 22:50:13,222 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 220 transitions. [2025-03-08 22:50:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 22:50:13,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:13,222 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-08 22:50:13,228 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-08 22:50:13,426 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-08 22:50:13,426 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-08 22:50:13,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:13,427 INFO L85 PathProgramCache]: Analyzing trace with hash 507155363, now seen corresponding path program 1 times [2025-03-08 22:50:13,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:13,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716775754] [2025-03-08 22:50:13,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:13,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:13,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:50:13,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:50:13,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:13,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:13,594 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-08 22:50:13,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:13,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716775754] [2025-03-08 22:50:13,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716775754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:13,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283106849] [2025-03-08 22:50:13,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:13,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:13,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:13,596 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-08 22:50:13,598 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-08 22:50:13,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:50:13,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:50:13,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:13,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:13,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 22:50:13,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:13,715 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-08 22:50:13,743 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-08 22:50:13,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:50:13,764 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-08 22:50:13,794 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-08 22:50:13,796 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-08 22:50:13,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:50:21,951 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-08 22:50:21,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283106849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:50:21,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:50:21,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2025-03-08 22:50:21,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303295557] [2025-03-08 22:50:21,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:50:21,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 22:50:21,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:21,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 22:50:21,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=278, Unknown=2, NotChecked=0, Total=342 [2025-03-08 22:50:21,953 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-08 22:50:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:22,635 INFO L93 Difference]: Finished difference Result 194 states and 221 transitions. [2025-03-08 22:50:22,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 22:50:22,636 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-08 22:50:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:22,636 INFO L225 Difference]: With dead ends: 194 [2025-03-08 22:50:22,636 INFO L226 Difference]: Without dead ends: 194 [2025-03-08 22:50:22,637 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-08 22:50:22,637 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 137 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-08 22:50:22,638 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-08 22:50:22,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-08 22:50:22,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 170. [2025-03-08 22:50:22,643 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-08 22:50:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 219 transitions. [2025-03-08 22:50:22,643 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 219 transitions. Word has length 37 [2025-03-08 22:50:22,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:22,643 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 219 transitions. [2025-03-08 22:50:22,643 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-08 22:50:22,644 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 219 transitions. [2025-03-08 22:50:22,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 22:50:22,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:22,644 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-08 22:50:22,651 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-08 22:50:22,848 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-08 22:50:22,848 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-08 22:50:22,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:22,848 INFO L85 PathProgramCache]: Analyzing trace with hash 507155364, now seen corresponding path program 1 times [2025-03-08 22:50:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:22,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832403796] [2025-03-08 22:50:22,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:22,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:22,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:50:22,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:50:22,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:22,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:23,080 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-08 22:50:23,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:23,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832403796] [2025-03-08 22:50:23,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832403796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:23,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16630753] [2025-03-08 22:50:23,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:23,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:23,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:23,083 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-08 22:50:23,084 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-08 22:50:23,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:50:23,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:50:23,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:23,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:23,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 22:50:23,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:23,220 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-08 22:50:23,267 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-08 22:50:23,272 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-08 22:50:23,300 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-08 22:50:23,307 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-08 22:50:23,371 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-08 22:50:23,384 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-08 22:50:23,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:50:23,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16630753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:23,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:50:23,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-03-08 22:50:23,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502918934] [2025-03-08 22:50:23,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:23,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:50:23,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:23,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:50:23,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:50:23,386 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-08 22:50:23,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:23,573 INFO L93 Difference]: Finished difference Result 193 states and 220 transitions. [2025-03-08 22:50:23,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:50:23,573 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-08 22:50:23,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:23,574 INFO L225 Difference]: With dead ends: 193 [2025-03-08 22:50:23,574 INFO L226 Difference]: Without dead ends: 193 [2025-03-08 22:50:23,574 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-08 22:50:23,574 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 60 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-08 22:50:23,574 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-08 22:50:23,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-08 22:50:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 170. [2025-03-08 22:50:23,576 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-08 22:50:23,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 218 transitions. [2025-03-08 22:50:23,577 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 218 transitions. Word has length 37 [2025-03-08 22:50:23,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:23,577 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 218 transitions. [2025-03-08 22:50:23,577 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-08 22:50:23,577 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 218 transitions. [2025-03-08 22:50:23,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 22:50:23,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:23,577 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-08 22:50:23,583 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-08 22:50:23,781 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-08 22:50:23,781 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-08 22:50:23,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:23,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1808529111, now seen corresponding path program 1 times [2025-03-08 22:50:23,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:23,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018151416] [2025-03-08 22:50:23,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:23,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:23,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 22:50:23,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 22:50:23,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:23,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:23,926 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-08 22:50:23,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:23,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018151416] [2025-03-08 22:50:23,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018151416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:23,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553515152] [2025-03-08 22:50:23,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:23,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:23,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:23,928 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-08 22:50:23,930 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-08 22:50:24,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 22:50:24,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 22:50:24,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:24,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:24,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 22:50:24,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:24,138 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-08 22:50:24,171 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-08 22:50:24,171 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-08 22:50:24,279 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-08 22:50:24,280 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-08 22:50:24,328 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-08 22:50:24,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:50:24,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553515152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:24,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:50:24,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2025-03-08 22:50:24,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306709228] [2025-03-08 22:50:24,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:24,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:50:24,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:24,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:50:24,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:50:24,329 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-08 22:50:24,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:24,564 INFO L93 Difference]: Finished difference Result 182 states and 230 transitions. [2025-03-08 22:50:24,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:50:24,564 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-08 22:50:24,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:24,565 INFO L225 Difference]: With dead ends: 182 [2025-03-08 22:50:24,565 INFO L226 Difference]: Without dead ends: 182 [2025-03-08 22:50:24,565 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-08 22:50:24,565 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-08 22:50:24,566 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-08 22:50:24,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-08 22:50:24,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2025-03-08 22:50:24,567 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-08 22:50:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 220 transitions. [2025-03-08 22:50:24,568 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 220 transitions. Word has length 40 [2025-03-08 22:50:24,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:24,568 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 220 transitions. [2025-03-08 22:50:24,568 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-08 22:50:24,568 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 220 transitions. [2025-03-08 22:50:24,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 22:50:24,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:24,568 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-08 22:50:24,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:50:24,773 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-08 22:50:24,773 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-08 22:50:24,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:24,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1808528759, now seen corresponding path program 1 times [2025-03-08 22:50:24,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:24,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363320069] [2025-03-08 22:50:24,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:24,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:24,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 22:50:24,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 22:50:24,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:24,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:24,925 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-08 22:50:24,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:24,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363320069] [2025-03-08 22:50:24,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363320069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:24,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5079456] [2025-03-08 22:50:24,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:24,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:24,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:24,927 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-08 22:50:24,929 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-08 22:50:25,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 22:50:25,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 22:50:25,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:25,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:25,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 22:50:25,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:25,044 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-08 22:50:25,071 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 22:50:25,071 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-08 22:50:25,086 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:50:25,087 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-08 22:50:25,097 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-08 22:50:25,111 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 22:50:25,112 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-08 22:50:25,123 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-08 22:50:25,126 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-08 22:50:25,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:50:25,140 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1028) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1.base|))) is different from false [2025-03-08 22:50:25,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:50:25,148 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-08 22:50:25,157 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-08 22:50:25,160 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-08 22:50:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-08 22:50:25,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5079456] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:50:25,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:50:25,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2025-03-08 22:50:25,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669269744] [2025-03-08 22:50:25,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:50:25,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:50:25,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:25,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:50:25,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2025-03-08 22:50:25,215 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-08 22:50:25,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:25,412 INFO L93 Difference]: Finished difference Result 170 states and 215 transitions. [2025-03-08 22:50:25,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:50:25,415 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-08 22:50:25,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:25,416 INFO L225 Difference]: With dead ends: 170 [2025-03-08 22:50:25,416 INFO L226 Difference]: Without dead ends: 170 [2025-03-08 22:50:25,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=197, Unknown=1, NotChecked=30, Total=306 [2025-03-08 22:50:25,416 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 128 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:50:25,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 456 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 315 Invalid, 0 Unknown, 89 Unchecked, 0.2s Time] [2025-03-08 22:50:25,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-08 22:50:25,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2025-03-08 22:50:25,418 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-08 22:50:25,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 213 transitions. [2025-03-08 22:50:25,419 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 213 transitions. Word has length 40 [2025-03-08 22:50:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:25,419 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 213 transitions. [2025-03-08 22:50:25,419 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-08 22:50:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 213 transitions. [2025-03-08 22:50:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 22:50:25,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:25,419 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-08 22:50:25,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 22:50:25,619 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-08 22:50:25,620 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-08 22:50:25,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:25,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1848851299, now seen corresponding path program 1 times [2025-03-08 22:50:25,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:25,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274075865] [2025-03-08 22:50:25,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:25,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:25,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 22:50:25,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 22:50:25,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:25,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:25,681 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-08 22:50:25,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:25,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274075865] [2025-03-08 22:50:25,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274075865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:25,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:50:25,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:50:25,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896260711] [2025-03-08 22:50:25,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:25,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:50:25,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:25,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:50:25,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:50:25,683 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-08 22:50:25,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:25,844 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2025-03-08 22:50:25,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:50:25,844 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-08 22:50:25,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:25,845 INFO L225 Difference]: With dead ends: 165 [2025-03-08 22:50:25,845 INFO L226 Difference]: Without dead ends: 165 [2025-03-08 22:50:25,845 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-08 22:50:25,845 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-08 22:50:25,846 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-08 22:50:25,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-08 22:50:25,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-08 22:50:25,847 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-08 22:50:25,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 211 transitions. [2025-03-08 22:50:25,848 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 211 transitions. Word has length 41 [2025-03-08 22:50:25,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:25,848 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 211 transitions. [2025-03-08 22:50:25,848 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-08 22:50:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 211 transitions. [2025-03-08 22:50:25,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 22:50:25,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:25,848 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-08 22:50:25,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:50:25,848 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-08 22:50:25,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:25,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1848851298, now seen corresponding path program 1 times [2025-03-08 22:50:25,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:25,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822017740] [2025-03-08 22:50:25,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:25,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:25,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 22:50:25,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 22:50:25,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:25,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:26,071 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-08 22:50:26,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:26,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822017740] [2025-03-08 22:50:26,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822017740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:26,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327427142] [2025-03-08 22:50:26,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:26,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:26,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:26,073 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-08 22:50:26,075 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-08 22:50:26,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 22:50:26,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 22:50:26,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:26,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:26,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 22:50:26,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:26,223 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-08 22:50:26,282 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-08 22:50:26,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:50:26,318 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-08 22:50:26,323 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-08 22:50:26,405 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-08 22:50:26,441 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-08 22:50:26,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:50:26,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327427142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:50:26,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:50:26,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2025-03-08 22:50:26,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313851588] [2025-03-08 22:50:26,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:50:26,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:50:26,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:26,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:50:26,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:50:26,442 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-08 22:50:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:26,587 INFO L93 Difference]: Finished difference Result 185 states and 211 transitions. [2025-03-08 22:50:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:50:26,588 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-08 22:50:26,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:26,588 INFO L225 Difference]: With dead ends: 185 [2025-03-08 22:50:26,588 INFO L226 Difference]: Without dead ends: 185 [2025-03-08 22:50:26,588 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-08 22:50:26,589 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-08 22:50:26,589 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-08 22:50:26,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-08 22:50:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2025-03-08 22:50:26,590 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-08 22:50:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 209 transitions. [2025-03-08 22:50:26,591 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 209 transitions. Word has length 41 [2025-03-08 22:50:26,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:26,591 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 209 transitions. [2025-03-08 22:50:26,591 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-08 22:50:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 209 transitions. [2025-03-08 22:50:26,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 22:50:26,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:26,591 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-08 22:50:26,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 22:50:26,792 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-08 22:50:26,792 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-08 22:50:26,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:26,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1635435078, now seen corresponding path program 1 times [2025-03-08 22:50:26,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:26,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190081646] [2025-03-08 22:50:26,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:26,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:26,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:50:26,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:50:26,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:26,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:26,981 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-08 22:50:26,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:26,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190081646] [2025-03-08 22:50:26,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190081646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:26,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661362825] [2025-03-08 22:50:26,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:26,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:26,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:26,983 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-08 22:50:26,984 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-08 22:50:27,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:50:27,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:50:27,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:27,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:27,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 22:50:27,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:27,176 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-08 22:50:27,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:50:27,205 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-08 22:50:27,263 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-08 22:50:27,273 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-08 22:50:27,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:50:27,419 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-08 22:50:27,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661362825] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:50:27,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:50:27,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-03-08 22:50:27,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532717822] [2025-03-08 22:50:27,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:50:27,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 22:50:27,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:27,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 22:50:27,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-03-08 22:50:27,420 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-08 22:50:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:50:27,842 INFO L93 Difference]: Finished difference Result 184 states and 210 transitions. [2025-03-08 22:50:27,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 22:50:27,843 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-08 22:50:27,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:50:27,843 INFO L225 Difference]: With dead ends: 184 [2025-03-08 22:50:27,843 INFO L226 Difference]: Without dead ends: 184 [2025-03-08 22:50:27,844 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-08 22:50:27,844 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-08 22:50:27,844 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-08 22:50:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-08 22:50:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2025-03-08 22:50:27,846 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-08 22:50:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 208 transitions. [2025-03-08 22:50:27,846 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 208 transitions. Word has length 45 [2025-03-08 22:50:27,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:50:27,846 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 208 transitions. [2025-03-08 22:50:27,846 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-08 22:50:27,846 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 208 transitions. [2025-03-08 22:50:27,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 22:50:27,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:50:27,847 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-08 22:50:27,854 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-08 22:50:28,047 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-08 22:50:28,047 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-08 22:50:28,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:50:28,048 INFO L85 PathProgramCache]: Analyzing trace with hash 862636779, now seen corresponding path program 1 times [2025-03-08 22:50:28,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:50:28,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983038705] [2025-03-08 22:50:28,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:28,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:50:28,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 22:50:28,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 22:50:28,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:28,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:28,600 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-08 22:50:28,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:50:28,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983038705] [2025-03-08 22:50:28,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983038705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:50:28,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092165228] [2025-03-08 22:50:28,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:50:28,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:50:28,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:50:28,602 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-08 22:50:28,604 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-08 22:50:28,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 22:50:28,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 22:50:28,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:50:28,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:50:28,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-08 22:50:28,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:50:28,731 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-08 22:50:28,753 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 22:50:28,753 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-08 22:50:28,810 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-08 22:50:28,862 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-03-08 22:50:28,862 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-08 22:50:28,911 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-08 22:50:28,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-03-08 22:50:28,980 INFO L349 Elim1Store]: treesize reduction 72, result has 33.3 percent of original size [2025-03-08 22:50:28,980 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-08 22:50:29,109 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-08 22:50:29,152 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-08 22:50:29,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:50:29,218 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2025-03-08 22:50:29,218 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-08 22:50:29,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:50:29,699 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 22:50:29,699 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-08 22:50:29,705 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-08 22:50:29,952 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-08 22:50:30,006 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-08 22:50:30,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:50:30,291 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-08 22:50:31,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:50:31,425 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-08 22:50:31,428 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:50:31,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:50:31,435 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-08 22:50:31,443 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-08 22:50:31,453 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-08 22:50:31,465 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-08 22:50:31,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:50:31,475 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-08 22:50:32,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:50:32,666 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-08 22:50:32,671 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:50:32,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:50:32,685 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-08 22:50:32,699 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:50:32,702 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-08 22:50:32,711 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-08 22:50:32,719 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-08 22:50:32,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:50:32,733 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-08 22:50:43,441 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-08 22:50:43,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092165228] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:50:43,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:50:43,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 21] total 49 [2025-03-08 22:50:43,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864749269] [2025-03-08 22:50:43,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:50:43,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-08 22:50:43,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:50:43,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-08 22:50:43,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=2112, Unknown=16, NotChecked=0, Total=2450 [2025-03-08 22:50:43,443 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-08 22:50:54,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-08 22:51:02,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:51:02,449 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2025-03-08 22:51:02,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 22:51:02,450 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-08 22:51:02,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:51:02,451 INFO L225 Difference]: With dead ends: 207 [2025-03-08 22:51:02,451 INFO L226 Difference]: Without dead ends: 207 [2025-03-08 22:51:02,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=639, Invalid=3126, Unknown=17, NotChecked=0, Total=3782 [2025-03-08 22:51:02,452 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 120 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 26 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 2180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:51:02,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1133 Invalid, 2180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2150 Invalid, 4 Unknown, 0 Unchecked, 15.6s Time] [2025-03-08 22:51:02,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-08 22:51:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 163. [2025-03-08 22:51:02,454 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-08 22:51:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 203 transitions. [2025-03-08 22:51:02,454 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 203 transitions. Word has length 48 [2025-03-08 22:51:02,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:51:02,455 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 203 transitions. [2025-03-08 22:51:02,455 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-08 22:51:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 203 transitions. [2025-03-08 22:51:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 22:51:02,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:51:02,455 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-08 22:51:02,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 22:51:02,655 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-08 22:51:02,656 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-08 22:51:02,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:51:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash 862636780, now seen corresponding path program 1 times [2025-03-08 22:51:02,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:51:02,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762325387] [2025-03-08 22:51:02,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:02,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:51:02,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 22:51:02,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 22:51:02,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:02,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:04,919 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-08 22:51:04,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:51:04,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762325387] [2025-03-08 22:51:04,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762325387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:51:04,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075248125] [2025-03-08 22:51:04,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:51:04,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:51:04,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:51:04,922 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-08 22:51:04,922 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-08 22:51:05,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 22:51:05,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 22:51:05,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:51:05,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:51:05,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-08 22:51:05,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:51:05,061 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-08 22:51:05,096 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-08 22:51:05,283 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:51:05,283 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-08 22:51:05,421 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 22:51:05,421 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-08 22:51:05,967 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-08 22:51:06,006 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-08 22:51:06,473 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-03-08 22:51:06,473 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-08 22:51:06,521 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-08 22:51:06,786 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-08 22:51:06,852 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-08 22:51:06,964 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-08 22:51:07,003 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-08 22:51:07,146 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-08 22:51:07,146 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-08 22:51:07,196 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-08 22:51:07,718 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-08 22:51:07,757 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-08 22:51:07,872 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-08 22:51:07,924 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-08 22:51:08,187 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 22:51:08,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 66 [2025-03-08 22:51:08,198 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-08 22:51:08,910 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-08 22:51:09,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:09,632 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-08 22:51:10,283 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-08 22:51:10,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:51:11,407 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-08 22:51:11,492 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-08 22:51:13,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:13,859 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-08 22:51:13,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:13,901 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-08 22:51:13,913 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-08 22:51:13,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:51:14,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:14,382 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-08 22:51:14,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:14,406 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-08 22:51:14,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:14,467 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-08 22:51:14,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:51:14,558 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-08 22:51:14,575 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-08 22:51:14,590 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-08 22:51:14,603 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-08 22:51:14,618 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-08 22:51:18,043 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-08 22:51:18,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075248125] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:51:18,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:51:18,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-03-08 22:51:18,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794483672] [2025-03-08 22:51:18,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:51:18,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 22:51:18,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:51:18,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 22:51:18,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1217, Unknown=16, NotChecked=146, Total=1560 [2025-03-08 22:51:18,045 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-08 22:51:22,382 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] [2025-03-08 22:51:26,472 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]