./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/lockfree-3.0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/lockfree-3.0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce7b97696e85da66033a1f3711f1d24681434c76600ae3cd891d7ea07b7fcbea --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:47:53,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:47:53,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:47:53,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:47:53,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:47:53,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:47:53,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:47:53,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:47:53,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:47:53,096 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:47:53,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:47:53,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:47:53,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:47:53,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:47:53,098 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:47:53,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:47:53,098 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:47:53,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:47:53,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:47:53,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:47:53,099 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:47:53,099 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:47:53,099 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:47:53,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:47:53,099 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:47:53,099 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:47:53,099 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:47:53,099 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:47:53,099 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:47:53,099 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:47:53,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:47:53,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:47:53,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:47:53,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:47:53,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:47:53,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:47:53,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:47:53,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:47:53,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:47:53,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:47:53,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:47:53,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:47:53,101 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce7b97696e85da66033a1f3711f1d24681434c76600ae3cd891d7ea07b7fcbea [2025-03-08 22:47:53,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:47:53,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:47:53,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:47:53,333 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:47:53,333 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:47:53,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/lockfree-3.0.i [2025-03-08 22:47:54,424 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc5366cd/6b248f12671540a2ab4c7b6abb0cfaee/FLAG7a2d19d00 [2025-03-08 22:47:54,704 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:47:54,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/lockfree-3.0.i [2025-03-08 22:47:54,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc5366cd/6b248f12671540a2ab4c7b6abb0cfaee/FLAG7a2d19d00 [2025-03-08 22:47:54,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc5366cd/6b248f12671540a2ab4c7b6abb0cfaee [2025-03-08 22:47:54,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:47:54,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:47:54,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:47:54,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:47:54,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:47:54,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:47:54" (1/1) ... [2025-03-08 22:47:54,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3717b099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:54, skipping insertion in model container [2025-03-08 22:47:54,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:47:54" (1/1) ... [2025-03-08 22:47:54,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:47:54,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:47:54,977 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:47:55,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:47:55,018 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:47:55,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:55 WrapperNode [2025-03-08 22:47:55,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:47:55,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:47:55,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:47:55,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:47:55,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:55" (1/1) ... [2025-03-08 22:47:55,031 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:55" (1/1) ... [2025-03-08 22:47:55,043 INFO L138 Inliner]: procedures = 125, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2025-03-08 22:47:55,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:47:55,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:47:55,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:47:55,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:47:55,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:55" (1/1) ... [2025-03-08 22:47:55,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:55" (1/1) ... [2025-03-08 22:47:55,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:55" (1/1) ... [2025-03-08 22:47:55,063 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-08 22:47:55,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:55" (1/1) ... [2025-03-08 22:47:55,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:55" (1/1) ... [2025-03-08 22:47:55,068 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:55" (1/1) ... [2025-03-08 22:47:55,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:55" (1/1) ... [2025-03-08 22:47:55,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:55" (1/1) ... [2025-03-08 22:47:55,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:55" (1/1) ... [2025-03-08 22:47:55,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:47:55,075 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:47:55,076 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:47:55,076 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:47:55,076 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:55" (1/1) ... [2025-03-08 22:47:55,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:47:55,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:55,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:47:55,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:47:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:47:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:47:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:47:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:47:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:47:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:47:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:47:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:47:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:47:55,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:47:55,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:47:55,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:47:55,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:47:55,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:47:55,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:47:55,221 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:47:55,223 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:47:55,467 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-08 22:47:55,467 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:47:55,479 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:47:55,479 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:47:55,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:47:55 BoogieIcfgContainer [2025-03-08 22:47:55,480 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:47:55,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:47:55,482 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:47:55,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:47:55,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:47:54" (1/3) ... [2025-03-08 22:47:55,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3923f0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:47:55, skipping insertion in model container [2025-03-08 22:47:55,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:47:55" (2/3) ... [2025-03-08 22:47:55,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3923f0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:47:55, skipping insertion in model container [2025-03-08 22:47:55,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:47:55" (3/3) ... [2025-03-08 22:47:55,488 INFO L128 eAbstractionObserver]: Analyzing ICFG lockfree-3.0.i [2025-03-08 22:47:55,501 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:47:55,502 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lockfree-3.0.i that has 1 procedures, 63 locations, 1 initial locations, 2 loop locations, and 20 error locations. [2025-03-08 22:47:55,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:47:55,537 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;@606af4b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:47:55,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-08 22:47:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 62 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 22:47:55,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:55,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 22:47:55,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:47:55,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:55,548 INFO L85 PathProgramCache]: Analyzing trace with hash 134521835, now seen corresponding path program 1 times [2025-03-08 22:47:55,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:55,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571360977] [2025-03-08 22:47:55,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:55,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:55,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 22:47:55,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 22:47:55,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:55,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:55,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:55,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571360977] [2025-03-08 22:47:55,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571360977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:55,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:55,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:47:55,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036604603] [2025-03-08 22:47:55,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:55,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:47:55,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:55,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:47:55,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:47:55,671 INFO L87 Difference]: Start difference. First operand has 63 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 62 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:55,680 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2025-03-08 22:47:55,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:47:55,681 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 22:47:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:55,685 INFO L225 Difference]: With dead ends: 63 [2025-03-08 22:47:55,685 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 22:47:55,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:47:55,688 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:55,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:55,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 22:47:55,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-08 22:47:55,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 60 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2025-03-08 22:47:55,713 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 5 [2025-03-08 22:47:55,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:55,713 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2025-03-08 22:47:55,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:55,713 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2025-03-08 22:47:55,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:47:55,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:55,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:55,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:47:55,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:47:55,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:55,715 INFO L85 PathProgramCache]: Analyzing trace with hash 428708584, now seen corresponding path program 1 times [2025-03-08 22:47:55,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:55,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189421260] [2025-03-08 22:47:55,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:55,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:55,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:47:55,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:47:55,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:55,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:55,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:55,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:55,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189421260] [2025-03-08 22:47:55,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189421260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:55,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:55,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:47:55,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817606132] [2025-03-08 22:47:55,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:55,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:47:55,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:55,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:47:55,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:55,771 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:55,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:55,848 INFO L93 Difference]: Finished difference Result 113 states and 147 transitions. [2025-03-08 22:47:55,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:47:55,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-03-08 22:47:55,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:55,849 INFO L225 Difference]: With dead ends: 113 [2025-03-08 22:47:55,850 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 22:47:55,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:55,851 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:55,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 120 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:47:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 22:47:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2025-03-08 22:47:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.8888888888888888) internal successors, (136), 91 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2025-03-08 22:47:55,859 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 7 [2025-03-08 22:47:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:55,859 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 136 transitions. [2025-03-08 22:47:55,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2025-03-08 22:47:55,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:47:55,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:55,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:55,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:47:55,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:47:55,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:55,864 INFO L85 PathProgramCache]: Analyzing trace with hash 428708936, now seen corresponding path program 1 times [2025-03-08 22:47:55,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:55,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336683039] [2025-03-08 22:47:55,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:55,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:55,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:47:55,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:47:55,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:55,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:55,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:55,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336683039] [2025-03-08 22:47:55,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336683039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:55,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:55,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:47:55,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651011271] [2025-03-08 22:47:55,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:55,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:47:55,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:55,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:47:55,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:55,930 INFO L87 Difference]: Start difference. First operand 92 states and 136 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:55,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:55,963 INFO L93 Difference]: Finished difference Result 170 states and 257 transitions. [2025-03-08 22:47:55,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:47:55,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-03-08 22:47:55,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:55,965 INFO L225 Difference]: With dead ends: 170 [2025-03-08 22:47:55,967 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 22:47:55,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:55,968 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 61 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:55,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 138 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:55,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 22:47:55,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 147. [2025-03-08 22:47:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.889763779527559) internal successors, (240), 146 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:55,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 240 transitions. [2025-03-08 22:47:55,977 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 240 transitions. Word has length 7 [2025-03-08 22:47:55,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:55,977 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 240 transitions. [2025-03-08 22:47:55,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:55,978 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 240 transitions. [2025-03-08 22:47:55,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:47:55,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:55,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:55,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:47:55,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:47:55,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:55,982 INFO L85 PathProgramCache]: Analyzing trace with hash 405149582, now seen corresponding path program 1 times [2025-03-08 22:47:55,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:55,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730767718] [2025-03-08 22:47:55,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:55,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:55,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:47:56,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:47:56,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:56,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:56,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:56,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:56,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730767718] [2025-03-08 22:47:56,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730767718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:56,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:56,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:47:56,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155636600] [2025-03-08 22:47:56,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:56,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:47:56,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:56,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:47:56,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:56,056 INFO L87 Difference]: Start difference. First operand 147 states and 240 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:56,119 INFO L93 Difference]: Finished difference Result 223 states and 347 transitions. [2025-03-08 22:47:56,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:47:56,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 22:47:56,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:56,123 INFO L225 Difference]: With dead ends: 223 [2025-03-08 22:47:56,123 INFO L226 Difference]: Without dead ends: 223 [2025-03-08 22:47:56,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:56,124 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 68 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:56,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 170 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:47:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-08 22:47:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 201. [2025-03-08 22:47:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 183 states have (on average 1.819672131147541) internal successors, (333), 200 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 333 transitions. [2025-03-08 22:47:56,134 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 333 transitions. Word has length 8 [2025-03-08 22:47:56,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:56,134 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 333 transitions. [2025-03-08 22:47:56,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 333 transitions. [2025-03-08 22:47:56,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:47:56,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:56,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:56,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:47:56,135 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:47:56,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:56,136 INFO L85 PathProgramCache]: Analyzing trace with hash 405149583, now seen corresponding path program 1 times [2025-03-08 22:47:56,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:56,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619060982] [2025-03-08 22:47:56,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:56,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:56,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:47:56,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:47:56,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:56,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:56,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:56,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619060982] [2025-03-08 22:47:56,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619060982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:56,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:56,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:47:56,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163458750] [2025-03-08 22:47:56,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:56,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:47:56,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:56,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:47:56,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:56,249 INFO L87 Difference]: Start difference. First operand 201 states and 333 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:56,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:56,300 INFO L93 Difference]: Finished difference Result 218 states and 338 transitions. [2025-03-08 22:47:56,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:47:56,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 22:47:56,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:56,301 INFO L225 Difference]: With dead ends: 218 [2025-03-08 22:47:56,301 INFO L226 Difference]: Without dead ends: 218 [2025-03-08 22:47:56,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:47:56,302 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 67 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:56,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 177 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:56,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-08 22:47:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 199. [2025-03-08 22:47:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 183 states have (on average 1.7759562841530054) internal successors, (325), 198 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 325 transitions. [2025-03-08 22:47:56,311 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 325 transitions. Word has length 8 [2025-03-08 22:47:56,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:56,311 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 325 transitions. [2025-03-08 22:47:56,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:56,312 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 325 transitions. [2025-03-08 22:47:56,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:47:56,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:56,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:56,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:47:56,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:47:56,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:56,313 INFO L85 PathProgramCache]: Analyzing trace with hash -325263160, now seen corresponding path program 1 times [2025-03-08 22:47:56,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:56,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722811207] [2025-03-08 22:47:56,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:56,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:56,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:47:56,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:47:56,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:56,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:56,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:56,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722811207] [2025-03-08 22:47:56,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722811207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:56,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:56,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:47:56,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298769563] [2025-03-08 22:47:56,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:56,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:47:56,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:56,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:47:56,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:47:56,365 INFO L87 Difference]: Start difference. First operand 199 states and 325 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:56,408 INFO L93 Difference]: Finished difference Result 370 states and 578 transitions. [2025-03-08 22:47:56,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:47:56,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 22:47:56,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:56,410 INFO L225 Difference]: With dead ends: 370 [2025-03-08 22:47:56,410 INFO L226 Difference]: Without dead ends: 370 [2025-03-08 22:47:56,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:47:56,412 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 52 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:56,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 260 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:56,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-08 22:47:56,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 343. [2025-03-08 22:47:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 327 states have (on average 1.7033639143730888) internal successors, (557), 342 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:56,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 557 transitions. [2025-03-08 22:47:56,428 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 557 transitions. Word has length 9 [2025-03-08 22:47:56,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:56,428 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 557 transitions. [2025-03-08 22:47:56,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:56,428 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 557 transitions. [2025-03-08 22:47:56,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:47:56,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:56,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:56,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:47:56,429 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:47:56,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:56,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1453134797, now seen corresponding path program 1 times [2025-03-08 22:47:56,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:56,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407747318] [2025-03-08 22:47:56,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:56,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:56,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:47:56,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:47:56,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:56,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:56,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:56,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407747318] [2025-03-08 22:47:56,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407747318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:56,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:56,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:47:56,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497783895] [2025-03-08 22:47:56,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:56,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:47:56,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:56,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:47:56,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:47:56,487 INFO L87 Difference]: Start difference. First operand 343 states and 557 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:56,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:56,525 INFO L93 Difference]: Finished difference Result 606 states and 920 transitions. [2025-03-08 22:47:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:47:56,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-03-08 22:47:56,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:56,527 INFO L225 Difference]: With dead ends: 606 [2025-03-08 22:47:56,528 INFO L226 Difference]: Without dead ends: 606 [2025-03-08 22:47:56,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:47:56,529 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 44 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:56,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 255 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:56,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-03-08 22:47:56,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 575. [2025-03-08 22:47:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 559 states have (on average 1.5974955277280858) internal successors, (893), 574 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 893 transitions. [2025-03-08 22:47:56,543 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 893 transitions. Word has length 10 [2025-03-08 22:47:56,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:56,543 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 893 transitions. [2025-03-08 22:47:56,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 893 transitions. [2025-03-08 22:47:56,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 22:47:56,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:56,545 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:56,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:47:56,545 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:47:56,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:56,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2010883166, now seen corresponding path program 1 times [2025-03-08 22:47:56,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:56,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376097243] [2025-03-08 22:47:56,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:56,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:56,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:47:56,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:47:56,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:56,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:56,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:56,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376097243] [2025-03-08 22:47:56,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376097243] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:56,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629788787] [2025-03-08 22:47:56,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:56,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:56,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:56,637 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:56,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:47:56,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:47:56,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:47:56,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:56,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:56,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 22:47:56,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:56,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:56,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629788787] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:56,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:56,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-08 22:47:56,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989358084] [2025-03-08 22:47:56,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:56,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:47:56,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:56,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:47:56,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:47:56,779 INFO L87 Difference]: Start difference. First operand 575 states and 893 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:56,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:56,818 INFO L93 Difference]: Finished difference Result 593 states and 885 transitions. [2025-03-08 22:47:56,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:47:56,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-08 22:47:56,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:56,823 INFO L225 Difference]: With dead ends: 593 [2025-03-08 22:47:56,824 INFO L226 Difference]: Without dead ends: 593 [2025-03-08 22:47:56,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:47:56,824 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 163 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:56,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 245 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:56,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-08 22:47:56,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 583. [2025-03-08 22:47:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 567 states have (on average 1.5537918871252205) internal successors, (881), 582 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 881 transitions. [2025-03-08 22:47:56,848 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 881 transitions. Word has length 15 [2025-03-08 22:47:56,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:56,849 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 881 transitions. [2025-03-08 22:47:56,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 881 transitions. [2025-03-08 22:47:56,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 22:47:56,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:56,849 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:56,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:47:57,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:57,055 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:47:57,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:57,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1686085863, now seen corresponding path program 1 times [2025-03-08 22:47:57,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:57,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517321044] [2025-03-08 22:47:57,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:57,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:57,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 22:47:57,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 22:47:57,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:57,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:57,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:57,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517321044] [2025-03-08 22:47:57,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517321044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:57,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:57,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:47:57,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334055403] [2025-03-08 22:47:57,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:57,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:47:57,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:57,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:47:57,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:47:57,099 INFO L87 Difference]: Start difference. First operand 583 states and 881 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:57,134 INFO L93 Difference]: Finished difference Result 913 states and 1405 transitions. [2025-03-08 22:47:57,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:47:57,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 22:47:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:57,137 INFO L225 Difference]: With dead ends: 913 [2025-03-08 22:47:57,137 INFO L226 Difference]: Without dead ends: 913 [2025-03-08 22:47:57,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:47:57,137 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 102 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:57,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 258 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:57,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-03-08 22:47:57,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 875. [2025-03-08 22:47:57,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 859 states have (on average 1.5750873108265424) internal successors, (1353), 874 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1353 transitions. [2025-03-08 22:47:57,149 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1353 transitions. Word has length 16 [2025-03-08 22:47:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:57,150 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1353 transitions. [2025-03-08 22:47:57,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:57,150 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1353 transitions. [2025-03-08 22:47:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 22:47:57,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:57,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:57,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:47:57,151 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:47:57,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:57,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1721377752, now seen corresponding path program 1 times [2025-03-08 22:47:57,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:57,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041406986] [2025-03-08 22:47:57,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:57,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:57,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 22:47:57,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 22:47:57,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:57,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:57,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:57,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:57,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041406986] [2025-03-08 22:47:57,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041406986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:57,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984974326] [2025-03-08 22:47:57,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:57,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:57,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:57,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:57,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:47:57,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 22:47:57,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 22:47:57,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:57,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:57,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 22:47:57,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:57,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:57,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984974326] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:57,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:57,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2025-03-08 22:47:57,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479692753] [2025-03-08 22:47:57,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:57,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:47:57,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:57,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:47:57,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:47:57,317 INFO L87 Difference]: Start difference. First operand 875 states and 1353 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:57,403 INFO L93 Difference]: Finished difference Result 1465 states and 2161 transitions. [2025-03-08 22:47:57,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:47:57,403 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 22:47:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:57,408 INFO L225 Difference]: With dead ends: 1465 [2025-03-08 22:47:57,408 INFO L226 Difference]: Without dead ends: 1465 [2025-03-08 22:47:57,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:47:57,409 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 148 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:57,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 309 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:57,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2025-03-08 22:47:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1355. [2025-03-08 22:47:57,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1339 states have (on average 1.5197908887229277) internal successors, (2035), 1354 states have internal predecessors, (2035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 2035 transitions. [2025-03-08 22:47:57,435 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 2035 transitions. Word has length 16 [2025-03-08 22:47:57,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:57,435 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 2035 transitions. [2025-03-08 22:47:57,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:57,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2035 transitions. [2025-03-08 22:47:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 22:47:57,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:57,437 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:57,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 22:47:57,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 22:47:57,638 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:47:57,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:57,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1766694481, now seen corresponding path program 1 times [2025-03-08 22:47:57,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:57,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085792694] [2025-03-08 22:47:57,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:57,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:57,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 22:47:57,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:47:57,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:57,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:47:57,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:57,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085792694] [2025-03-08 22:47:57,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085792694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:47:57,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:47:57,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:47:57,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170279079] [2025-03-08 22:47:57,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:47:57,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:47:57,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:57,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:47:57,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:47:57,679 INFO L87 Difference]: Start difference. First operand 1355 states and 2035 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:57,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:57,705 INFO L93 Difference]: Finished difference Result 576 states and 835 transitions. [2025-03-08 22:47:57,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:47:57,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 22:47:57,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:57,707 INFO L225 Difference]: With dead ends: 576 [2025-03-08 22:47:57,707 INFO L226 Difference]: Without dead ends: 576 [2025-03-08 22:47:57,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:47:57,707 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 45 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:57,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 170 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:57,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-08 22:47:57,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 560. [2025-03-08 22:47:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 548 states have (on average 1.5054744525547445) internal successors, (825), 559 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 825 transitions. [2025-03-08 22:47:57,728 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 825 transitions. Word has length 21 [2025-03-08 22:47:57,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:57,728 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 825 transitions. [2025-03-08 22:47:57,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:57,728 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 825 transitions. [2025-03-08 22:47:57,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 22:47:57,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:57,729 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:57,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:47:57,730 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:47:57,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:57,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1339768036, now seen corresponding path program 1 times [2025-03-08 22:47:57,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:57,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550827965] [2025-03-08 22:47:57,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:57,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:57,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 22:47:57,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:47:57,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:57,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:57,806 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:57,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:57,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550827965] [2025-03-08 22:47:57,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550827965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:57,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146613893] [2025-03-08 22:47:57,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:57,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:57,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:57,810 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:57,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:47:57,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 22:47:57,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:47:57,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:57,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:57,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 22:47:57,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:57,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:57,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146613893] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:57,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:57,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-08 22:47:57,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828296663] [2025-03-08 22:47:57,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:57,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:47:57,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:57,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:47:57,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:47:57,973 INFO L87 Difference]: Start difference. First operand 560 states and 825 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:58,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:58,029 INFO L93 Difference]: Finished difference Result 1652 states and 2405 transitions. [2025-03-08 22:47:58,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:47:58,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 22:47:58,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:58,034 INFO L225 Difference]: With dead ends: 1652 [2025-03-08 22:47:58,034 INFO L226 Difference]: Without dead ends: 1652 [2025-03-08 22:47:58,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:47:58,035 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 178 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:58,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 156 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:58,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2025-03-08 22:47:58,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1598. [2025-03-08 22:47:58,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1586 states have (on average 1.4899117276166456) internal successors, (2363), 1597 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2363 transitions. [2025-03-08 22:47:58,057 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2363 transitions. Word has length 24 [2025-03-08 22:47:58,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:58,057 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 2363 transitions. [2025-03-08 22:47:58,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:58,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2363 transitions. [2025-03-08 22:47:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:47:58,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:58,058 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:58,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 22:47:58,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:58,258 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:47:58,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:58,259 INFO L85 PathProgramCache]: Analyzing trace with hash 74440060, now seen corresponding path program 1 times [2025-03-08 22:47:58,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:58,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126223530] [2025-03-08 22:47:58,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:58,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:58,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:47:58,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:47:58,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:58,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:58,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:58,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:58,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126223530] [2025-03-08 22:47:58,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126223530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:58,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804300402] [2025-03-08 22:47:58,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:58,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:58,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:58,333 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:58,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:47:58,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:47:58,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:47:58,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:58,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:58,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 22:47:58,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:58,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:58,455 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:58,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804300402] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:58,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:58,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 22:47:58,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340271110] [2025-03-08 22:47:58,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:58,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:47:58,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:58,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:47:58,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:47:58,457 INFO L87 Difference]: Start difference. First operand 1598 states and 2363 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:58,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:58,568 INFO L93 Difference]: Finished difference Result 3998 states and 5663 transitions. [2025-03-08 22:47:58,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:47:58,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 22:47:58,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:58,578 INFO L225 Difference]: With dead ends: 3998 [2025-03-08 22:47:58,579 INFO L226 Difference]: Without dead ends: 3998 [2025-03-08 22:47:58,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:47:58,580 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 263 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:58,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 399 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:47:58,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3998 states. [2025-03-08 22:47:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3998 to 3704. [2025-03-08 22:47:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3704 states, 3692 states have (on average 1.4526002166847238) internal successors, (5363), 3703 states have internal predecessors, (5363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3704 states to 3704 states and 5363 transitions. [2025-03-08 22:47:58,633 INFO L78 Accepts]: Start accepts. Automaton has 3704 states and 5363 transitions. Word has length 26 [2025-03-08 22:47:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:58,634 INFO L471 AbstractCegarLoop]: Abstraction has 3704 states and 5363 transitions. [2025-03-08 22:47:58,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3704 states and 5363 transitions. [2025-03-08 22:47:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 22:47:58,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:58,635 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:58,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 22:47:58,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:58,836 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:47:58,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:58,836 INFO L85 PathProgramCache]: Analyzing trace with hash 401162682, now seen corresponding path program 1 times [2025-03-08 22:47:58,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:58,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444251736] [2025-03-08 22:47:58,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:58,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:58,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:47:58,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:47:58,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:58,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:47:58,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:58,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444251736] [2025-03-08 22:47:58,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444251736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:58,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90730295] [2025-03-08 22:47:58,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:47:58,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:58,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:58,904 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:58,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:47:58,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:47:58,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:47:58,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:47:58,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:58,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 22:47:58,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:58,972 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:47:58,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:58,992 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:47:58,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90730295] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:58,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:58,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2025-03-08 22:47:58,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138494489] [2025-03-08 22:47:58,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:58,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:47:58,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:58,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:47:58,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:47:58,993 INFO L87 Difference]: Start difference. First operand 3704 states and 5363 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:59,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:47:59,055 INFO L93 Difference]: Finished difference Result 1080 states and 1503 transitions. [2025-03-08 22:47:59,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:47:59,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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 27 [2025-03-08 22:47:59,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:47:59,058 INFO L225 Difference]: With dead ends: 1080 [2025-03-08 22:47:59,058 INFO L226 Difference]: Without dead ends: 1080 [2025-03-08 22:47:59,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:47:59,059 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 85 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:47:59,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 351 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:47:59,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2025-03-08 22:47:59,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 876. [2025-03-08 22:47:59,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 864 states have (on average 1.4293981481481481) internal successors, (1235), 875 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1235 transitions. [2025-03-08 22:47:59,080 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1235 transitions. Word has length 27 [2025-03-08 22:47:59,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:47:59,080 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1235 transitions. [2025-03-08 22:47:59,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:47:59,080 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1235 transitions. [2025-03-08 22:47:59,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 22:47:59,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:47:59,081 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:47:59,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 22:47:59,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 22:47:59,282 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:47:59,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:47:59,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1125165923, now seen corresponding path program 2 times [2025-03-08 22:47:59,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:47:59,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930562544] [2025-03-08 22:47:59,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:59,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:47:59,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-08 22:47:59,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:47:59,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:47:59,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:59,459 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 22:47:59,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:47:59,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930562544] [2025-03-08 22:47:59,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930562544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:47:59,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282439129] [2025-03-08 22:47:59,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:47:59,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:47:59,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:47:59,462 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:47:59,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:47:59,511 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-08 22:47:59,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:47:59,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:47:59,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:47:59,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 22:47:59,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:47:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 19 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:59,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:47:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 19 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:47:59,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282439129] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:47:59,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:47:59,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 13 [2025-03-08 22:47:59,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917816429] [2025-03-08 22:47:59,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:47:59,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:47:59,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:47:59,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:47:59,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:47:59,736 INFO L87 Difference]: Start difference. First operand 876 states and 1235 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:00,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:00,374 INFO L93 Difference]: Finished difference Result 1497 states and 2003 transitions. [2025-03-08 22:48:00,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-08 22:48:00,375 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-08 22:48:00,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:00,378 INFO L225 Difference]: With dead ends: 1497 [2025-03-08 22:48:00,378 INFO L226 Difference]: Without dead ends: 1478 [2025-03-08 22:48:00,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 87 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=734, Invalid=3298, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 22:48:00,381 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 881 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:00,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 845 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2025-03-08 22:48:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1333. [2025-03-08 22:48:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1321 states have (on average 1.408781226343679) internal successors, (1861), 1332 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1861 transitions. [2025-03-08 22:48:00,399 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1861 transitions. Word has length 50 [2025-03-08 22:48:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:00,399 INFO L471 AbstractCegarLoop]: Abstraction has 1333 states and 1861 transitions. [2025-03-08 22:48:00,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1861 transitions. [2025-03-08 22:48:00,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:48:00,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:00,401 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:00,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:00,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 22:48:00,606 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:00,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:00,606 INFO L85 PathProgramCache]: Analyzing trace with hash 316141402, now seen corresponding path program 1 times [2025-03-08 22:48:00,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:00,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220744444] [2025-03-08 22:48:00,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:00,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:00,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:48:00,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:48:00,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:00,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 36 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 22:48:00,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:00,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220744444] [2025-03-08 22:48:00,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220744444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:00,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636927588] [2025-03-08 22:48:00,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:00,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:00,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:00,699 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:00,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:48:00,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:48:00,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:48:00,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:00,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:00,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 22:48:00,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:00,817 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 38 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 22:48:00,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 38 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 22:48:00,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636927588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:00,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:00,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 12 [2025-03-08 22:48:00,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545701428] [2025-03-08 22:48:00,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:00,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:48:00,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:00,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:48:00,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:48:00,872 INFO L87 Difference]: Start difference. First operand 1333 states and 1861 transitions. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:02,043 INFO L93 Difference]: Finished difference Result 3547 states and 4827 transitions. [2025-03-08 22:48:02,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-08 22:48:02,044 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 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 51 [2025-03-08 22:48:02,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:02,051 INFO L225 Difference]: With dead ends: 3547 [2025-03-08 22:48:02,051 INFO L226 Difference]: Without dead ends: 3547 [2025-03-08 22:48:02,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=881, Invalid=3675, Unknown=0, NotChecked=0, Total=4556 [2025-03-08 22:48:02,052 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 666 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:02,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 997 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 22:48:02,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3547 states. [2025-03-08 22:48:02,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3547 to 2920. [2025-03-08 22:48:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2909 states have (on average 1.420075627363355) internal successors, (4131), 2919 states have internal predecessors, (4131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4131 transitions. [2025-03-08 22:48:02,092 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4131 transitions. Word has length 51 [2025-03-08 22:48:02,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:02,092 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 4131 transitions. [2025-03-08 22:48:02,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4131 transitions. [2025-03-08 22:48:02,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 22:48:02,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:02,093 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:02,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 22:48:02,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:02,293 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:02,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:02,294 INFO L85 PathProgramCache]: Analyzing trace with hash -362684768, now seen corresponding path program 1 times [2025-03-08 22:48:02,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:02,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478923450] [2025-03-08 22:48:02,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:02,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:02,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 22:48:02,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 22:48:02,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:02,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:02,407 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-08 22:48:02,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:02,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478923450] [2025-03-08 22:48:02,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478923450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:02,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132030264] [2025-03-08 22:48:02,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:02,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:02,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:02,410 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:02,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 22:48:02,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 22:48:02,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 22:48:02,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:02,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:02,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 22:48:02,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:02,524 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 22:48:02,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 22:48:02,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132030264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:02,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:02,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-03-08 22:48:02,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002991631] [2025-03-08 22:48:02,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:02,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:48:02,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:02,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:48:02,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:48:02,568 INFO L87 Difference]: Start difference. First operand 2920 states and 4131 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:02,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:02,715 INFO L93 Difference]: Finished difference Result 3173 states and 4305 transitions. [2025-03-08 22:48:02,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 22:48:02,717 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-08 22:48:02,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:02,723 INFO L225 Difference]: With dead ends: 3173 [2025-03-08 22:48:02,724 INFO L226 Difference]: Without dead ends: 3173 [2025-03-08 22:48:02,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2025-03-08 22:48:02,724 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 344 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:02,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 679 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3173 states. [2025-03-08 22:48:02,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3173 to 2371. [2025-03-08 22:48:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 2360 states have (on average 1.3872881355932203) internal successors, (3274), 2370 states have internal predecessors, (3274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 3274 transitions. [2025-03-08 22:48:02,754 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 3274 transitions. Word has length 58 [2025-03-08 22:48:02,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:02,755 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 3274 transitions. [2025-03-08 22:48:02,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:02,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 3274 transitions. [2025-03-08 22:48:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 22:48:02,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:02,755 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:02,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:02,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 22:48:02,956 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:02,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:02,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1269603243, now seen corresponding path program 1 times [2025-03-08 22:48:02,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:02,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031913992] [2025-03-08 22:48:02,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:02,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:02,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 22:48:02,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 22:48:02,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:02,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-08 22:48:03,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:03,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031913992] [2025-03-08 22:48:03,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031913992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:03,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170087145] [2025-03-08 22:48:03,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:03,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:03,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:03,076 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:03,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 22:48:03,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 22:48:03,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 22:48:03,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:03,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:03,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:48:03,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:03,203 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 22:48:03,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 22:48:03,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170087145] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:03,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:48:03,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13 [2025-03-08 22:48:03,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481560194] [2025-03-08 22:48:03,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:03,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:48:03,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:03,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:48:03,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:48:03,241 INFO L87 Difference]: Start difference. First operand 2371 states and 3274 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:03,306 INFO L93 Difference]: Finished difference Result 3719 states and 5083 transitions. [2025-03-08 22:48:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:48:03,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-08 22:48:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:03,315 INFO L225 Difference]: With dead ends: 3719 [2025-03-08 22:48:03,316 INFO L226 Difference]: Without dead ends: 3719 [2025-03-08 22:48:03,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:48:03,316 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 59 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:03,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 333 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:03,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2025-03-08 22:48:03,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3582. [2025-03-08 22:48:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3582 states, 3571 states have (on average 1.3864463735648278) internal successors, (4951), 3581 states have internal predecessors, (4951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 4951 transitions. [2025-03-08 22:48:03,358 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 4951 transitions. Word has length 58 [2025-03-08 22:48:03,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:03,359 INFO L471 AbstractCegarLoop]: Abstraction has 3582 states and 4951 transitions. [2025-03-08 22:48:03,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:03,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 4951 transitions. [2025-03-08 22:48:03,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 22:48:03,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:03,360 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:03,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:03,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 22:48:03,564 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:03,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:03,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1374393815, now seen corresponding path program 1 times [2025-03-08 22:48:03,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:03,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714427165] [2025-03-08 22:48:03,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:03,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:03,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 22:48:03,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 22:48:03,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:03,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-08 22:48:03,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:03,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714427165] [2025-03-08 22:48:03,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714427165] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:03,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691086534] [2025-03-08 22:48:03,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:03,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:03,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:03,693 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:03,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 22:48:03,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 22:48:03,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 22:48:03,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:03,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:03,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 22:48:03,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:03,830 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 101 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:48:03,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 103 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:48:03,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691086534] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:03,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:03,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2025-03-08 22:48:03,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214596877] [2025-03-08 22:48:03,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:03,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:48:03,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:03,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:48:03,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:48:03,883 INFO L87 Difference]: Start difference. First operand 3582 states and 4951 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:04,212 INFO L93 Difference]: Finished difference Result 7502 states and 10313 transitions. [2025-03-08 22:48:04,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 22:48:04,215 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-08 22:48:04,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:04,240 INFO L225 Difference]: With dead ends: 7502 [2025-03-08 22:48:04,242 INFO L226 Difference]: Without dead ends: 7502 [2025-03-08 22:48:04,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=405, Invalid=1317, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 22:48:04,243 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 390 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:04,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 765 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:04,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7502 states. [2025-03-08 22:48:04,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7502 to 4143. [2025-03-08 22:48:04,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 4132 states have (on average 1.382623426911907) internal successors, (5713), 4142 states have internal predecessors, (5713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5713 transitions. [2025-03-08 22:48:04,288 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5713 transitions. Word has length 62 [2025-03-08 22:48:04,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:04,289 INFO L471 AbstractCegarLoop]: Abstraction has 4143 states and 5713 transitions. [2025-03-08 22:48:04,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5713 transitions. [2025-03-08 22:48:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 22:48:04,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:04,290 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:04,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:04,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:04,491 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:04,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:04,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2065252914, now seen corresponding path program 1 times [2025-03-08 22:48:04,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:04,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474866706] [2025-03-08 22:48:04,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:04,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 22:48:04,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 22:48:04,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:04,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 22:48:04,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:04,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474866706] [2025-03-08 22:48:04,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474866706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:04,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860118259] [2025-03-08 22:48:04,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:04,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:04,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:04,567 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:04,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 22:48:04,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 22:48:04,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 22:48:04,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:04,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:04,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 22:48:04,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:04,691 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 22:48:04,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 47 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 22:48:04,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860118259] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:04,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:04,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-08 22:48:04,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029497643] [2025-03-08 22:48:04,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:04,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:48:04,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:04,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:48:04,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:04,736 INFO L87 Difference]: Start difference. First operand 4143 states and 5713 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:04,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:04,800 INFO L93 Difference]: Finished difference Result 4150 states and 5711 transitions. [2025-03-08 22:48:04,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:48:04,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-08 22:48:04,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:04,809 INFO L225 Difference]: With dead ends: 4150 [2025-03-08 22:48:04,810 INFO L226 Difference]: Without dead ends: 4150 [2025-03-08 22:48:04,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:48:04,810 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 109 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:04,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 253 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4150 states. [2025-03-08 22:48:04,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4150 to 4141. [2025-03-08 22:48:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4141 states, 4130 states have (on average 1.3818401937046005) internal successors, (5707), 4140 states have internal predecessors, (5707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 5707 transitions. [2025-03-08 22:48:04,854 INFO L78 Accepts]: Start accepts. Automaton has 4141 states and 5707 transitions. Word has length 63 [2025-03-08 22:48:04,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:04,854 INFO L471 AbstractCegarLoop]: Abstraction has 4141 states and 5707 transitions. [2025-03-08 22:48:04,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:04,855 INFO L276 IsEmpty]: Start isEmpty. Operand 4141 states and 5707 transitions. [2025-03-08 22:48:04,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 22:48:04,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:04,855 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:04,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:05,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:05,056 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:05,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:05,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1321596033, now seen corresponding path program 1 times [2025-03-08 22:48:05,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:05,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214035728] [2025-03-08 22:48:05,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:05,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:05,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 22:48:05,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:48:05,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:05,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 89 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 22:48:05,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:05,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214035728] [2025-03-08 22:48:05,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214035728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:05,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828254128] [2025-03-08 22:48:05,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:05,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:05,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:05,162 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:05,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 22:48:05,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 22:48:05,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:48:05,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:05,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:05,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 22:48:05,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 95 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 22:48:05,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:05,354 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 97 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 22:48:05,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828254128] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:05,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:05,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2025-03-08 22:48:05,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251517913] [2025-03-08 22:48:05,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:05,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:48:05,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:05,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:48:05,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:48:05,355 INFO L87 Difference]: Start difference. First operand 4141 states and 5707 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:05,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:05,485 INFO L93 Difference]: Finished difference Result 4429 states and 6032 transitions. [2025-03-08 22:48:05,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:48:05,486 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-08 22:48:05,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:05,491 INFO L225 Difference]: With dead ends: 4429 [2025-03-08 22:48:05,491 INFO L226 Difference]: Without dead ends: 4429 [2025-03-08 22:48:05,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:48:05,491 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 173 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:05,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 655 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:05,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4429 states. [2025-03-08 22:48:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4429 to 3666. [2025-03-08 22:48:05,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3655 states have (on average 1.3822161422708619) internal successors, (5052), 3665 states have internal predecessors, (5052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:05,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 5052 transitions. [2025-03-08 22:48:05,517 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 5052 transitions. Word has length 64 [2025-03-08 22:48:05,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:05,517 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 5052 transitions. [2025-03-08 22:48:05,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:05,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 5052 transitions. [2025-03-08 22:48:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 22:48:05,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:05,518 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:05,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 22:48:05,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-08 22:48:05,719 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:05,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:05,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2063606598, now seen corresponding path program 1 times [2025-03-08 22:48:05,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:05,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364375671] [2025-03-08 22:48:05,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:05,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:05,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 22:48:05,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 22:48:05,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:05,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-08 22:48:05,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:05,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364375671] [2025-03-08 22:48:05,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364375671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:05,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243487637] [2025-03-08 22:48:05,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:05,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:05,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:05,868 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:05,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 22:48:05,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 22:48:05,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 22:48:05,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:05,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:05,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 22:48:05,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:05,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:48:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-08 22:48:06,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 62 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-08 22:48:06,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243487637] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:06,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:06,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2025-03-08 22:48:06,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331195617] [2025-03-08 22:48:06,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:06,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:48:06,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:06,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:48:06,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:48:06,335 INFO L87 Difference]: Start difference. First operand 3666 states and 5052 transitions. Second operand has 13 states, 12 states have (on average 9.5) internal successors, (114), 13 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:06,600 INFO L93 Difference]: Finished difference Result 7048 states and 9495 transitions. [2025-03-08 22:48:06,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:48:06,601 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.5) internal successors, (114), 13 states have internal predecessors, (114), 0 states have call successors, (0), 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 69 [2025-03-08 22:48:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:06,609 INFO L225 Difference]: With dead ends: 7048 [2025-03-08 22:48:06,610 INFO L226 Difference]: Without dead ends: 7048 [2025-03-08 22:48:06,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:48:06,611 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 693 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:06,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 573 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:06,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7048 states. [2025-03-08 22:48:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7048 to 5332. [2025-03-08 22:48:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5332 states, 5321 states have (on average 1.3948505919939862) internal successors, (7422), 5331 states have internal predecessors, (7422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5332 states to 5332 states and 7422 transitions. [2025-03-08 22:48:06,657 INFO L78 Accepts]: Start accepts. Automaton has 5332 states and 7422 transitions. Word has length 69 [2025-03-08 22:48:06,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:06,658 INFO L471 AbstractCegarLoop]: Abstraction has 5332 states and 7422 transitions. [2025-03-08 22:48:06,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.5) internal successors, (114), 13 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 5332 states and 7422 transitions. [2025-03-08 22:48:06,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 22:48:06,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:06,659 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:06,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:06,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 22:48:06,864 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:06,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:06,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1053607504, now seen corresponding path program 1 times [2025-03-08 22:48:06,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:06,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996637728] [2025-03-08 22:48:06,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:06,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:06,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 22:48:06,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 22:48:06,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:06,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 82 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-08 22:48:06,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:06,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996637728] [2025-03-08 22:48:06,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996637728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:06,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481400594] [2025-03-08 22:48:06,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:06,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:06,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:06,961 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:06,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 22:48:07,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 22:48:07,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 22:48:07,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:07,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:07,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 22:48:07,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:07,102 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 83 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 22:48:07,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 83 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 22:48:07,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481400594] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:07,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:07,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 22:48:07,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98638792] [2025-03-08 22:48:07,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:07,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:48:07,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:07,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:48:07,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:48:07,144 INFO L87 Difference]: Start difference. First operand 5332 states and 7422 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:07,293 INFO L93 Difference]: Finished difference Result 2939 states and 3953 transitions. [2025-03-08 22:48:07,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 22:48:07,294 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-08 22:48:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:07,297 INFO L225 Difference]: With dead ends: 2939 [2025-03-08 22:48:07,297 INFO L226 Difference]: Without dead ends: 2939 [2025-03-08 22:48:07,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:48:07,297 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 182 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:07,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1367 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2025-03-08 22:48:07,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2832. [2025-03-08 22:48:07,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2832 states, 2821 states have (on average 1.3683091102445941) internal successors, (3860), 2831 states have internal predecessors, (3860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2832 states and 3860 transitions. [2025-03-08 22:48:07,317 INFO L78 Accepts]: Start accepts. Automaton has 2832 states and 3860 transitions. Word has length 70 [2025-03-08 22:48:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:07,317 INFO L471 AbstractCegarLoop]: Abstraction has 2832 states and 3860 transitions. [2025-03-08 22:48:07,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 3860 transitions. [2025-03-08 22:48:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 22:48:07,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:07,318 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 6, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:07,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 22:48:07,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:07,519 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:07,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:07,519 INFO L85 PathProgramCache]: Analyzing trace with hash -233213314, now seen corresponding path program 1 times [2025-03-08 22:48:07,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:07,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871948996] [2025-03-08 22:48:07,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:07,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:07,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 22:48:07,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 22:48:07,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:07,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 148 proven. 2 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-08 22:48:07,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:07,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871948996] [2025-03-08 22:48:07,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871948996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:07,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250418571] [2025-03-08 22:48:07,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:07,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:07,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:07,619 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:07,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 22:48:07,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 22:48:07,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 22:48:07,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:07,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:07,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 22:48:07,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 117 proven. 57 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-08 22:48:07,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 117 proven. 57 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-08 22:48:07,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250418571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:07,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:07,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-03-08 22:48:07,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289223467] [2025-03-08 22:48:07,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:07,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:48:07,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:07,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:48:07,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:48:07,851 INFO L87 Difference]: Start difference. First operand 2832 states and 3860 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:08,006 INFO L93 Difference]: Finished difference Result 5830 states and 7607 transitions. [2025-03-08 22:48:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 22:48:08,007 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 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 93 [2025-03-08 22:48:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:08,014 INFO L225 Difference]: With dead ends: 5830 [2025-03-08 22:48:08,014 INFO L226 Difference]: Without dead ends: 5830 [2025-03-08 22:48:08,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2025-03-08 22:48:08,015 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 170 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:08,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 866 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:08,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5830 states. [2025-03-08 22:48:08,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5830 to 5206. [2025-03-08 22:48:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5206 states, 5195 states have (on average 1.3049085659287776) internal successors, (6779), 5205 states have internal predecessors, (6779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5206 states to 5206 states and 6779 transitions. [2025-03-08 22:48:08,058 INFO L78 Accepts]: Start accepts. Automaton has 5206 states and 6779 transitions. Word has length 93 [2025-03-08 22:48:08,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:08,058 INFO L471 AbstractCegarLoop]: Abstraction has 5206 states and 6779 transitions. [2025-03-08 22:48:08,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:08,059 INFO L276 IsEmpty]: Start isEmpty. Operand 5206 states and 6779 transitions. [2025-03-08 22:48:08,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 22:48:08,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:08,060 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 7, 6, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:08,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:08,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:08,261 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:08,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:08,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1809122437, now seen corresponding path program 1 times [2025-03-08 22:48:08,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:08,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460115770] [2025-03-08 22:48:08,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:08,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:08,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 22:48:08,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 22:48:08,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:08,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 156 proven. 1 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-03-08 22:48:08,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:08,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460115770] [2025-03-08 22:48:08,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460115770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:08,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863889373] [2025-03-08 22:48:08,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:08,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:08,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:08,366 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:08,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 22:48:08,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 22:48:08,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 22:48:08,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:08,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:08,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 22:48:08,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:08,588 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 244 proven. 4 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-08 22:48:08,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:08,701 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 244 proven. 4 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-08 22:48:08,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863889373] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:08,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:08,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2025-03-08 22:48:08,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038618998] [2025-03-08 22:48:08,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:08,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:48:08,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:08,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:48:08,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:48:08,703 INFO L87 Difference]: Start difference. First operand 5206 states and 6779 transitions. Second operand has 13 states, 13 states have (on average 11.923076923076923) internal successors, (155), 13 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:08,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:08,803 INFO L93 Difference]: Finished difference Result 4608 states and 5711 transitions. [2025-03-08 22:48:08,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:48:08,803 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.923076923076923) internal successors, (155), 13 states have internal predecessors, (155), 0 states have call successors, (0), 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 103 [2025-03-08 22:48:08,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:08,808 INFO L225 Difference]: With dead ends: 4608 [2025-03-08 22:48:08,809 INFO L226 Difference]: Without dead ends: 4608 [2025-03-08 22:48:08,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:48:08,809 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 226 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:08,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 691 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:08,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2025-03-08 22:48:08,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 3947. [2025-03-08 22:48:08,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3947 states, 3937 states have (on average 1.2621285242570486) internal successors, (4969), 3946 states have internal predecessors, (4969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3947 states to 3947 states and 4969 transitions. [2025-03-08 22:48:08,847 INFO L78 Accepts]: Start accepts. Automaton has 3947 states and 4969 transitions. Word has length 103 [2025-03-08 22:48:08,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:08,847 INFO L471 AbstractCegarLoop]: Abstraction has 3947 states and 4969 transitions. [2025-03-08 22:48:08,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.923076923076923) internal successors, (155), 13 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:08,847 INFO L276 IsEmpty]: Start isEmpty. Operand 3947 states and 4969 transitions. [2025-03-08 22:48:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 22:48:08,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:08,850 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:08,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:09,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-08 22:48:09,051 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:09,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:09,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1400169243, now seen corresponding path program 1 times [2025-03-08 22:48:09,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:09,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403463320] [2025-03-08 22:48:09,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:09,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:09,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 22:48:09,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 22:48:09,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:09,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 134 proven. 104 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-08 22:48:09,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:09,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403463320] [2025-03-08 22:48:09,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403463320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:09,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438969946] [2025-03-08 22:48:09,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:09,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:09,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:09,124 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:09,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 22:48:09,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 22:48:09,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 22:48:09,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:09,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:09,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 22:48:09,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:09,287 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-08 22:48:09,287 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:09,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438969946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:09,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:48:09,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 22:48:09,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995425872] [2025-03-08 22:48:09,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:09,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:48:09,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:09,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:48:09,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:09,288 INFO L87 Difference]: Start difference. First operand 3947 states and 4969 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:09,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:09,306 INFO L93 Difference]: Finished difference Result 4239 states and 5233 transitions. [2025-03-08 22:48:09,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:48:09,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 105 [2025-03-08 22:48:09,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:09,327 INFO L225 Difference]: With dead ends: 4239 [2025-03-08 22:48:09,327 INFO L226 Difference]: Without dead ends: 4239 [2025-03-08 22:48:09,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:09,328 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 49 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:09,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 132 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:09,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4239 states. [2025-03-08 22:48:09,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4239 to 3947. [2025-03-08 22:48:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3947 states, 3937 states have (on average 1.2448564897129795) internal successors, (4901), 3946 states have internal predecessors, (4901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:09,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3947 states to 3947 states and 4901 transitions. [2025-03-08 22:48:09,354 INFO L78 Accepts]: Start accepts. Automaton has 3947 states and 4901 transitions. Word has length 105 [2025-03-08 22:48:09,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:09,354 INFO L471 AbstractCegarLoop]: Abstraction has 3947 states and 4901 transitions. [2025-03-08 22:48:09,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:09,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3947 states and 4901 transitions. [2025-03-08 22:48:09,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 22:48:09,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:09,355 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:09,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 22:48:09,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 22:48:09,560 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:09,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:09,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1815608501, now seen corresponding path program 1 times [2025-03-08 22:48:09,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:09,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689481476] [2025-03-08 22:48:09,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:09,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:09,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 22:48:09,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 22:48:09,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:09,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 147 proven. 3 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-08 22:48:09,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:09,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689481476] [2025-03-08 22:48:09,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689481476] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:09,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410434281] [2025-03-08 22:48:09,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:09,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:09,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:09,659 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:09,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 22:48:09,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 22:48:09,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 22:48:09,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:09,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:09,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 22:48:09,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 231 proven. 10 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-08 22:48:09,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:09,965 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 231 proven. 10 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-08 22:48:09,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410434281] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:09,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:09,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2025-03-08 22:48:09,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456724902] [2025-03-08 22:48:09,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:09,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:48:09,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:09,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:48:09,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:48:09,967 INFO L87 Difference]: Start difference. First operand 3947 states and 4901 transitions. Second operand has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:10,077 INFO L93 Difference]: Finished difference Result 3108 states and 3654 transitions. [2025-03-08 22:48:10,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:48:10,077 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 0 states have call successors, (0), 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 107 [2025-03-08 22:48:10,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:10,080 INFO L225 Difference]: With dead ends: 3108 [2025-03-08 22:48:10,080 INFO L226 Difference]: Without dead ends: 3108 [2025-03-08 22:48:10,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 207 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:48:10,081 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 191 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:10,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 692 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2025-03-08 22:48:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 2422. [2025-03-08 22:48:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2422 states, 2412 states have (on average 1.187396351575456) internal successors, (2864), 2421 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 2864 transitions. [2025-03-08 22:48:10,120 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 2864 transitions. Word has length 107 [2025-03-08 22:48:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:10,120 INFO L471 AbstractCegarLoop]: Abstraction has 2422 states and 2864 transitions. [2025-03-08 22:48:10,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 2864 transitions. [2025-03-08 22:48:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 22:48:10,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:10,121 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:10,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:10,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 22:48:10,326 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:10,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:10,326 INFO L85 PathProgramCache]: Analyzing trace with hash -991710924, now seen corresponding path program 1 times [2025-03-08 22:48:10,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:10,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171448825] [2025-03-08 22:48:10,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:10,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:10,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 22:48:10,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 22:48:10,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:10,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 190 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 22:48:10,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:10,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171448825] [2025-03-08 22:48:10,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171448825] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:10,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383852547] [2025-03-08 22:48:10,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:10,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:10,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:10,411 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:10,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 22:48:10,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 22:48:10,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 22:48:10,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:10,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:10,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:48:10,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 166 proven. 24 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-08 22:48:10,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 166 proven. 24 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-08 22:48:10,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383852547] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:10,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:10,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2025-03-08 22:48:10,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633485121] [2025-03-08 22:48:10,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:10,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:48:10,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:10,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:48:10,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:48:10,800 INFO L87 Difference]: Start difference. First operand 2422 states and 2864 transitions. Second operand has 11 states, 11 states have (on average 13.0) internal successors, (143), 11 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:11,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:11,338 INFO L93 Difference]: Finished difference Result 6279 states and 7339 transitions. [2025-03-08 22:48:11,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-08 22:48:11,338 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.0) internal successors, (143), 11 states have internal predecessors, (143), 0 states have call successors, (0), 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 111 [2025-03-08 22:48:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:11,343 INFO L225 Difference]: With dead ends: 6279 [2025-03-08 22:48:11,343 INFO L226 Difference]: Without dead ends: 6279 [2025-03-08 22:48:11,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=469, Invalid=1253, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 22:48:11,344 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 996 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:11,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 860 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:11,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6279 states. [2025-03-08 22:48:11,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6279 to 2423. [2025-03-08 22:48:11,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2423 states, 2413 states have (on average 1.1848321591380024) internal successors, (2859), 2422 states have internal predecessors, (2859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:11,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 2859 transitions. [2025-03-08 22:48:11,364 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 2859 transitions. Word has length 111 [2025-03-08 22:48:11,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:11,364 INFO L471 AbstractCegarLoop]: Abstraction has 2423 states and 2859 transitions. [2025-03-08 22:48:11,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.0) internal successors, (143), 11 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 2859 transitions. [2025-03-08 22:48:11,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 22:48:11,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:11,366 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:11,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:11,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:11,571 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:11,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:11,571 INFO L85 PathProgramCache]: Analyzing trace with hash -991710572, now seen corresponding path program 1 times [2025-03-08 22:48:11,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:11,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251465928] [2025-03-08 22:48:11,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:11,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:11,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 22:48:11,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 22:48:11,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:11,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 158 proven. 16 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-08 22:48:11,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:11,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251465928] [2025-03-08 22:48:11,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251465928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:11,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209851165] [2025-03-08 22:48:11,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:11,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:11,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:11,637 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:11,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 22:48:11,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 22:48:11,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 22:48:11,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:11,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:11,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 22:48:11,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:11,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:48:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 190 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 22:48:11,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 190 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 22:48:11,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209851165] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:11,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:11,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 5 [2025-03-08 22:48:11,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502123403] [2025-03-08 22:48:11,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:11,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:48:11,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:11,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:48:11,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:11,967 INFO L87 Difference]: Start difference. First operand 2423 states and 2859 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:12,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:12,158 INFO L93 Difference]: Finished difference Result 3346 states and 3904 transitions. [2025-03-08 22:48:12,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:48:12,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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 111 [2025-03-08 22:48:12,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:12,162 INFO L225 Difference]: With dead ends: 3346 [2025-03-08 22:48:12,163 INFO L226 Difference]: Without dead ends: 3346 [2025-03-08 22:48:12,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:48:12,163 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 284 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:12,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 412 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:12,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2025-03-08 22:48:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2423. [2025-03-08 22:48:12,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2423 states, 2414 states have (on average 1.1847555923777962) internal successors, (2860), 2422 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 2860 transitions. [2025-03-08 22:48:12,190 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 2860 transitions. Word has length 111 [2025-03-08 22:48:12,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:12,190 INFO L471 AbstractCegarLoop]: Abstraction has 2423 states and 2860 transitions. [2025-03-08 22:48:12,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 2860 transitions. [2025-03-08 22:48:12,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 22:48:12,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:12,193 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:12,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-08 22:48:12,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 22:48:12,394 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:12,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:12,394 INFO L85 PathProgramCache]: Analyzing trace with hash -991710571, now seen corresponding path program 1 times [2025-03-08 22:48:12,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:12,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877837233] [2025-03-08 22:48:12,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:12,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:12,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 22:48:12,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 22:48:12,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:12,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 190 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 22:48:12,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:12,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877837233] [2025-03-08 22:48:12,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877837233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:12,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962454787] [2025-03-08 22:48:12,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:12,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:12,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:12,568 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:12,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 22:48:12,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 22:48:12,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 22:48:12,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:12,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:12,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 22:48:12,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:12,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:48:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 190 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 22:48:12,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 190 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 22:48:13,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962454787] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:13,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:13,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-03-08 22:48:13,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325945837] [2025-03-08 22:48:13,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:13,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 22:48:13,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:13,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 22:48:13,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:48:13,211 INFO L87 Difference]: Start difference. First operand 2423 states and 2860 transitions. Second operand has 16 states, 15 states have (on average 12.8) internal successors, (192), 16 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:13,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:13,751 INFO L93 Difference]: Finished difference Result 6893 states and 8090 transitions. [2025-03-08 22:48:13,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 22:48:13,751 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 12.8) internal successors, (192), 16 states have internal predecessors, (192), 0 states have call successors, (0), 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 111 [2025-03-08 22:48:13,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:13,758 INFO L225 Difference]: With dead ends: 6893 [2025-03-08 22:48:13,758 INFO L226 Difference]: Without dead ends: 6893 [2025-03-08 22:48:13,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=350, Invalid=910, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 22:48:13,759 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1077 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:13,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 1144 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:48:13,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6893 states. [2025-03-08 22:48:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6893 to 2538. [2025-03-08 22:48:13,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 2529 states have (on average 1.188612099644128) internal successors, (3006), 2537 states have internal predecessors, (3006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:13,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3006 transitions. [2025-03-08 22:48:13,801 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3006 transitions. Word has length 111 [2025-03-08 22:48:13,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:13,802 INFO L471 AbstractCegarLoop]: Abstraction has 2538 states and 3006 transitions. [2025-03-08 22:48:13,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 12.8) internal successors, (192), 16 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:13,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3006 transitions. [2025-03-08 22:48:13,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 22:48:13,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:13,803 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:13,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:14,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:14,007 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:14,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:14,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1030358806, now seen corresponding path program 1 times [2025-03-08 22:48:14,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:14,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867284767] [2025-03-08 22:48:14,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:14,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:14,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 22:48:14,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 22:48:14,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:14,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 190 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 22:48:14,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:14,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867284767] [2025-03-08 22:48:14,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867284767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:14,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277057884] [2025-03-08 22:48:14,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:14,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:14,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:14,155 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:14,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-08 22:48:14,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 22:48:14,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 22:48:14,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:14,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:14,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 22:48:14,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 190 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 22:48:14,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 48 proven. 190 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 22:48:14,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277057884] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:14,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:14,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-08 22:48:14,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016766960] [2025-03-08 22:48:14,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:14,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:48:14,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:14,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:48:14,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:14,494 INFO L87 Difference]: Start difference. First operand 2538 states and 3006 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:14,663 INFO L93 Difference]: Finished difference Result 4957 states and 5840 transitions. [2025-03-08 22:48:14,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:48:14,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 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 114 [2025-03-08 22:48:14,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:14,667 INFO L225 Difference]: With dead ends: 4957 [2025-03-08 22:48:14,667 INFO L226 Difference]: Without dead ends: 4957 [2025-03-08 22:48:14,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 230 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:48:14,667 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 507 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:14,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 276 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:14,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4957 states. [2025-03-08 22:48:14,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4957 to 2539. [2025-03-08 22:48:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2539 states, 2530 states have (on average 1.1885375494071146) internal successors, (3007), 2538 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 3007 transitions. [2025-03-08 22:48:14,688 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 3007 transitions. Word has length 114 [2025-03-08 22:48:14,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:14,688 INFO L471 AbstractCegarLoop]: Abstraction has 2539 states and 3007 transitions. [2025-03-08 22:48:14,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 3007 transitions. [2025-03-08 22:48:14,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 22:48:14,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:14,690 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 8, 7, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:14,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:14,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:14,890 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:14,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:14,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1979067295, now seen corresponding path program 1 times [2025-03-08 22:48:14,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:14,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050676476] [2025-03-08 22:48:14,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:14,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:14,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 22:48:14,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 22:48:14,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:14,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 84 proven. 313 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 22:48:15,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:15,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050676476] [2025-03-08 22:48:15,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050676476] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:15,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932822940] [2025-03-08 22:48:15,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:15,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:15,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:15,301 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:15,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-08 22:48:15,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 22:48:15,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 22:48:15,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:15,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:15,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 22:48:15,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:15,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:48:15,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:48:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 70 proven. 291 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 22:48:15,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 70 proven. 291 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 22:48:15,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932822940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:15,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:15,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 17 [2025-03-08 22:48:15,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432954225] [2025-03-08 22:48:15,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:15,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 22:48:15,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:15,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 22:48:15,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:48:15,950 INFO L87 Difference]: Start difference. First operand 2539 states and 3007 transitions. Second operand has 18 states, 18 states have (on average 9.444444444444445) internal successors, (170), 17 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:17,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:17,979 INFO L93 Difference]: Finished difference Result 14525 states and 16799 transitions. [2025-03-08 22:48:17,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-03-08 22:48:17,979 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 9.444444444444445) internal successors, (170), 17 states have internal predecessors, (170), 0 states have call successors, (0), 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 117 [2025-03-08 22:48:17,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:17,988 INFO L225 Difference]: With dead ends: 14525 [2025-03-08 22:48:17,988 INFO L226 Difference]: Without dead ends: 14525 [2025-03-08 22:48:17,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4027 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1558, Invalid=9572, Unknown=0, NotChecked=0, Total=11130 [2025-03-08 22:48:17,992 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 2506 mSDsluCounter, 2725 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2506 SdHoareTripleChecker+Valid, 2885 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:17,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2506 Valid, 2885 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:48:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14525 states. [2025-03-08 22:48:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14525 to 3805. [2025-03-08 22:48:18,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3805 states, 3796 states have (on average 1.1859852476290833) internal successors, (4502), 3804 states have internal predecessors, (4502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3805 states to 3805 states and 4502 transitions. [2025-03-08 22:48:18,049 INFO L78 Accepts]: Start accepts. Automaton has 3805 states and 4502 transitions. Word has length 117 [2025-03-08 22:48:18,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:18,049 INFO L471 AbstractCegarLoop]: Abstraction has 3805 states and 4502 transitions. [2025-03-08 22:48:18,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.444444444444445) internal successors, (170), 17 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:18,049 INFO L276 IsEmpty]: Start isEmpty. Operand 3805 states and 4502 transitions. [2025-03-08 22:48:18,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 22:48:18,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:18,051 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:18,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:18,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:18,252 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:18,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:18,252 INFO L85 PathProgramCache]: Analyzing trace with hash -712100819, now seen corresponding path program 1 times [2025-03-08 22:48:18,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:18,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030936396] [2025-03-08 22:48:18,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:18,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:18,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 22:48:18,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 22:48:18,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:18,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 239 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 22:48:18,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:18,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030936396] [2025-03-08 22:48:18,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030936396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:18,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412272111] [2025-03-08 22:48:18,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:18,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:18,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:18,415 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:18,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-08 22:48:18,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 22:48:18,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 22:48:18,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:18,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:18,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 22:48:18,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:18,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:48:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 239 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 22:48:18,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:18,784 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_~x1~0.base_34 Int)) (or (= (store |c_#valid| v_~x1~0.base_34 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (select |c_#valid| v_~x1~0.base_34) 0)))) is different from false [2025-03-08 22:48:18,798 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 95 trivial. 48 not checked. [2025-03-08 22:48:18,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412272111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:18,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:18,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 8 [2025-03-08 22:48:18,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947834570] [2025-03-08 22:48:18,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:18,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:48:18,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:18,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:48:18,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2025-03-08 22:48:18,799 INFO L87 Difference]: Start difference. First operand 3805 states and 4502 transitions. Second operand has 9 states, 8 states have (on average 10.375) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:19,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:19,097 INFO L93 Difference]: Finished difference Result 9178 states and 10799 transitions. [2025-03-08 22:48:19,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:48:19,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2025-03-08 22:48:19,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:19,103 INFO L225 Difference]: With dead ends: 9178 [2025-03-08 22:48:19,104 INFO L226 Difference]: Without dead ends: 9176 [2025-03-08 22:48:19,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 231 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=201, Unknown=1, NotChecked=30, Total=306 [2025-03-08 22:48:19,104 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 372 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 409 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:19,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 780 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 329 Invalid, 0 Unknown, 409 Unchecked, 0.2s Time] [2025-03-08 22:48:19,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9176 states. [2025-03-08 22:48:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9176 to 6498. [2025-03-08 22:48:19,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6498 states, 6489 states have (on average 1.1840036985668054) internal successors, (7683), 6497 states have internal predecessors, (7683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:19,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6498 states to 6498 states and 7683 transitions. [2025-03-08 22:48:19,165 INFO L78 Accepts]: Start accepts. Automaton has 6498 states and 7683 transitions. Word has length 117 [2025-03-08 22:48:19,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:19,165 INFO L471 AbstractCegarLoop]: Abstraction has 6498 states and 7683 transitions. [2025-03-08 22:48:19,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:19,166 INFO L276 IsEmpty]: Start isEmpty. Operand 6498 states and 7683 transitions. [2025-03-08 22:48:19,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 22:48:19,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:19,167 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:19,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:19,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:19,368 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:19,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash -712100467, now seen corresponding path program 1 times [2025-03-08 22:48:19,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:19,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124130086] [2025-03-08 22:48:19,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:19,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:19,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 22:48:19,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 22:48:19,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:19,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 41 proven. 199 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-08 22:48:19,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:19,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124130086] [2025-03-08 22:48:19,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124130086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:19,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888227146] [2025-03-08 22:48:19,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:19,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:19,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:19,807 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:19,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-08 22:48:19,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 22:48:19,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 22:48:19,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:19,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:19,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 22:48:19,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:20,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:48:20,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:48:20,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:48:20,226 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 19 treesize of output 15 [2025-03-08 22:48:20,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:48:20,235 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 19 treesize of output 15 [2025-03-08 22:48:20,281 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 1 proven. 95 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-08 22:48:20,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:20,430 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 12 treesize of output 10 [2025-03-08 22:48:20,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-08 22:48:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 1 proven. 95 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-08 22:48:20,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888227146] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:20,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:20,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2025-03-08 22:48:20,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066857713] [2025-03-08 22:48:20,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:20,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 22:48:20,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:20,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 22:48:20,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:48:20,602 INFO L87 Difference]: Start difference. First operand 6498 states and 7683 transitions. Second operand has 21 states, 21 states have (on average 7.095238095238095) internal successors, (149), 20 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:20,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:20,990 INFO L93 Difference]: Finished difference Result 13110 states and 15381 transitions. [2025-03-08 22:48:20,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:48:20,991 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.095238095238095) internal successors, (149), 20 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2025-03-08 22:48:20,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:21,006 INFO L225 Difference]: With dead ends: 13110 [2025-03-08 22:48:21,007 INFO L226 Difference]: Without dead ends: 13096 [2025-03-08 22:48:21,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2025-03-08 22:48:21,007 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 287 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:21,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1000 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:21,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13096 states. [2025-03-08 22:48:21,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13096 to 8418. [2025-03-08 22:48:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8418 states, 8409 states have (on average 1.1883696039957188) internal successors, (9993), 8417 states have internal predecessors, (9993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8418 states to 8418 states and 9993 transitions. [2025-03-08 22:48:21,077 INFO L78 Accepts]: Start accepts. Automaton has 8418 states and 9993 transitions. Word has length 117 [2025-03-08 22:48:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:21,077 INFO L471 AbstractCegarLoop]: Abstraction has 8418 states and 9993 transitions. [2025-03-08 22:48:21,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.095238095238095) internal successors, (149), 20 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:21,077 INFO L276 IsEmpty]: Start isEmpty. Operand 8418 states and 9993 transitions. [2025-03-08 22:48:21,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 22:48:21,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:21,081 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 15, 8, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:21,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-08 22:48:21,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-08 22:48:21,284 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:21,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:21,284 INFO L85 PathProgramCache]: Analyzing trace with hash 633829381, now seen corresponding path program 1 times [2025-03-08 22:48:21,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:21,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258349871] [2025-03-08 22:48:21,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:21,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:21,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 22:48:21,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 22:48:21,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:21,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 419 proven. 4 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-08 22:48:21,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:21,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258349871] [2025-03-08 22:48:21,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258349871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:21,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065579030] [2025-03-08 22:48:21,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:21,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:21,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:21,455 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:21,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-08 22:48:21,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 22:48:21,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 22:48:21,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:21,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:21,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:48:21,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 419 proven. 4 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-08 22:48:21,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-08 22:48:21,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065579030] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:21,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:48:21,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 9 [2025-03-08 22:48:21,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114872076] [2025-03-08 22:48:21,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:21,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:48:21,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:21,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:48:21,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:48:21,700 INFO L87 Difference]: Start difference. First operand 8418 states and 9993 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:21,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:21,753 INFO L93 Difference]: Finished difference Result 5403 states and 6319 transitions. [2025-03-08 22:48:21,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:48:21,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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 146 [2025-03-08 22:48:21,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:21,758 INFO L225 Difference]: With dead ends: 5403 [2025-03-08 22:48:21,758 INFO L226 Difference]: Without dead ends: 5403 [2025-03-08 22:48:21,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:48:21,758 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 38 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:21,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 285 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:21,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5403 states. [2025-03-08 22:48:21,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5403 to 5198. [2025-03-08 22:48:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5198 states, 5189 states have (on average 1.173636538832145) internal successors, (6090), 5197 states have internal predecessors, (6090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5198 states to 5198 states and 6090 transitions. [2025-03-08 22:48:21,780 INFO L78 Accepts]: Start accepts. Automaton has 5198 states and 6090 transitions. Word has length 146 [2025-03-08 22:48:21,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:21,780 INFO L471 AbstractCegarLoop]: Abstraction has 5198 states and 6090 transitions. [2025-03-08 22:48:21,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:21,780 INFO L276 IsEmpty]: Start isEmpty. Operand 5198 states and 6090 transitions. [2025-03-08 22:48:21,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 22:48:21,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:21,782 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 16, 12, 11, 9, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:21,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:21,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-08 22:48:21,983 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:21,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:21,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1041455511, now seen corresponding path program 2 times [2025-03-08 22:48:21,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:21,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648346970] [2025-03-08 22:48:21,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:48:21,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:21,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 155 statements into 2 equivalence classes. [2025-03-08 22:48:22,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 22:48:22,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:48:22,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 418 proven. 3 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-08 22:48:22,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:22,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648346970] [2025-03-08 22:48:22,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648346970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:22,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038887335] [2025-03-08 22:48:22,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:48:22,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:22,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:22,098 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:22,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-08 22:48:22,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 155 statements into 2 equivalence classes. [2025-03-08 22:48:22,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 22:48:22,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:48:22,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:22,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 22:48:22,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 377 proven. 97 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-03-08 22:48:22,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 377 proven. 97 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-03-08 22:48:22,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038887335] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:22,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:22,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-08 22:48:22,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104768167] [2025-03-08 22:48:22,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:22,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:48:22,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:22,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:48:22,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:48:22,414 INFO L87 Difference]: Start difference. First operand 5198 states and 6090 transitions. Second operand has 13 states, 13 states have (on average 9.076923076923077) internal successors, (118), 13 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:22,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:22,584 INFO L93 Difference]: Finished difference Result 4397 states and 4973 transitions. [2025-03-08 22:48:22,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 22:48:22,584 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.076923076923077) internal successors, (118), 13 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-03-08 22:48:22,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:22,588 INFO L225 Difference]: With dead ends: 4397 [2025-03-08 22:48:22,589 INFO L226 Difference]: Without dead ends: 4397 [2025-03-08 22:48:22,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2025-03-08 22:48:22,589 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 116 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:22,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1035 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2025-03-08 22:48:22,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 4129. [2025-03-08 22:48:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4129 states, 4120 states have (on average 1.1381067961165048) internal successors, (4689), 4128 states have internal predecessors, (4689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 4689 transitions. [2025-03-08 22:48:22,617 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 4689 transitions. Word has length 155 [2025-03-08 22:48:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:22,617 INFO L471 AbstractCegarLoop]: Abstraction has 4129 states and 4689 transitions. [2025-03-08 22:48:22,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.076923076923077) internal successors, (118), 13 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 4689 transitions. [2025-03-08 22:48:22,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 22:48:22,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:22,620 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 17, 10, 10, 8, 8, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:22,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:22,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-08 22:48:22,824 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 17 more)] === [2025-03-08 22:48:22,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash -790989312, now seen corresponding path program 1 times [2025-03-08 22:48:22,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:22,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748070484] [2025-03-08 22:48:22,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:22,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:22,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 22:48:22,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 22:48:22,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:22,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 104 proven. 678 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 22:48:23,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:23,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748070484] [2025-03-08 22:48:23,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748070484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:23,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277638221] [2025-03-08 22:48:23,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:23,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:23,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:23,470 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:23,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-08 22:48:23,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 22:48:23,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 22:48:23,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:23,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:23,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-08 22:48:23,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:23,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:23,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:23,933 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:48:23,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 22:48:23,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:48:23,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:48:23,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:48:23,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:48:23,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:48:23,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:48:24,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:48:24,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:48:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 100 proven. 672 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-08 22:48:24,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:24,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:48:24,838 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 22 treesize of output 23 [2025-03-08 22:48:24,840 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 36 treesize of output 24 [2025-03-08 22:48:24,842 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 11 treesize of output 7 [2025-03-08 22:48:24,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:48:24,852 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 22 treesize of output 23 [2025-03-08 22:48:24,854 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:48:24,855 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 20 treesize of output 8 [2025-03-08 22:48:25,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:48:25,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2025-03-08 22:48:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 90 proven. 666 refuted. 16 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-08 22:48:25,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277638221] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:48:25,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:48:25,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 23 [2025-03-08 22:48:25,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269902266] [2025-03-08 22:48:25,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:25,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 22:48:25,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:25,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 22:48:25,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=478, Unknown=12, NotChecked=0, Total=552 [2025-03-08 22:48:25,103 INFO L87 Difference]: Start difference. First operand 4129 states and 4689 transitions. Second operand has 24 states, 24 states have (on average 9.791666666666666) internal successors, (235), 23 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:28,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:48:33,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:48:38,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:48:39,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:48:40,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:48:42,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:48:43,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:48:44,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:48:45,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:48:47,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:48:49,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:48:51,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:48:52,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:48:54,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:48:55,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:48:56,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:48:58,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:48:59,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:49:00,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:49:02,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:49:06,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:49:08,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:49:10,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:49:11,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:49:12,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:49:14,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:49:15,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:49:17,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:49:19,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:49:20,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:49:22,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:49:24,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 22:49:26,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]