./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-sorted-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:34:55,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:34:55,571 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:34:55,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:34:55,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:34:55,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:34:55,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:34:55,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:34:55,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:34:55,603 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:34:55,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:34:55,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:34:55,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:34:55,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:34:55,605 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:34:55,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:34:55,606 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:34:55,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:34:55,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:34:55,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:34:55,606 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:34:55,606 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:34:55,606 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:34:55,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:34:55,607 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:34:55,607 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:34:55,607 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:34:55,607 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:34:55,607 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:34:55,607 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:34:55,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:34:55,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:34:55,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:34:55,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:34:55,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:34:55,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:34:55,609 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:34:55,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:34:55,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:34:55,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:34:55,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:34:55,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:34:55,609 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f [2025-02-06 10:34:55,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:34:55,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:34:55,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:34:55,909 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:34:55,910 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:34:55,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-sorted-2.i [2025-02-06 10:34:57,153 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccd0d9771/66beacdb04054a6d94356a1923c2af6e/FLAGb2f50918c [2025-02-06 10:34:57,474 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:34:57,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i [2025-02-06 10:34:57,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccd0d9771/66beacdb04054a6d94356a1923c2af6e/FLAGb2f50918c [2025-02-06 10:34:57,747 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccd0d9771/66beacdb04054a6d94356a1923c2af6e [2025-02-06 10:34:57,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:34:57,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:34:57,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:34:57,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:34:57,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:34:57,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:34:57" (1/1) ... [2025-02-06 10:34:57,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@465b336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:34:57, skipping insertion in model container [2025-02-06 10:34:57,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:34:57" (1/1) ... [2025-02-06 10:34:57,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:34:58,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:34:58,095 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:34:58,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:34:58,179 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:34:58,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:34:58 WrapperNode [2025-02-06 10:34:58,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:34:58,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:34:58,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:34:58,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:34:58,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:34:58" (1/1) ... [2025-02-06 10:34:58,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:34:58" (1/1) ... [2025-02-06 10:34:58,222 INFO L138 Inliner]: procedures = 119, calls = 47, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 184 [2025-02-06 10:34:58,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:34:58,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:34:58,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:34:58,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:34:58,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:34:58" (1/1) ... [2025-02-06 10:34:58,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:34:58" (1/1) ... [2025-02-06 10:34:58,232 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:34:58" (1/1) ... [2025-02-06 10:34:58,249 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 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-02-06 10:34:58,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:34:58" (1/1) ... [2025-02-06 10:34:58,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:34:58" (1/1) ... [2025-02-06 10:34:58,256 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:34:58" (1/1) ... [2025-02-06 10:34:58,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:34:58" (1/1) ... [2025-02-06 10:34:58,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:34:58" (1/1) ... [2025-02-06 10:34:58,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:34:58" (1/1) ... [2025-02-06 10:34:58,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:34:58,262 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:34:58,262 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:34:58,262 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:34:58,263 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:34:58" (1/1) ... [2025-02-06 10:34:58,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:34:58,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:34:58,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:34:58,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:34:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 10:34:58,317 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 10:34:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:34:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:34:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:34:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:34:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:34:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:34:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:34:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:34:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:34:58,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:34:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:34:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:34:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:34:58,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:34:58,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:34:58,415 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:34:58,417 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:34:58,853 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2025-02-06 10:34:58,853 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:34:58,870 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:34:58,873 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:34:58,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:34:58 BoogieIcfgContainer [2025-02-06 10:34:58,873 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:34:58,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:34:58,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:34:58,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:34:58,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:34:57" (1/3) ... [2025-02-06 10:34:58,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1035d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:34:58, skipping insertion in model container [2025-02-06 10:34:58,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:34:58" (2/3) ... [2025-02-06 10:34:58,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1035d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:34:58, skipping insertion in model container [2025-02-06 10:34:58,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:34:58" (3/3) ... [2025-02-06 10:34:58,884 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2025-02-06 10:34:58,898 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:34:58,899 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-sorted-2.i that has 2 procedures, 178 locations, 1 initial locations, 13 loop locations, and 65 error locations. [2025-02-06 10:34:58,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:34:58,955 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;@212bb7d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:34:58,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-02-06 10:34:58,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 104 states have (on average 1.9903846153846154) internal successors, (207), 169 states have internal predecessors, (207), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 10:34:58,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:34:58,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:58,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:34:58,964 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-06 10:34:58,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:58,970 INFO L85 PathProgramCache]: Analyzing trace with hash 243252, now seen corresponding path program 1 times [2025-02-06 10:34:58,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:58,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001350071] [2025-02-06 10:34:58,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:58,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:59,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:34:59,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:34:59,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:59,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:59,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:59,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001350071] [2025-02-06 10:34:59,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001350071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:59,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:59,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:34:59,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952762194] [2025-02-06 10:34:59,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:59,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:34:59,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:59,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:34:59,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:34:59,158 INFO L87 Difference]: Start difference. First operand has 178 states, 104 states have (on average 1.9903846153846154) internal successors, (207), 169 states have internal predecessors, (207), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:59,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:59,347 INFO L93 Difference]: Finished difference Result 167 states and 184 transitions. [2025-02-06 10:34:59,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:34:59,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 10:34:59,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:59,355 INFO L225 Difference]: With dead ends: 167 [2025-02-06 10:34:59,356 INFO L226 Difference]: Without dead ends: 165 [2025-02-06 10:34:59,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:34:59,362 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 153 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:59,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 128 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:34:59,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-06 10:34:59,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-06 10:34:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 95 states have (on average 1.8421052631578947) internal successors, (175), 163 states have internal predecessors, (175), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 182 transitions. [2025-02-06 10:34:59,414 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 182 transitions. Word has length 3 [2025-02-06 10:34:59,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:59,416 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 182 transitions. [2025-02-06 10:34:59,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 182 transitions. [2025-02-06 10:34:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:34:59,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:59,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:34:59,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:34:59,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-06 10:34:59,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:59,418 INFO L85 PathProgramCache]: Analyzing trace with hash 243253, now seen corresponding path program 1 times [2025-02-06 10:34:59,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:59,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040230450] [2025-02-06 10:34:59,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:59,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:59,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:34:59,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:34:59,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:59,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:59,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:59,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:59,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040230450] [2025-02-06 10:34:59,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040230450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:59,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:59,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:34:59,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305941818] [2025-02-06 10:34:59,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:59,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:34:59,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:59,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:34:59,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:34:59,544 INFO L87 Difference]: Start difference. First operand 165 states and 182 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:34:59,680 INFO L93 Difference]: Finished difference Result 163 states and 180 transitions. [2025-02-06 10:34:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:34:59,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 10:34:59,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:34:59,682 INFO L225 Difference]: With dead ends: 163 [2025-02-06 10:34:59,682 INFO L226 Difference]: Without dead ends: 163 [2025-02-06 10:34:59,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:34:59,683 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 153 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:34:59,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 124 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:34:59,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-06 10:34:59,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-02-06 10:34:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 95 states have (on average 1.8210526315789475) internal successors, (173), 161 states have internal predecessors, (173), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 180 transitions. [2025-02-06 10:34:59,700 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 180 transitions. Word has length 3 [2025-02-06 10:34:59,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:34:59,700 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 180 transitions. [2025-02-06 10:34:59,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:34:59,701 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 180 transitions. [2025-02-06 10:34:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:34:59,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:34:59,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:34:59,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:34:59,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-06 10:34:59,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:34:59,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2126085718, now seen corresponding path program 1 times [2025-02-06 10:34:59,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:34:59,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024945763] [2025-02-06 10:34:59,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:34:59,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:34:59,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:34:59,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:34:59,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:34:59,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:34:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:34:59,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:34:59,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024945763] [2025-02-06 10:34:59,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024945763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:34:59,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:34:59,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:34:59,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949345827] [2025-02-06 10:34:59,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:34:59,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:34:59,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:34:59,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:34:59,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:34:59,867 INFO L87 Difference]: Start difference. First operand 163 states and 180 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:00,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:00,069 INFO L93 Difference]: Finished difference Result 163 states and 189 transitions. [2025-02-06 10:35:00,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:35:00,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:35:00,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:00,070 INFO L225 Difference]: With dead ends: 163 [2025-02-06 10:35:00,070 INFO L226 Difference]: Without dead ends: 163 [2025-02-06 10:35:00,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:35:00,071 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 242 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:00,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 102 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:35:00,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-06 10:35:00,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2025-02-06 10:35:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 110 states have (on average 1.6545454545454545) internal successors, (182), 159 states have internal predecessors, (182), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2025-02-06 10:35:00,078 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 8 [2025-02-06 10:35:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:00,079 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2025-02-06 10:35:00,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2025-02-06 10:35:00,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:35:00,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:00,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:00,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:35:00,079 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-06 10:35:00,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:00,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2126085719, now seen corresponding path program 1 times [2025-02-06 10:35:00,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:00,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122729135] [2025-02-06 10:35:00,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:00,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:00,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:35:00,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:35:00,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:00,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:00,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:00,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122729135] [2025-02-06 10:35:00,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122729135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:00,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:00,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:35:00,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706416062] [2025-02-06 10:35:00,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:00,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:35:00,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:00,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:35:00,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:35:00,340 INFO L87 Difference]: Start difference. First operand 161 states and 189 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:00,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:00,650 INFO L93 Difference]: Finished difference Result 230 states and 267 transitions. [2025-02-06 10:35:00,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:35:00,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:35:00,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:00,653 INFO L225 Difference]: With dead ends: 230 [2025-02-06 10:35:00,653 INFO L226 Difference]: Without dead ends: 230 [2025-02-06 10:35:00,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:35:00,654 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 509 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:00,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 211 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:35:00,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-06 10:35:00,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 216. [2025-02-06 10:35:00,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 165 states have (on average 1.5393939393939393) internal successors, (254), 214 states have internal predecessors, (254), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 261 transitions. [2025-02-06 10:35:00,674 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 261 transitions. Word has length 8 [2025-02-06 10:35:00,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:00,674 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 261 transitions. [2025-02-06 10:35:00,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:00,677 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 261 transitions. [2025-02-06 10:35:00,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 10:35:00,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:00,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:00,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:35:00,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-06 10:35:00,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:00,678 INFO L85 PathProgramCache]: Analyzing trace with hash 327984227, now seen corresponding path program 1 times [2025-02-06 10:35:00,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:00,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755925092] [2025-02-06 10:35:00,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:00,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:00,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 10:35:00,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 10:35:00,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:00,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:00,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:00,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755925092] [2025-02-06 10:35:00,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755925092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:00,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:00,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:35:00,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352759690] [2025-02-06 10:35:00,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:00,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:35:00,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:00,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:35:00,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:35:00,726 INFO L87 Difference]: Start difference. First operand 216 states and 261 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:00,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:00,752 INFO L93 Difference]: Finished difference Result 254 states and 302 transitions. [2025-02-06 10:35:00,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:35:00,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-06 10:35:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:00,756 INFO L225 Difference]: With dead ends: 254 [2025-02-06 10:35:00,756 INFO L226 Difference]: Without dead ends: 254 [2025-02-06 10:35:00,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:35:00,757 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 48 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:00,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 332 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:35:00,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-06 10:35:00,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 226. [2025-02-06 10:35:00,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 175 states have (on average 1.5314285714285714) internal successors, (268), 224 states have internal predecessors, (268), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 275 transitions. [2025-02-06 10:35:00,764 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 275 transitions. Word has length 13 [2025-02-06 10:35:00,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:00,764 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 275 transitions. [2025-02-06 10:35:00,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:00,765 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 275 transitions. [2025-02-06 10:35:00,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:35:00,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:00,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:00,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:35:00,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-06 10:35:00,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1859438929, now seen corresponding path program 1 times [2025-02-06 10:35:00,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:00,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054311947] [2025-02-06 10:35:00,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:00,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:00,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:35:00,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:35:00,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:00,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:01,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:01,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054311947] [2025-02-06 10:35:01,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054311947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:01,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:01,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:35:01,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913904592] [2025-02-06 10:35:01,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:01,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:35:01,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:01,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:35:01,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:35:01,017 INFO L87 Difference]: Start difference. First operand 226 states and 275 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:01,248 INFO L93 Difference]: Finished difference Result 221 states and 267 transitions. [2025-02-06 10:35:01,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:35:01,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-02-06 10:35:01,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:01,249 INFO L225 Difference]: With dead ends: 221 [2025-02-06 10:35:01,249 INFO L226 Difference]: Without dead ends: 221 [2025-02-06 10:35:01,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:35:01,250 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 12 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:01,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 503 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:35:01,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-02-06 10:35:01,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2025-02-06 10:35:01,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 170 states have (on average 1.5) internal successors, (255), 214 states have internal predecessors, (255), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 262 transitions. [2025-02-06 10:35:01,257 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 262 transitions. Word has length 12 [2025-02-06 10:35:01,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:01,258 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 262 transitions. [2025-02-06 10:35:01,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:01,258 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 262 transitions. [2025-02-06 10:35:01,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:35:01,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:01,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:35:01,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:35:01,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-06 10:35:01,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:01,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1859438928, now seen corresponding path program 1 times [2025-02-06 10:35:01,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:01,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586145312] [2025-02-06 10:35:01,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:01,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:01,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:35:01,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:35:01,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:01,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:01,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:01,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:01,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586145312] [2025-02-06 10:35:01,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586145312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:01,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:01,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:35:01,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694379294] [2025-02-06 10:35:01,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:01,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:35:01,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:01,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:35:01,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:35:01,348 INFO L87 Difference]: Start difference. First operand 216 states and 262 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:01,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:01,581 INFO L93 Difference]: Finished difference Result 222 states and 269 transitions. [2025-02-06 10:35:01,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:35:01,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-02-06 10:35:01,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:01,582 INFO L225 Difference]: With dead ends: 222 [2025-02-06 10:35:01,582 INFO L226 Difference]: Without dead ends: 222 [2025-02-06 10:35:01,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-02-06 10:35:01,583 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 74 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:01,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 392 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:35:01,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-06 10:35:01,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 215. [2025-02-06 10:35:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 170 states have (on average 1.488235294117647) internal successors, (253), 213 states have internal predecessors, (253), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 260 transitions. [2025-02-06 10:35:01,589 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 260 transitions. Word has length 12 [2025-02-06 10:35:01,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:01,589 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 260 transitions. [2025-02-06 10:35:01,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 260 transitions. [2025-02-06 10:35:01,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:35:01,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:01,590 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] [2025-02-06 10:35:01,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:35:01,590 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-06 10:35:01,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:01,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1294170360, now seen corresponding path program 1 times [2025-02-06 10:35:01,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:01,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412423130] [2025-02-06 10:35:01,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:01,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:01,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:35:01,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:35:01,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:01,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:35:01,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:01,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412423130] [2025-02-06 10:35:01,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412423130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:35:01,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:35:01,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:35:01,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623015516] [2025-02-06 10:35:01,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:35:01,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:35:01,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:01,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:35:01,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:35:01,663 INFO L87 Difference]: Start difference. First operand 215 states and 260 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:01,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:01,790 INFO L93 Difference]: Finished difference Result 232 states and 266 transitions. [2025-02-06 10:35:01,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:35:01,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:35:01,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:01,791 INFO L225 Difference]: With dead ends: 232 [2025-02-06 10:35:01,791 INFO L226 Difference]: Without dead ends: 232 [2025-02-06 10:35:01,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:35:01,792 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 272 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:01,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 221 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:35:01,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-06 10:35:01,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 214. [2025-02-06 10:35:01,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 170 states have (on average 1.4705882352941178) internal successors, (250), 212 states have internal predecessors, (250), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:01,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2025-02-06 10:35:01,801 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 256 transitions. Word has length 24 [2025-02-06 10:35:01,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:01,802 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 256 transitions. [2025-02-06 10:35:01,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 256 transitions. [2025-02-06 10:35:01,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:35:01,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:01,805 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-02-06 10:35:01,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:35:01,805 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-06 10:35:01,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:01,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1520181507, now seen corresponding path program 1 times [2025-02-06 10:35:01,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:01,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393549502] [2025-02-06 10:35:01,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:01,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:01,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:35:01,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:35:01,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:01,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:02,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:02,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393549502] [2025-02-06 10:35:02,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393549502] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:35:02,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290510508] [2025-02-06 10:35:02,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:02,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:02,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:35:02,243 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:35:02,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:35:02,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:35:02,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:35:02,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:02,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:02,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 10:35:02,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:35:02,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:35:02,496 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:35:02,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:35:02,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:35:02,694 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-06 10:35:02,694 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 24 treesize of output 17 [2025-02-06 10:35:02,788 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:35:02,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-06 10:35:02,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 10:35:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:02,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:35:03,288 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2025-02-06 10:35:03,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-02-06 10:35:03,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:35:03,520 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 18 treesize of output 19 [2025-02-06 10:35:03,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:35:03,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2025-02-06 10:35:03,541 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 9 treesize of output 7 [2025-02-06 10:35:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:03,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290510508] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:35:03,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:35:03,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2025-02-06 10:35:03,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191229399] [2025-02-06 10:35:03,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:35:03,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 10:35:03,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:35:03,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 10:35:03,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=832, Unknown=5, NotChecked=0, Total=930 [2025-02-06 10:35:03,860 INFO L87 Difference]: Start difference. First operand 214 states and 256 transitions. Second operand has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 31 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:35:05,321 INFO L93 Difference]: Finished difference Result 327 states and 375 transitions. [2025-02-06 10:35:05,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:35:05,321 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 31 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-06 10:35:05,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:35:05,323 INFO L225 Difference]: With dead ends: 327 [2025-02-06 10:35:05,323 INFO L226 Difference]: Without dead ends: 327 [2025-02-06 10:35:05,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=224, Invalid=1331, Unknown=5, NotChecked=0, Total=1560 [2025-02-06 10:35:05,324 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 610 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:35:05,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1719 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 10:35:05,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-02-06 10:35:05,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 238. [2025-02-06 10:35:05,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 194 states have (on average 1.4381443298969072) internal successors, (279), 236 states have internal predecessors, (279), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 285 transitions. [2025-02-06 10:35:05,330 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 285 transitions. Word has length 29 [2025-02-06 10:35:05,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:35:05,330 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 285 transitions. [2025-02-06 10:35:05,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 31 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:35:05,331 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 285 transitions. [2025-02-06 10:35:05,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:35:05,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:35:05,331 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-02-06 10:35:05,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 10:35:05,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:05,532 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-02-06 10:35:05,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:35:05,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1520181508, now seen corresponding path program 1 times [2025-02-06 10:35:05,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:35:05,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563625523] [2025-02-06 10:35:05,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:05,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:35:05,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:35:05,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:35:05,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:05,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:06,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:35:06,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563625523] [2025-02-06 10:35:06,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563625523] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:35:06,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689204249] [2025-02-06 10:35:06,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:35:06,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:35:06,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:35:06,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:35:06,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:35:06,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:35:06,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:35:06,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:35:06,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:35:06,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-06 10:35:06,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:35:06,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:35:06,207 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-02-06 10:35:06,311 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-06 10:35:06,312 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 19 treesize of output 18 [2025-02-06 10:35:06,331 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-02-06 10:35:06,332 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 19 treesize of output 22 [2025-02-06 10:35:06,437 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:35:06,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-02-06 10:35:06,445 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:35:06,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2025-02-06 10:35:06,880 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:35:06,881 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 30 [2025-02-06 10:35:06,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:35:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:35:06,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:35:07,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:35:07,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 199 [2025-02-06 10:36:08,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:36:08,040 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 46671 treesize of output 44615 [2025-02-06 10:36:08,722 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 1274 treesize of output 1242 [2025-02-06 10:36:11,248 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,248 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,251 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-06 10:36:11,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:36:11,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:36:11,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:36:11,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:36:11,258 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:36:11,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:36:11,264 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:36:11,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:36:11,274 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,274 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:36:11,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:36:11,282 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,282 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,285 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,286 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,288 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-06 10:36:11,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:36:11,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:36:11,293 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:36:11,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:36:11,298 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,312 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,313 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,316 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-06 10:36:11,319 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,320 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,323 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-06 10:36:11,326 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,327 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,329 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-06 10:36:11,332 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,333 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,335 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-02-06 10:36:11,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:36:11,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:36:11,339 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:11,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:36:11,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:36:11,347 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:36:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:36:18,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689204249] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:36:18,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:36:18,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 37 [2025-02-06 10:36:18,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448567584] [2025-02-06 10:36:18,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:36:18,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-06 10:36:18,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:36:18,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-06 10:36:18,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1255, Unknown=7, NotChecked=0, Total=1406 [2025-02-06 10:36:18,889 INFO L87 Difference]: Start difference. First operand 238 states and 285 transitions. Second operand has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 38 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)