./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0218.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0218.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 d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:55:27,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:55:27,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:55:27,618 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:55:27,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:55:27,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:55:27,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:55:27,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:55:27,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:55:27,640 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:55:27,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:55:27,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:55:27,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:55:27,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:55:27,641 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:55:27,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:55:27,641 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:55:27,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:55:27,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:55:27,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:55:27,641 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:55:27,641 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:55:27,641 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:55:27,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:55:27,641 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:55:27,641 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:55:27,641 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:55:27,641 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:55:27,641 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:55:27,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:55:27,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:55:27,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:55:27,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:55:27,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:55:27,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:55:27,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:55:27,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:55:27,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:55:27,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:55:27,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:55:27,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:55:27,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:55:27,643 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 -> d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 [2025-03-17 11:55:27,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:55:27,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:55:27,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:55:27,905 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:55:27,906 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:55:27,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0218.i [2025-03-17 11:55:29,065 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e396f4f1/e49f0e8c229c406988bd7c15706f2294/FLAG28dbd2c0f [2025-03-17 11:55:29,334 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:55:29,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0218.i [2025-03-17 11:55:29,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e396f4f1/e49f0e8c229c406988bd7c15706f2294/FLAG28dbd2c0f [2025-03-17 11:55:29,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e396f4f1/e49f0e8c229c406988bd7c15706f2294 [2025-03-17 11:55:29,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:55:29,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:55:29,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:55:29,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:55:29,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:55:29,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:55:29" (1/1) ... [2025-03-17 11:55:29,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10be4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:29, skipping insertion in model container [2025-03-17 11:55:29,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:55:29" (1/1) ... [2025-03-17 11:55:29,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:55:29,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:55:29,627 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:55:29,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:55:29,681 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:55:29,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:29 WrapperNode [2025-03-17 11:55:29,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:55:29,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:55:29,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:55:29,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:55:29,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:29" (1/1) ... [2025-03-17 11:55:29,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:29" (1/1) ... [2025-03-17 11:55:29,718 INFO L138 Inliner]: procedures = 181, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2025-03-17 11:55:29,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:55:29,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:55:29,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:55:29,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:55:29,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:29" (1/1) ... [2025-03-17 11:55:29,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:29" (1/1) ... [2025-03-17 11:55:29,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:29" (1/1) ... [2025-03-17 11:55:29,753 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2025-03-17 11:55:29,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:29" (1/1) ... [2025-03-17 11:55:29,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:29" (1/1) ... [2025-03-17 11:55:29,761 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:29" (1/1) ... [2025-03-17 11:55:29,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:29" (1/1) ... [2025-03-17 11:55:29,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:29" (1/1) ... [2025-03-17 11:55:29,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:29" (1/1) ... [2025-03-17 11:55:29,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:55:29,773 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:55:29,773 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:55:29,773 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:55:29,773 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:29" (1/1) ... [2025-03-17 11:55:29,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:55:29,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:29,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:55:29,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:55:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2025-03-17 11:55:29,816 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2025-03-17 11:55:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:55:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:55:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 11:55:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 11:55:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 11:55:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 11:55:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:55:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 11:55:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 11:55:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:55:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:55:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:55:29,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:55:29,923 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:55:29,925 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:55:30,339 INFO L? ?]: Removed 177 outVars from TransFormulas that were not future-live. [2025-03-17 11:55:30,339 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:55:30,351 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:55:30,353 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:55:30,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:55:30 BoogieIcfgContainer [2025-03-17 11:55:30,353 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:55:30,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:55:30,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:55:30,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:55:30,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:55:29" (1/3) ... [2025-03-17 11:55:30,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d98d328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:55:30, skipping insertion in model container [2025-03-17 11:55:30,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:55:29" (2/3) ... [2025-03-17 11:55:30,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d98d328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:55:30, skipping insertion in model container [2025-03-17 11:55:30,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:55:30" (3/3) ... [2025-03-17 11:55:30,362 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0218.i [2025-03-17 11:55:30,371 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:55:30,372 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0218.i that has 2 procedures, 158 locations, 1 initial locations, 6 loop locations, and 65 error locations. [2025-03-17 11:55:30,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:55:30,414 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;@46fdc8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:55:30,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-03-17 11:55:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 89 states have (on average 2.0) internal successors, (178), 154 states have internal predecessors, (178), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:55:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 11:55:30,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:30,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 11:55:30,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:30,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash 205939158, now seen corresponding path program 1 times [2025-03-17 11:55:30,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:30,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150683909] [2025-03-17 11:55:30,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:30,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:30,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 11:55:30,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 11:55:30,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:30,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:30,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:30,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:30,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150683909] [2025-03-17 11:55:30,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150683909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:30,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:30,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:55:30,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281048416] [2025-03-17 11:55:30,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:30,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:55:30,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:30,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:55:30,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:55:30,556 INFO L87 Difference]: Start difference. First operand has 158 states, 89 states have (on average 2.0) internal successors, (178), 154 states have internal predecessors, (178), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-17 11:55:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:30,575 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2025-03-17 11:55:30,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:55:30,577 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-17 11:55:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:30,581 INFO L225 Difference]: With dead ends: 158 [2025-03-17 11:55:30,581 INFO L226 Difference]: Without dead ends: 156 [2025-03-17 11:55:30,583 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-17 11:55:30,585 INFO L435 NwaCegarLoop]: 177 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, 177 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-17 11:55:30,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-17 11:55:30,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-03-17 11:55:30,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 88 states have (on average 1.9431818181818181) internal successors, (171), 152 states have internal predecessors, (171), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:55:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2025-03-17 11:55:30,623 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 5 [2025-03-17 11:55:30,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:30,623 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2025-03-17 11:55:30,623 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-17 11:55:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2025-03-17 11:55:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:55:30,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:30,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:55:30,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:55:30,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:30,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:30,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2092961854, now seen corresponding path program 1 times [2025-03-17 11:55:30,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:30,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925697733] [2025-03-17 11:55:30,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:30,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:30,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:55:30,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:55:30,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:30,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:30,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:30,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:30,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925697733] [2025-03-17 11:55:30,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925697733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:30,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:30,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:55:30,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861849547] [2025-03-17 11:55:30,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:30,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:55:30,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:30,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:55:30,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:55:30,746 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:30,936 INFO L93 Difference]: Finished difference Result 305 states and 342 transitions. [2025-03-17 11:55:30,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:55:30,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:55:30,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:30,938 INFO L225 Difference]: With dead ends: 305 [2025-03-17 11:55:30,940 INFO L226 Difference]: Without dead ends: 305 [2025-03-17 11:55:30,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:55:30,940 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 158 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:30,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 223 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-17 11:55:30,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 216. [2025-03-17 11:55:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 145 states have (on average 1.910344827586207) internal successors, (277), 209 states have internal predecessors, (277), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:55:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 285 transitions. [2025-03-17 11:55:30,963 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 285 transitions. Word has length 6 [2025-03-17 11:55:30,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:30,964 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 285 transitions. [2025-03-17 11:55:30,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:30,965 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 285 transitions. [2025-03-17 11:55:30,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:55:30,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:30,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:55:30,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:55:30,965 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:30,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:30,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2092961855, now seen corresponding path program 1 times [2025-03-17 11:55:30,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:30,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503517049] [2025-03-17 11:55:30,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:30,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:30,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:55:30,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:55:30,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:30,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:31,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:31,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503517049] [2025-03-17 11:55:31,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503517049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:31,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:31,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:55:31,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427608459] [2025-03-17 11:55:31,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:31,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:31,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:31,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:31,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:31,099 INFO L87 Difference]: Start difference. First operand 216 states and 285 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:31,201 INFO L93 Difference]: Finished difference Result 219 states and 288 transitions. [2025-03-17 11:55:31,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:31,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:55:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:31,202 INFO L225 Difference]: With dead ends: 219 [2025-03-17 11:55:31,203 INFO L226 Difference]: Without dead ends: 219 [2025-03-17 11:55:31,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:31,204 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 172 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:31,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 232 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:31,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-17 11:55:31,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2025-03-17 11:55:31,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 147 states have (on average 1.9047619047619047) internal successors, (280), 211 states have internal predecessors, (280), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:55:31,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 288 transitions. [2025-03-17 11:55:31,221 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 288 transitions. Word has length 6 [2025-03-17 11:55:31,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:31,221 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 288 transitions. [2025-03-17 11:55:31,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 288 transitions. [2025-03-17 11:55:31,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:55:31,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:31,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:55:31,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:55:31,221 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:31,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:31,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2092961886, now seen corresponding path program 1 times [2025-03-17 11:55:31,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:31,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957680659] [2025-03-17 11:55:31,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:31,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:31,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:55:31,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:55:31,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:31,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:31,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:31,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:31,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957680659] [2025-03-17 11:55:31,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957680659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:31,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:31,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:55:31,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047871767] [2025-03-17 11:55:31,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:31,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:31,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:31,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:31,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:31,317 INFO L87 Difference]: Start difference. First operand 218 states and 288 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:31,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:31,435 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2025-03-17 11:55:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:31,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:55:31,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:31,437 INFO L225 Difference]: With dead ends: 218 [2025-03-17 11:55:31,437 INFO L226 Difference]: Without dead ends: 218 [2025-03-17 11:55:31,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:31,438 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 169 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:31,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 232 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:31,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-17 11:55:31,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 215. [2025-03-17 11:55:31,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 145 states have (on average 1.896551724137931) internal successors, (275), 208 states have internal predecessors, (275), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:55:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 283 transitions. [2025-03-17 11:55:31,449 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 283 transitions. Word has length 6 [2025-03-17 11:55:31,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:31,449 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 283 transitions. [2025-03-17 11:55:31,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:55:31,449 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 283 transitions. [2025-03-17 11:55:31,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:55:31,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:31,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:31,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:55:31,451 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:31,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:31,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1386344532, now seen corresponding path program 1 times [2025-03-17 11:55:31,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:31,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139887841] [2025-03-17 11:55:31,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:31,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:31,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:55:31,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:55:31,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:31,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:31,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:31,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139887841] [2025-03-17 11:55:31,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139887841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:31,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:31,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:55:31,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465955694] [2025-03-17 11:55:31,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:31,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:31,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:31,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:31,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:31,622 INFO L87 Difference]: Start difference. First operand 215 states and 283 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-17 11:55:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:31,778 INFO L93 Difference]: Finished difference Result 380 states and 492 transitions. [2025-03-17 11:55:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:31,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-17 11:55:31,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:31,783 INFO L225 Difference]: With dead ends: 380 [2025-03-17 11:55:31,783 INFO L226 Difference]: Without dead ends: 380 [2025-03-17 11:55:31,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:31,783 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 127 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:31,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 721 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:31,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-17 11:55:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 278. [2025-03-17 11:55:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 202 states have (on average 1.8366336633663367) internal successors, (371), 267 states have internal predecessors, (371), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 11:55:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 387 transitions. [2025-03-17 11:55:31,796 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 387 transitions. Word has length 9 [2025-03-17 11:55:31,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:31,796 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 387 transitions. [2025-03-17 11:55:31,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-17 11:55:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 387 transitions. [2025-03-17 11:55:31,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:55:31,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:31,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:31,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:55:31,801 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:31,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:31,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1386344180, now seen corresponding path program 1 times [2025-03-17 11:55:31,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:31,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396293611] [2025-03-17 11:55:31,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:31,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:31,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:55:31,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:55:31,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:31,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:31,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:31,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:31,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396293611] [2025-03-17 11:55:31,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396293611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:31,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:31,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:55:31,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270750392] [2025-03-17 11:55:31,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:31,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:55:31,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:31,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:55:31,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:55:31,830 INFO L87 Difference]: Start difference. First operand 278 states and 387 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-17 11:55:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:31,928 INFO L93 Difference]: Finished difference Result 341 states and 447 transitions. [2025-03-17 11:55:31,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:55:31,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-17 11:55:31,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:31,930 INFO L225 Difference]: With dead ends: 341 [2025-03-17 11:55:31,932 INFO L226 Difference]: Without dead ends: 337 [2025-03-17 11:55:31,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:55:31,933 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 73 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:31,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 252 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:31,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-17 11:55:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 280. [2025-03-17 11:55:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 204 states have (on average 1.8235294117647058) internal successors, (372), 269 states have internal predecessors, (372), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 11:55:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 388 transitions. [2025-03-17 11:55:31,942 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 388 transitions. Word has length 9 [2025-03-17 11:55:31,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:31,942 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 388 transitions. [2025-03-17 11:55:31,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 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-17 11:55:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 388 transitions. [2025-03-17 11:55:31,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:55:31,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:31,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:31,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:55:31,943 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:31,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:31,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1387268053, now seen corresponding path program 1 times [2025-03-17 11:55:31,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:31,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779081139] [2025-03-17 11:55:31,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:31,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:31,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:55:31,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:55:31,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:31,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:32,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:32,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779081139] [2025-03-17 11:55:32,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779081139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:32,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:32,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:55:32,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678512014] [2025-03-17 11:55:32,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:32,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:32,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:32,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:32,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:32,049 INFO L87 Difference]: Start difference. First operand 280 states and 388 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-17 11:55:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:32,230 INFO L93 Difference]: Finished difference Result 371 states and 480 transitions. [2025-03-17 11:55:32,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:32,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-17 11:55:32,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:32,232 INFO L225 Difference]: With dead ends: 371 [2025-03-17 11:55:32,232 INFO L226 Difference]: Without dead ends: 366 [2025-03-17 11:55:32,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:32,232 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 115 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:32,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 736 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:32,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-17 11:55:32,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 275. [2025-03-17 11:55:32,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 199 states have (on average 1.8391959798994975) internal successors, (366), 264 states have internal predecessors, (366), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 11:55:32,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 382 transitions. [2025-03-17 11:55:32,239 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 382 transitions. Word has length 9 [2025-03-17 11:55:32,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:32,239 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 382 transitions. [2025-03-17 11:55:32,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-17 11:55:32,240 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 382 transitions. [2025-03-17 11:55:32,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 11:55:32,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:32,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:32,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:55:32,240 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:32,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:32,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1987668926, now seen corresponding path program 1 times [2025-03-17 11:55:32,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:32,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267558834] [2025-03-17 11:55:32,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:32,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:32,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:55:32,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:55:32,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:32,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:32,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:32,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267558834] [2025-03-17 11:55:32,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267558834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:32,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:32,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:55:32,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968821632] [2025-03-17 11:55:32,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:32,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:32,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:32,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:32,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:32,290 INFO L87 Difference]: Start difference. First operand 275 states and 382 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:32,450 INFO L93 Difference]: Finished difference Result 370 states and 456 transitions. [2025-03-17 11:55:32,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:32,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-17 11:55:32,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:32,452 INFO L225 Difference]: With dead ends: 370 [2025-03-17 11:55:32,452 INFO L226 Difference]: Without dead ends: 370 [2025-03-17 11:55:32,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:32,452 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 160 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:32,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 322 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-17 11:55:32,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 281. [2025-03-17 11:55:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 205 states have (on average 1.8146341463414635) internal successors, (372), 270 states have internal predecessors, (372), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 11:55:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 388 transitions. [2025-03-17 11:55:32,468 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 388 transitions. Word has length 14 [2025-03-17 11:55:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:32,468 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 388 transitions. [2025-03-17 11:55:32,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 388 transitions. [2025-03-17 11:55:32,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 11:55:32,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:32,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:32,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:55:32,469 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:32,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:32,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1987668927, now seen corresponding path program 1 times [2025-03-17 11:55:32,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:32,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045203241] [2025-03-17 11:55:32,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:32,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:32,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 11:55:32,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 11:55:32,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:32,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:32,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:32,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045203241] [2025-03-17 11:55:32,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045203241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:32,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:32,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:55:32,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413304450] [2025-03-17 11:55:32,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:32,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:32,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:32,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:32,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:32,542 INFO L87 Difference]: Start difference. First operand 281 states and 388 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:32,646 INFO L93 Difference]: Finished difference Result 280 states and 378 transitions. [2025-03-17 11:55:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:32,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-17 11:55:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:32,648 INFO L225 Difference]: With dead ends: 280 [2025-03-17 11:55:32,648 INFO L226 Difference]: Without dead ends: 280 [2025-03-17 11:55:32,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:32,649 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 169 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:32,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 218 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:32,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-17 11:55:32,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2025-03-17 11:55:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 205 states have (on average 1.7560975609756098) internal successors, (360), 267 states have internal predecessors, (360), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 11:55:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 376 transitions. [2025-03-17 11:55:32,655 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 376 transitions. Word has length 14 [2025-03-17 11:55:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:32,655 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 376 transitions. [2025-03-17 11:55:32,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:32,655 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 376 transitions. [2025-03-17 11:55:32,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:55:32,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:32,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:32,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:55:32,657 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:32,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:32,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1146235524, now seen corresponding path program 1 times [2025-03-17 11:55:32,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:32,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632491352] [2025-03-17 11:55:32,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:32,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:32,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:55:32,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:55:32,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:32,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:32,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:32,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632491352] [2025-03-17 11:55:32,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632491352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:32,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:32,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:55:32,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015544337] [2025-03-17 11:55:32,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:32,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:55:32,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:32,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:55:32,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:32,772 INFO L87 Difference]: Start difference. First operand 278 states and 376 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:32,960 INFO L93 Difference]: Finished difference Result 383 states and 477 transitions. [2025-03-17 11:55:32,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:32,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-17 11:55:32,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:32,962 INFO L225 Difference]: With dead ends: 383 [2025-03-17 11:55:32,962 INFO L226 Difference]: Without dead ends: 383 [2025-03-17 11:55:32,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:55:32,963 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 294 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:32,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 374 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:32,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-17 11:55:32,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 275. [2025-03-17 11:55:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 206 states have (on average 1.7184466019417475) internal successors, (354), 264 states have internal predecessors, (354), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 11:55:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 370 transitions. [2025-03-17 11:55:32,980 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 370 transitions. Word has length 16 [2025-03-17 11:55:32,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:32,980 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 370 transitions. [2025-03-17 11:55:32,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:32,981 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 370 transitions. [2025-03-17 11:55:32,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:55:32,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:32,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:32,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:55:32,981 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:32,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:32,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1146235523, now seen corresponding path program 1 times [2025-03-17 11:55:32,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:32,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339341055] [2025-03-17 11:55:32,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:32,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:32,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:55:32,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:55:32,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:32,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:33,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:33,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339341055] [2025-03-17 11:55:33,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339341055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:33,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:33,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:55:33,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239945852] [2025-03-17 11:55:33,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:33,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:33,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:33,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:33,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:33,200 INFO L87 Difference]: Start difference. First operand 275 states and 370 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:33,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:33,356 INFO L93 Difference]: Finished difference Result 347 states and 471 transitions. [2025-03-17 11:55:33,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:33,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-17 11:55:33,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:33,359 INFO L225 Difference]: With dead ends: 347 [2025-03-17 11:55:33,359 INFO L226 Difference]: Without dead ends: 347 [2025-03-17 11:55:33,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:33,359 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 242 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:33,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 445 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-17 11:55:33,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 337. [2025-03-17 11:55:33,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 264 states have (on average 1.6931818181818181) internal successors, (447), 324 states have internal predecessors, (447), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-17 11:55:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 471 transitions. [2025-03-17 11:55:33,373 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 471 transitions. Word has length 16 [2025-03-17 11:55:33,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:33,374 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 471 transitions. [2025-03-17 11:55:33,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:33,374 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 471 transitions. [2025-03-17 11:55:33,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:55:33,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:33,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:33,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:55:33,377 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:33,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:33,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1341277310, now seen corresponding path program 1 times [2025-03-17 11:55:33,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:33,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580697875] [2025-03-17 11:55:33,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:33,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:33,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 11:55:33,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:55:33,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:33,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:33,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:33,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580697875] [2025-03-17 11:55:33,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580697875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:33,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:33,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:55:33,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848931596] [2025-03-17 11:55:33,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:33,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:33,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:33,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:33,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:33,433 INFO L87 Difference]: Start difference. First operand 337 states and 471 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:33,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:33,455 INFO L93 Difference]: Finished difference Result 337 states and 469 transitions. [2025-03-17 11:55:33,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:33,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-17 11:55:33,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:33,456 INFO L225 Difference]: With dead ends: 337 [2025-03-17 11:55:33,456 INFO L226 Difference]: Without dead ends: 337 [2025-03-17 11:55:33,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:55:33,457 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:33,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 836 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:33,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-17 11:55:33,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-03-17 11:55:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 264 states have (on average 1.6856060606060606) internal successors, (445), 324 states have internal predecessors, (445), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-17 11:55:33,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 469 transitions. [2025-03-17 11:55:33,463 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 469 transitions. Word has length 16 [2025-03-17 11:55:33,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:33,463 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 469 transitions. [2025-03-17 11:55:33,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 469 transitions. [2025-03-17 11:55:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 11:55:33,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:33,464 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:33,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:55:33,464 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:33,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:33,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1370014622, now seen corresponding path program 1 times [2025-03-17 11:55:33,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:33,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873462272] [2025-03-17 11:55:33,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:33,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:33,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 11:55:33,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 11:55:33,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:33,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:33,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:33,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:33,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873462272] [2025-03-17 11:55:33,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873462272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:33,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:33,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:55:33,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606998209] [2025-03-17 11:55:33,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:33,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:55:33,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:33,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:55:33,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:55:33,723 INFO L87 Difference]: Start difference. First operand 337 states and 469 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:34,098 INFO L93 Difference]: Finished difference Result 449 states and 571 transitions. [2025-03-17 11:55:34,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:55:34,098 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-17 11:55:34,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:34,100 INFO L225 Difference]: With dead ends: 449 [2025-03-17 11:55:34,100 INFO L226 Difference]: Without dead ends: 449 [2025-03-17 11:55:34,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:55:34,101 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 256 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:34,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 581 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:55:34,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-17 11:55:34,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 334. [2025-03-17 11:55:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 261 states have (on average 1.685823754789272) internal successors, (440), 321 states have internal predecessors, (440), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-17 11:55:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 464 transitions. [2025-03-17 11:55:34,109 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 464 transitions. Word has length 17 [2025-03-17 11:55:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:34,109 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 464 transitions. [2025-03-17 11:55:34,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 464 transitions. [2025-03-17 11:55:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 11:55:34,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:34,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:34,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:55:34,110 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:34,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:34,110 INFO L85 PathProgramCache]: Analyzing trace with hash -573880425, now seen corresponding path program 1 times [2025-03-17 11:55:34,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:34,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704892670] [2025-03-17 11:55:34,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:34,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:34,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:55:34,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:55:34,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:34,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:34,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:34,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704892670] [2025-03-17 11:55:34,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704892670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:34,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:34,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:55:34,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134963242] [2025-03-17 11:55:34,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:34,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:55:34,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:34,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:55:34,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:34,279 INFO L87 Difference]: Start difference. First operand 334 states and 464 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:34,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:34,471 INFO L93 Difference]: Finished difference Result 469 states and 617 transitions. [2025-03-17 11:55:34,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:55:34,471 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-17 11:55:34,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:34,473 INFO L225 Difference]: With dead ends: 469 [2025-03-17 11:55:34,473 INFO L226 Difference]: Without dead ends: 469 [2025-03-17 11:55:34,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:55:34,474 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 144 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:34,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 952 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:34,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-17 11:55:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 352. [2025-03-17 11:55:34,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 279 states have (on average 1.6594982078853047) internal successors, (463), 337 states have internal predecessors, (463), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-17 11:55:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 487 transitions. [2025-03-17 11:55:34,484 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 487 transitions. Word has length 20 [2025-03-17 11:55:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:34,485 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 487 transitions. [2025-03-17 11:55:34,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:34,485 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 487 transitions. [2025-03-17 11:55:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 11:55:34,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:34,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:34,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:55:34,486 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:34,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash -612983945, now seen corresponding path program 1 times [2025-03-17 11:55:34,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:34,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072679624] [2025-03-17 11:55:34,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:34,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:34,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:55:34,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:55:34,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:34,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:34,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:34,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072679624] [2025-03-17 11:55:34,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072679624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:34,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:34,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:55:34,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559711157] [2025-03-17 11:55:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:34,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:55:34,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:34,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:55:34,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:34,668 INFO L87 Difference]: Start difference. First operand 352 states and 487 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:34,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:34,932 INFO L93 Difference]: Finished difference Result 445 states and 588 transitions. [2025-03-17 11:55:34,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:55:34,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-17 11:55:34,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:34,935 INFO L225 Difference]: With dead ends: 445 [2025-03-17 11:55:34,935 INFO L226 Difference]: Without dead ends: 445 [2025-03-17 11:55:34,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:55:34,935 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 105 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:34,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 972 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:34,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-03-17 11:55:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 346. [2025-03-17 11:55:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 273 states have (on average 1.6556776556776556) internal successors, (452), 331 states have internal predecessors, (452), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-17 11:55:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 476 transitions. [2025-03-17 11:55:34,944 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 476 transitions. Word has length 20 [2025-03-17 11:55:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:34,944 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 476 transitions. [2025-03-17 11:55:34,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 476 transitions. [2025-03-17 11:55:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:55:34,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:34,945 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:34,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:55:34,945 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:34,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:34,945 INFO L85 PathProgramCache]: Analyzing trace with hash -34819076, now seen corresponding path program 1 times [2025-03-17 11:55:34,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:34,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674579467] [2025-03-17 11:55:34,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:34,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:34,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:55:34,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:55:34,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:34,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:35,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:35,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674579467] [2025-03-17 11:55:35,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674579467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:35,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:35,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:55:35,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34639910] [2025-03-17 11:55:35,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:35,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:55:35,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:35,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:55:35,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:35,093 INFO L87 Difference]: Start difference. First operand 346 states and 476 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:35,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:35,310 INFO L93 Difference]: Finished difference Result 467 states and 617 transitions. [2025-03-17 11:55:35,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:55:35,311 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-17 11:55:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:35,312 INFO L225 Difference]: With dead ends: 467 [2025-03-17 11:55:35,312 INFO L226 Difference]: Without dead ends: 467 [2025-03-17 11:55:35,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:55:35,314 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 114 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:35,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1086 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:35,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-17 11:55:35,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 359. [2025-03-17 11:55:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 286 states have (on average 1.6363636363636365) internal successors, (468), 342 states have internal predecessors, (468), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-17 11:55:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 492 transitions. [2025-03-17 11:55:35,323 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 492 transitions. Word has length 21 [2025-03-17 11:55:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:35,323 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 492 transitions. [2025-03-17 11:55:35,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:35,323 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 492 transitions. [2025-03-17 11:55:35,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:55:35,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:35,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:35,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:55:35,324 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:35,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:35,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1822608210, now seen corresponding path program 1 times [2025-03-17 11:55:35,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:35,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436723610] [2025-03-17 11:55:35,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:35,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:35,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:55:35,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:55:35,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:35,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:35,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:35,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436723610] [2025-03-17 11:55:35,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436723610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:35,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:35,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:55:35,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101829151] [2025-03-17 11:55:35,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:35,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:35,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:35,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:35,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:35,370 INFO L87 Difference]: Start difference. First operand 359 states and 492 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:35,512 INFO L93 Difference]: Finished difference Result 436 states and 552 transitions. [2025-03-17 11:55:35,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:35,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-17 11:55:35,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:35,514 INFO L225 Difference]: With dead ends: 436 [2025-03-17 11:55:35,514 INFO L226 Difference]: Without dead ends: 436 [2025-03-17 11:55:35,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:35,515 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 163 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:35,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 321 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:35,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-17 11:55:35,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 373. [2025-03-17 11:55:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 300 states have (on average 1.6533333333333333) internal successors, (496), 356 states have internal predecessors, (496), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-17 11:55:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 520 transitions. [2025-03-17 11:55:35,523 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 520 transitions. Word has length 21 [2025-03-17 11:55:35,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:35,524 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 520 transitions. [2025-03-17 11:55:35,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:35,524 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 520 transitions. [2025-03-17 11:55:35,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:55:35,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:35,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:35,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:55:35,525 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:35,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:35,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1822608209, now seen corresponding path program 1 times [2025-03-17 11:55:35,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:35,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275503703] [2025-03-17 11:55:35,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:35,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:35,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:55:35,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:55:35,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:35,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:35,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-17 11:55:35,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:35,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275503703] [2025-03-17 11:55:35,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275503703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:35,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:35,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:55:35,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874558855] [2025-03-17 11:55:35,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:35,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:55:35,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:35,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:55:35,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:55:35,648 INFO L87 Difference]: Start difference. First operand 373 states and 520 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:35,815 INFO L93 Difference]: Finished difference Result 343 states and 462 transitions. [2025-03-17 11:55:35,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:55:35,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-17 11:55:35,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:35,820 INFO L225 Difference]: With dead ends: 343 [2025-03-17 11:55:35,821 INFO L226 Difference]: Without dead ends: 343 [2025-03-17 11:55:35,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:55:35,821 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 56 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:35,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 872 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:35,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-17 11:55:35,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 313. [2025-03-17 11:55:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 244 states have (on average 1.6680327868852458) internal successors, (407), 300 states have internal predecessors, (407), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 11:55:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 425 transitions. [2025-03-17 11:55:35,830 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 425 transitions. Word has length 21 [2025-03-17 11:55:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:35,830 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 425 transitions. [2025-03-17 11:55:35,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 425 transitions. [2025-03-17 11:55:35,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 11:55:35,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:35,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:35,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:55:35,831 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:35,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:35,831 INFO L85 PathProgramCache]: Analyzing trace with hash 494616393, now seen corresponding path program 1 times [2025-03-17 11:55:35,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:35,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156665610] [2025-03-17 11:55:35,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:35,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:35,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:55:35,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:55:35,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:35,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:35,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:35,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:35,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156665610] [2025-03-17 11:55:35,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156665610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:35,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:35,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:55:35,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518011598] [2025-03-17 11:55:35,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:35,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:35,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:35,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:35,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:35,868 INFO L87 Difference]: Start difference. First operand 313 states and 425 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:35,884 INFO L93 Difference]: Finished difference Result 325 states and 437 transitions. [2025-03-17 11:55:35,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:35,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-17 11:55:35,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:35,886 INFO L225 Difference]: With dead ends: 325 [2025-03-17 11:55:35,886 INFO L226 Difference]: Without dead ends: 325 [2025-03-17 11:55:35,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-17 11:55:35,886 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 1 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:35,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 481 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-17 11:55:35,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2025-03-17 11:55:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 256 states have (on average 1.63671875) internal successors, (419), 312 states have internal predecessors, (419), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 11:55:35,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 437 transitions. [2025-03-17 11:55:35,895 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 437 transitions. Word has length 24 [2025-03-17 11:55:35,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:35,895 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 437 transitions. [2025-03-17 11:55:35,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:35,895 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 437 transitions. [2025-03-17 11:55:35,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 11:55:35,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:35,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:35,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:55:35,896 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:35,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:35,896 INFO L85 PathProgramCache]: Analyzing trace with hash 495565711, now seen corresponding path program 1 times [2025-03-17 11:55:35,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:35,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195144088] [2025-03-17 11:55:35,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:35,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:35,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:55:35,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:55:35,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:35,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:35,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:35,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195144088] [2025-03-17 11:55:35,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195144088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:35,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:35,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:55:35,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866141942] [2025-03-17 11:55:35,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:35,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:55:35,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:35,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:55:35,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:55:35,931 INFO L87 Difference]: Start difference. First operand 325 states and 437 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:35,990 INFO L93 Difference]: Finished difference Result 323 states and 429 transitions. [2025-03-17 11:55:35,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:55:35,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-17 11:55:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:35,992 INFO L225 Difference]: With dead ends: 323 [2025-03-17 11:55:35,992 INFO L226 Difference]: Without dead ends: 323 [2025-03-17 11:55:35,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:55:35,992 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 34 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:35,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 219 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:35,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-17 11:55:35,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2025-03-17 11:55:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 256 states have (on average 1.60546875) internal successors, (411), 310 states have internal predecessors, (411), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 11:55:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 429 transitions. [2025-03-17 11:55:35,999 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 429 transitions. Word has length 24 [2025-03-17 11:55:35,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:35,999 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 429 transitions. [2025-03-17 11:55:35,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:36,000 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 429 transitions. [2025-03-17 11:55:36,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 11:55:36,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:36,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:36,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:55:36,001 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:36,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:36,001 INFO L85 PathProgramCache]: Analyzing trace with hash 495565712, now seen corresponding path program 1 times [2025-03-17 11:55:36,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:36,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440057090] [2025-03-17 11:55:36,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:36,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:36,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:55:36,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:55:36,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:36,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:36,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:36,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440057090] [2025-03-17 11:55:36,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440057090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:36,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:36,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:55:36,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269222805] [2025-03-17 11:55:36,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:36,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:36,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:36,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:36,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:36,066 INFO L87 Difference]: Start difference. First operand 323 states and 429 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:36,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:36,145 INFO L93 Difference]: Finished difference Result 401 states and 532 transitions. [2025-03-17 11:55:36,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:36,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-17 11:55:36,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:36,147 INFO L225 Difference]: With dead ends: 401 [2025-03-17 11:55:36,147 INFO L226 Difference]: Without dead ends: 401 [2025-03-17 11:55:36,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:36,147 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 59 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:36,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 335 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:36,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-17 11:55:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 395. [2025-03-17 11:55:36,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 328 states have (on average 1.5670731707317074) internal successors, (514), 382 states have internal predecessors, (514), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 11:55:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 532 transitions. [2025-03-17 11:55:36,155 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 532 transitions. Word has length 24 [2025-03-17 11:55:36,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:36,157 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 532 transitions. [2025-03-17 11:55:36,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 532 transitions. [2025-03-17 11:55:36,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 11:55:36,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:36,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:36,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:55:36,157 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:36,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:36,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2014481238, now seen corresponding path program 1 times [2025-03-17 11:55:36,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:36,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997113958] [2025-03-17 11:55:36,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:36,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:36,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:55:36,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:55:36,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:36,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:36,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:36,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997113958] [2025-03-17 11:55:36,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997113958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:36,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:36,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:55:36,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539257835] [2025-03-17 11:55:36,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:36,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:36,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:36,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:36,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:36,203 INFO L87 Difference]: Start difference. First operand 395 states and 532 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:36,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:36,225 INFO L93 Difference]: Finished difference Result 416 states and 552 transitions. [2025-03-17 11:55:36,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:36,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-17 11:55:36,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:36,227 INFO L225 Difference]: With dead ends: 416 [2025-03-17 11:55:36,227 INFO L226 Difference]: Without dead ends: 416 [2025-03-17 11:55:36,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:55:36,229 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 43 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:36,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 800 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:36,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-17 11:55:36,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 377. [2025-03-17 11:55:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 310 states have (on average 1.564516129032258) internal successors, (485), 364 states have internal predecessors, (485), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 11:55:36,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 503 transitions. [2025-03-17 11:55:36,236 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 503 transitions. Word has length 25 [2025-03-17 11:55:36,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:36,236 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 503 transitions. [2025-03-17 11:55:36,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:36,236 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 503 transitions. [2025-03-17 11:55:36,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 11:55:36,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:36,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:36,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:55:36,236 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:36,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:36,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1017408885, now seen corresponding path program 1 times [2025-03-17 11:55:36,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:36,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437574600] [2025-03-17 11:55:36,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:36,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:36,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:55:36,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:55:36,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:36,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:36,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:36,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437574600] [2025-03-17 11:55:36,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437574600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:36,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:36,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:55:36,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773908556] [2025-03-17 11:55:36,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:36,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:36,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:36,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:36,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:36,284 INFO L87 Difference]: Start difference. First operand 377 states and 503 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:36,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:36,382 INFO L93 Difference]: Finished difference Result 439 states and 584 transitions. [2025-03-17 11:55:36,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:36,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-17 11:55:36,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:36,383 INFO L225 Difference]: With dead ends: 439 [2025-03-17 11:55:36,383 INFO L226 Difference]: Without dead ends: 439 [2025-03-17 11:55:36,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:36,384 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 56 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:36,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 349 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:36,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-17 11:55:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 378. [2025-03-17 11:55:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 311 states have (on average 1.562700964630225) internal successors, (486), 365 states have internal predecessors, (486), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 11:55:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 504 transitions. [2025-03-17 11:55:36,390 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 504 transitions. Word has length 25 [2025-03-17 11:55:36,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:36,390 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 504 transitions. [2025-03-17 11:55:36,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 504 transitions. [2025-03-17 11:55:36,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 11:55:36,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:36,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:36,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:55:36,392 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:36,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:36,392 INFO L85 PathProgramCache]: Analyzing trace with hash -779542474, now seen corresponding path program 1 times [2025-03-17 11:55:36,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:36,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038005234] [2025-03-17 11:55:36,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:36,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:36,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 11:55:36,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:55:36,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:36,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:36,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:36,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038005234] [2025-03-17 11:55:36,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038005234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:36,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:36,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:55:36,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543679263] [2025-03-17 11:55:36,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:36,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:36,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:36,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:36,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:36,442 INFO L87 Difference]: Start difference. First operand 378 states and 504 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:36,458 INFO L93 Difference]: Finished difference Result 321 states and 417 transitions. [2025-03-17 11:55:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:36,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-17 11:55:36,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:36,459 INFO L225 Difference]: With dead ends: 321 [2025-03-17 11:55:36,459 INFO L226 Difference]: Without dead ends: 321 [2025-03-17 11:55:36,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:36,459 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:36,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 810 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:55:36,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-17 11:55:36,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2025-03-17 11:55:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 255 states have (on average 1.5647058823529412) internal successors, (399), 308 states have internal predecessors, (399), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 11:55:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 417 transitions. [2025-03-17 11:55:36,465 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 417 transitions. Word has length 25 [2025-03-17 11:55:36,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:36,465 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 417 transitions. [2025-03-17 11:55:36,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:36,465 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 417 transitions. [2025-03-17 11:55:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 11:55:36,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:36,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:36,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:55:36,465 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:36,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:36,466 INFO L85 PathProgramCache]: Analyzing trace with hash -502718327, now seen corresponding path program 1 times [2025-03-17 11:55:36,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:36,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741866090] [2025-03-17 11:55:36,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:36,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:36,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:55:36,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:55:36,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:36,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:36,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:36,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741866090] [2025-03-17 11:55:36,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741866090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:36,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:36,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:55:36,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543758944] [2025-03-17 11:55:36,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:36,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:55:36,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:36,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:55:36,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:36,517 INFO L87 Difference]: Start difference. First operand 321 states and 417 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:36,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:36,586 INFO L93 Difference]: Finished difference Result 412 states and 543 transitions. [2025-03-17 11:55:36,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:55:36,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-17 11:55:36,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:36,588 INFO L225 Difference]: With dead ends: 412 [2025-03-17 11:55:36,588 INFO L226 Difference]: Without dead ends: 412 [2025-03-17 11:55:36,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:36,588 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 85 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:36,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 401 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:36,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-17 11:55:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 388. [2025-03-17 11:55:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 322 states have (on average 1.549689440993789) internal successors, (499), 375 states have internal predecessors, (499), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 11:55:36,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 517 transitions. [2025-03-17 11:55:36,594 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 517 transitions. Word has length 26 [2025-03-17 11:55:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:36,594 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 517 transitions. [2025-03-17 11:55:36,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 517 transitions. [2025-03-17 11:55:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 11:55:36,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:36,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:36,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:55:36,595 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:36,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:36,595 INFO L85 PathProgramCache]: Analyzing trace with hash -502718293, now seen corresponding path program 1 times [2025-03-17 11:55:36,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:36,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834949029] [2025-03-17 11:55:36,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:36,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:36,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:55:36,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:55:36,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:36,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:36,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:36,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834949029] [2025-03-17 11:55:36,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834949029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:36,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:36,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:55:36,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230408744] [2025-03-17 11:55:36,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:36,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:55:36,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:36,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:55:36,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:55:36,670 INFO L87 Difference]: Start difference. First operand 388 states and 517 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:36,764 INFO L93 Difference]: Finished difference Result 447 states and 584 transitions. [2025-03-17 11:55:36,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:55:36,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-17 11:55:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:36,766 INFO L225 Difference]: With dead ends: 447 [2025-03-17 11:55:36,766 INFO L226 Difference]: Without dead ends: 447 [2025-03-17 11:55:36,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:55:36,767 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 14 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:36,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 686 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-17 11:55:36,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 438. [2025-03-17 11:55:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 372 states have (on average 1.4946236559139785) internal successors, (556), 425 states have internal predecessors, (556), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 11:55:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 574 transitions. [2025-03-17 11:55:36,773 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 574 transitions. Word has length 26 [2025-03-17 11:55:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:36,773 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 574 transitions. [2025-03-17 11:55:36,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 574 transitions. [2025-03-17 11:55:36,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 11:55:36,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:36,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:36,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:55:36,774 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:36,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:36,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1522602706, now seen corresponding path program 1 times [2025-03-17 11:55:36,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:36,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450315745] [2025-03-17 11:55:36,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:36,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:36,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 11:55:36,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 11:55:36,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:36,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:36,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:36,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450315745] [2025-03-17 11:55:36,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450315745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:36,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:36,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:55:36,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541355332] [2025-03-17 11:55:36,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:36,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:36,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:36,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:36,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:36,834 INFO L87 Difference]: Start difference. First operand 438 states and 574 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:36,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:36,910 INFO L93 Difference]: Finished difference Result 467 states and 599 transitions. [2025-03-17 11:55:36,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:36,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-17 11:55:36,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:36,912 INFO L225 Difference]: With dead ends: 467 [2025-03-17 11:55:36,912 INFO L226 Difference]: Without dead ends: 467 [2025-03-17 11:55:36,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:36,912 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 67 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:36,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 272 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-17 11:55:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 352. [2025-03-17 11:55:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 287 states have (on average 1.494773519163763) internal successors, (429), 339 states have internal predecessors, (429), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 11:55:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 447 transitions. [2025-03-17 11:55:36,918 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 447 transitions. Word has length 27 [2025-03-17 11:55:36,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:36,918 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 447 transitions. [2025-03-17 11:55:36,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 447 transitions. [2025-03-17 11:55:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 11:55:36,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:36,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:36,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:55:36,918 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:36,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:36,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2078922292, now seen corresponding path program 1 times [2025-03-17 11:55:36,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:36,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899896702] [2025-03-17 11:55:36,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:36,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:36,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 11:55:36,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:55:36,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:36,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:36,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:36,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:36,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899896702] [2025-03-17 11:55:36,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899896702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:36,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:36,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:55:36,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638494148] [2025-03-17 11:55:36,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:36,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:36,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:36,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:36,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:36,958 INFO L87 Difference]: Start difference. First operand 352 states and 447 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:37,033 INFO L93 Difference]: Finished difference Result 353 states and 447 transitions. [2025-03-17 11:55:37,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:37,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-03-17 11:55:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:37,034 INFO L225 Difference]: With dead ends: 353 [2025-03-17 11:55:37,034 INFO L226 Difference]: Without dead ends: 353 [2025-03-17 11:55:37,034 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-17 11:55:37,035 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 52 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:37,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 301 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:37,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-17 11:55:37,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2025-03-17 11:55:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 287 states have (on average 1.4878048780487805) internal successors, (427), 338 states have internal predecessors, (427), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 11:55:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 445 transitions. [2025-03-17 11:55:37,042 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 445 transitions. Word has length 31 [2025-03-17 11:55:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:37,042 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 445 transitions. [2025-03-17 11:55:37,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:37,042 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 445 transitions. [2025-03-17 11:55:37,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 11:55:37,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:37,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:37,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:55:37,043 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:37,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:37,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2078922291, now seen corresponding path program 1 times [2025-03-17 11:55:37,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:37,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201551172] [2025-03-17 11:55:37,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:37,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:37,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 11:55:37,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:55:37,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:37,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:37,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:37,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201551172] [2025-03-17 11:55:37,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201551172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:37,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:37,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:55:37,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911648041] [2025-03-17 11:55:37,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:37,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:55:37,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:37,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:55:37,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:55:37,110 INFO L87 Difference]: Start difference. First operand 351 states and 445 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:37,180 INFO L93 Difference]: Finished difference Result 352 states and 445 transitions. [2025-03-17 11:55:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:55:37,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-03-17 11:55:37,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:37,182 INFO L225 Difference]: With dead ends: 352 [2025-03-17 11:55:37,182 INFO L226 Difference]: Without dead ends: 352 [2025-03-17 11:55:37,182 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-17 11:55:37,182 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 40 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:37,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 319 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:37,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-17 11:55:37,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 350. [2025-03-17 11:55:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 287 states have (on average 1.480836236933798) internal successors, (425), 337 states have internal predecessors, (425), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 11:55:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 443 transitions. [2025-03-17 11:55:37,189 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 443 transitions. Word has length 31 [2025-03-17 11:55:37,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:37,189 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 443 transitions. [2025-03-17 11:55:37,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:37,189 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 443 transitions. [2025-03-17 11:55:37,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 11:55:37,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:37,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:37,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:55:37,190 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:37,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:37,190 INFO L85 PathProgramCache]: Analyzing trace with hash -684527415, now seen corresponding path program 1 times [2025-03-17 11:55:37,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:37,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218595198] [2025-03-17 11:55:37,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:37,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:37,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:55:37,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:55:37,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:37,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:37,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:37,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218595198] [2025-03-17 11:55:37,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218595198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:37,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:37,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:55:37,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094103033] [2025-03-17 11:55:37,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:37,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:55:37,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:37,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:55:37,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:37,243 INFO L87 Difference]: Start difference. First operand 350 states and 443 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:37,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:37,333 INFO L93 Difference]: Finished difference Result 389 states and 489 transitions. [2025-03-17 11:55:37,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:55:37,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-03-17 11:55:37,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:37,334 INFO L225 Difference]: With dead ends: 389 [2025-03-17 11:55:37,334 INFO L226 Difference]: Without dead ends: 389 [2025-03-17 11:55:37,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:37,335 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 81 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:37,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 349 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:37,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-17 11:55:37,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 347. [2025-03-17 11:55:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 287 states have (on average 1.4599303135888502) internal successors, (419), 334 states have internal predecessors, (419), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 11:55:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 437 transitions. [2025-03-17 11:55:37,341 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 437 transitions. Word has length 33 [2025-03-17 11:55:37,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:37,341 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 437 transitions. [2025-03-17 11:55:37,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 437 transitions. [2025-03-17 11:55:37,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 11:55:37,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:37,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:37,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:55:37,342 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:37,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:37,342 INFO L85 PathProgramCache]: Analyzing trace with hash -684527414, now seen corresponding path program 1 times [2025-03-17 11:55:37,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:37,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88706890] [2025-03-17 11:55:37,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:37,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:37,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:55:37,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:55:37,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:37,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:37,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:37,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88706890] [2025-03-17 11:55:37,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88706890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:37,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:37,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:55:37,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127834012] [2025-03-17 11:55:37,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:37,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:55:37,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:37,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:55:37,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:55:37,452 INFO L87 Difference]: Start difference. First operand 347 states and 437 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:37,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:37,597 INFO L93 Difference]: Finished difference Result 388 states and 487 transitions. [2025-03-17 11:55:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:55:37,597 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-03-17 11:55:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:37,599 INFO L225 Difference]: With dead ends: 388 [2025-03-17 11:55:37,599 INFO L226 Difference]: Without dead ends: 388 [2025-03-17 11:55:37,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:55:37,599 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 279 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:37,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 412 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:37,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-17 11:55:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 346. [2025-03-17 11:55:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 287 states have (on average 1.4529616724738676) internal successors, (417), 333 states have internal predecessors, (417), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 11:55:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 435 transitions. [2025-03-17 11:55:37,606 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 435 transitions. Word has length 33 [2025-03-17 11:55:37,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:37,606 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 435 transitions. [2025-03-17 11:55:37,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 435 transitions. [2025-03-17 11:55:37,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 11:55:37,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:37,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:37,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:55:37,607 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:37,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:37,607 INFO L85 PathProgramCache]: Analyzing trace with hash -684527386, now seen corresponding path program 1 times [2025-03-17 11:55:37,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:37,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064658757] [2025-03-17 11:55:37,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:37,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:37,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:55:37,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:55:37,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:37,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:37,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:37,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:37,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064658757] [2025-03-17 11:55:37,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064658757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:37,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:37,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:55:37,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141865017] [2025-03-17 11:55:37,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:37,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:55:37,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:37,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:55:37,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:55:37,757 INFO L87 Difference]: Start difference. First operand 346 states and 435 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:38,006 INFO L93 Difference]: Finished difference Result 395 states and 460 transitions. [2025-03-17 11:55:38,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:55:38,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-03-17 11:55:38,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:38,008 INFO L225 Difference]: With dead ends: 395 [2025-03-17 11:55:38,008 INFO L226 Difference]: Without dead ends: 395 [2025-03-17 11:55:38,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:55:38,008 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 161 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:38,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 360 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:38,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-17 11:55:38,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 346. [2025-03-17 11:55:38,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 287 states have (on average 1.4459930313588851) internal successors, (415), 333 states have internal predecessors, (415), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 11:55:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 433 transitions. [2025-03-17 11:55:38,016 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 433 transitions. Word has length 33 [2025-03-17 11:55:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:38,017 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 433 transitions. [2025-03-17 11:55:38,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 433 transitions. [2025-03-17 11:55:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 11:55:38,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:38,017 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:38,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:55:38,017 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:38,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:38,018 INFO L85 PathProgramCache]: Analyzing trace with hash 192866168, now seen corresponding path program 1 times [2025-03-17 11:55:38,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:38,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372132551] [2025-03-17 11:55:38,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:38,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:38,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 11:55:38,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:55:38,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:38,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:38,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:38,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372132551] [2025-03-17 11:55:38,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372132551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:38,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:38,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 11:55:38,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120362105] [2025-03-17 11:55:38,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:38,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:55:38,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:38,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:55:38,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:55:38,725 INFO L87 Difference]: Start difference. First operand 346 states and 433 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:39,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:39,323 INFO L93 Difference]: Finished difference Result 376 states and 464 transitions. [2025-03-17 11:55:39,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:55:39,323 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-17 11:55:39,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:39,325 INFO L225 Difference]: With dead ends: 376 [2025-03-17 11:55:39,325 INFO L226 Difference]: Without dead ends: 376 [2025-03-17 11:55:39,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:55:39,325 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 91 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:39,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 953 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:55:39,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-17 11:55:39,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 367. [2025-03-17 11:55:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 308 states have (on average 1.4188311688311688) internal successors, (437), 354 states have internal predecessors, (437), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 11:55:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 455 transitions. [2025-03-17 11:55:39,332 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 455 transitions. Word has length 47 [2025-03-17 11:55:39,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:39,332 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 455 transitions. [2025-03-17 11:55:39,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 455 transitions. [2025-03-17 11:55:39,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 11:55:39,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:39,333 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:39,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 11:55:39,334 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:39,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:39,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2093797478, now seen corresponding path program 1 times [2025-03-17 11:55:39,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:39,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123029594] [2025-03-17 11:55:39,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:39,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:39,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 11:55:39,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 11:55:39,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:39,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:39,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:39,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123029594] [2025-03-17 11:55:39,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123029594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:39,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:39,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 11:55:39,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656422722] [2025-03-17 11:55:39,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:39,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:55:39,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:39,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:55:39,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:55:39,852 INFO L87 Difference]: Start difference. First operand 367 states and 455 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:40,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:40,347 INFO L93 Difference]: Finished difference Result 463 states and 529 transitions. [2025-03-17 11:55:40,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:55:40,348 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-17 11:55:40,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:40,349 INFO L225 Difference]: With dead ends: 463 [2025-03-17 11:55:40,349 INFO L226 Difference]: Without dead ends: 463 [2025-03-17 11:55:40,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:55:40,349 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 264 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:40,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 897 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:55:40,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-17 11:55:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 396. [2025-03-17 11:55:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 337 states have (on average 1.3976261127596439) internal successors, (471), 383 states have internal predecessors, (471), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 11:55:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 489 transitions. [2025-03-17 11:55:40,357 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 489 transitions. Word has length 48 [2025-03-17 11:55:40,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:40,357 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 489 transitions. [2025-03-17 11:55:40,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 489 transitions. [2025-03-17 11:55:40,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 11:55:40,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:40,357 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:40,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 11:55:40,357 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:40,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash 273802227, now seen corresponding path program 1 times [2025-03-17 11:55:40,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:40,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475166523] [2025-03-17 11:55:40,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:40,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 11:55:40,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 11:55:40,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:40,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:41,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:41,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475166523] [2025-03-17 11:55:41,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475166523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:41,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:41,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 11:55:41,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104234876] [2025-03-17 11:55:41,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:41,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 11:55:41,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:41,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 11:55:41,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-17 11:55:41,063 INFO L87 Difference]: Start difference. First operand 396 states and 489 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:41,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:41,764 INFO L93 Difference]: Finished difference Result 463 states and 532 transitions. [2025-03-17 11:55:41,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:55:41,764 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-17 11:55:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:41,765 INFO L225 Difference]: With dead ends: 463 [2025-03-17 11:55:41,765 INFO L226 Difference]: Without dead ends: 463 [2025-03-17 11:55:41,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:55:41,766 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 279 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:41,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1200 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:55:41,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-17 11:55:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 391. [2025-03-17 11:55:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 332 states have (on average 1.4126506024096386) internal successors, (469), 378 states have internal predecessors, (469), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 11:55:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 487 transitions. [2025-03-17 11:55:41,772 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 487 transitions. Word has length 48 [2025-03-17 11:55:41,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:41,772 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 487 transitions. [2025-03-17 11:55:41,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 487 transitions. [2025-03-17 11:55:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:55:41,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:41,773 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:41,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 11:55:41,773 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:41,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:41,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1510279262, now seen corresponding path program 1 times [2025-03-17 11:55:41,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:41,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142180898] [2025-03-17 11:55:41,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:41,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:41,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:55:41,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:41,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:41,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:42,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:42,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142180898] [2025-03-17 11:55:42,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142180898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:42,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:42,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 11:55:42,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404551027] [2025-03-17 11:55:42,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:42,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 11:55:42,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:42,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 11:55:42,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-17 11:55:42,407 INFO L87 Difference]: Start difference. First operand 391 states and 487 transitions. Second operand has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:43,033 INFO L93 Difference]: Finished difference Result 693 states and 850 transitions. [2025-03-17 11:55:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 11:55:43,033 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-17 11:55:43,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:43,035 INFO L225 Difference]: With dead ends: 693 [2025-03-17 11:55:43,035 INFO L226 Difference]: Without dead ends: 693 [2025-03-17 11:55:43,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-03-17 11:55:43,036 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 334 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:43,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1551 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:55:43,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-17 11:55:43,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 500. [2025-03-17 11:55:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 433 states have (on average 1.4249422632794457) internal successors, (617), 483 states have internal predecessors, (617), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2025-03-17 11:55:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 647 transitions. [2025-03-17 11:55:43,045 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 647 transitions. Word has length 49 [2025-03-17 11:55:43,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:43,045 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 647 transitions. [2025-03-17 11:55:43,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:43,045 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 647 transitions. [2025-03-17 11:55:43,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:55:43,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:43,047 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:43,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 11:55:43,047 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:43,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:43,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1510279261, now seen corresponding path program 1 times [2025-03-17 11:55:43,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:43,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785334171] [2025-03-17 11:55:43,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:43,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:43,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:55:43,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:43,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:43,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:43,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:43,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785334171] [2025-03-17 11:55:43,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785334171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:43,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:43,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 11:55:43,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184352957] [2025-03-17 11:55:43,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:43,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 11:55:43,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:43,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 11:55:43,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:55:43,602 INFO L87 Difference]: Start difference. First operand 500 states and 647 transitions. Second operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:44,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:44,178 INFO L93 Difference]: Finished difference Result 730 states and 914 transitions. [2025-03-17 11:55:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 11:55:44,179 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-17 11:55:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:44,181 INFO L225 Difference]: With dead ends: 730 [2025-03-17 11:55:44,181 INFO L226 Difference]: Without dead ends: 730 [2025-03-17 11:55:44,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2025-03-17 11:55:44,181 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 525 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:44,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1084 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:55:44,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2025-03-17 11:55:44,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 528. [2025-03-17 11:55:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 458 states have (on average 1.4235807860262009) internal successors, (652), 509 states have internal predecessors, (652), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-03-17 11:55:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 688 transitions. [2025-03-17 11:55:44,190 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 688 transitions. Word has length 49 [2025-03-17 11:55:44,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:44,191 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 688 transitions. [2025-03-17 11:55:44,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 688 transitions. [2025-03-17 11:55:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:55:44,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:44,193 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:44,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 11:55:44,193 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:44,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:44,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1510278910, now seen corresponding path program 1 times [2025-03-17 11:55:44,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:44,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983962988] [2025-03-17 11:55:44,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:44,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:44,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:55:44,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:44,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:44,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:44,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:44,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:44,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983962988] [2025-03-17 11:55:44,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983962988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:44,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:44,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 11:55:44,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717637451] [2025-03-17 11:55:44,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:44,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 11:55:44,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:44,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 11:55:44,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:55:44,588 INFO L87 Difference]: Start difference. First operand 528 states and 688 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:44,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:44,969 INFO L93 Difference]: Finished difference Result 722 states and 891 transitions. [2025-03-17 11:55:44,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:55:44,970 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-17 11:55:44,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:44,971 INFO L225 Difference]: With dead ends: 722 [2025-03-17 11:55:44,971 INFO L226 Difference]: Without dead ends: 722 [2025-03-17 11:55:44,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:55:44,972 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 385 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:44,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1603 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:55:44,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-03-17 11:55:44,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 528. [2025-03-17 11:55:44,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 458 states have (on average 1.4192139737991267) internal successors, (650), 509 states have internal predecessors, (650), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2025-03-17 11:55:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 686 transitions. [2025-03-17 11:55:44,981 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 686 transitions. Word has length 49 [2025-03-17 11:55:44,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:44,981 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 686 transitions. [2025-03-17 11:55:44,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:44,981 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 686 transitions. [2025-03-17 11:55:44,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:55:44,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:44,986 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:44,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 11:55:44,986 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:44,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:44,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1511202783, now seen corresponding path program 1 times [2025-03-17 11:55:44,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:44,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105459840] [2025-03-17 11:55:44,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:44,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:44,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:55:45,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:45,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:45,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:45,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:45,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105459840] [2025-03-17 11:55:45,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105459840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:45,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557218116] [2025-03-17 11:55:45,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:45,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:45,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:45,928 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:55:45,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:55:46,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:55:46,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:46,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:46,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:46,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-17 11:55:46,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:46,129 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-17 11:55:46,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:55:46,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 11:55:46,747 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:55:46,748 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-17 11:55:46,753 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:55:46,754 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-17 11:55:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:46,812 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:55:46,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557218116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:46,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:55:46,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 25 [2025-03-17 11:55:46,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558950932] [2025-03-17 11:55:46,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:46,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:55:46,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:46,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:55:46,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2025-03-17 11:55:46,814 INFO L87 Difference]: Start difference. First operand 528 states and 686 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:47,273 INFO L93 Difference]: Finished difference Result 913 states and 1196 transitions. [2025-03-17 11:55:47,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:55:47,274 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-17 11:55:47,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:47,276 INFO L225 Difference]: With dead ends: 913 [2025-03-17 11:55:47,276 INFO L226 Difference]: Without dead ends: 913 [2025-03-17 11:55:47,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:55:47,277 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 253 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:47,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 908 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:55:47,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-03-17 11:55:47,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 713. [2025-03-17 11:55:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 623 states have (on average 1.4542536115569824) internal successors, (906), 684 states have internal predecessors, (906), 22 states have call successors, (22), 11 states have call predecessors, (22), 22 states have return successors, (44), 17 states have call predecessors, (44), 22 states have call successors, (44) [2025-03-17 11:55:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 972 transitions. [2025-03-17 11:55:47,293 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 972 transitions. Word has length 49 [2025-03-17 11:55:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:47,294 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 972 transitions. [2025-03-17 11:55:47,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 972 transitions. [2025-03-17 11:55:47,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:55:47,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:47,294 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:47,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:55:47,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-17 11:55:47,499 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:47,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:47,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1511202782, now seen corresponding path program 1 times [2025-03-17 11:55:47,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:47,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341387918] [2025-03-17 11:55:47,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:47,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:47,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:55:47,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:47,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:47,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:48,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:48,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341387918] [2025-03-17 11:55:48,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341387918] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:48,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866314955] [2025-03-17 11:55:48,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:48,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:48,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:48,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:55:48,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:55:48,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:55:48,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:48,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:48,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:48,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 11:55:48,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:48,608 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 19 treesize of output 1 [2025-03-17 11:55:48,739 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:55:48,740 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-17 11:55:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:48,762 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:55:48,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866314955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:48,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:55:48,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 24 [2025-03-17 11:55:48,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166694] [2025-03-17 11:55:48,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:48,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:55:48,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:48,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:55:48,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:55:48,763 INFO L87 Difference]: Start difference. First operand 713 states and 972 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:49,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:49,110 INFO L93 Difference]: Finished difference Result 953 states and 1272 transitions. [2025-03-17 11:55:49,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:55:49,111 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-17 11:55:49,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:49,113 INFO L225 Difference]: With dead ends: 953 [2025-03-17 11:55:49,113 INFO L226 Difference]: Without dead ends: 953 [2025-03-17 11:55:49,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:55:49,114 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 332 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:49,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 837 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:55:49,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-17 11:55:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 741. [2025-03-17 11:55:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 647 states have (on average 1.454404945904173) internal successors, (941), 710 states have internal predecessors, (941), 24 states have call successors, (24), 12 states have call predecessors, (24), 24 states have return successors, (48), 18 states have call predecessors, (48), 24 states have call successors, (48) [2025-03-17 11:55:49,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1013 transitions. [2025-03-17 11:55:49,126 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1013 transitions. Word has length 49 [2025-03-17 11:55:49,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:49,126 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1013 transitions. [2025-03-17 11:55:49,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1013 transitions. [2025-03-17 11:55:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:55:49,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:49,127 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:49,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:55:49,327 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,SelfDestructingSolverStorable39 [2025-03-17 11:55:49,328 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:49,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:49,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1511202431, now seen corresponding path program 1 times [2025-03-17 11:55:49,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:49,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148147345] [2025-03-17 11:55:49,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:49,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:49,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:55:49,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:49,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:49,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:49,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:49,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148147345] [2025-03-17 11:55:49,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148147345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:49,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:49,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:55:49,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529845635] [2025-03-17 11:55:49,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:49,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:55:49,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:49,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:55:49,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:49,442 INFO L87 Difference]: Start difference. First operand 741 states and 1013 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:49,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:49,604 INFO L93 Difference]: Finished difference Result 1113 states and 1502 transitions. [2025-03-17 11:55:49,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:55:49,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-17 11:55:49,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:49,607 INFO L225 Difference]: With dead ends: 1113 [2025-03-17 11:55:49,607 INFO L226 Difference]: Without dead ends: 1113 [2025-03-17 11:55:49,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:55:49,608 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 158 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:49,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 988 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:49,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2025-03-17 11:55:49,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 907. [2025-03-17 11:55:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 793 states have (on average 1.4691046658259772) internal successors, (1165), 866 states have internal predecessors, (1165), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2025-03-17 11:55:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1267 transitions. [2025-03-17 11:55:49,625 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1267 transitions. Word has length 49 [2025-03-17 11:55:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:49,627 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1267 transitions. [2025-03-17 11:55:49,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1267 transitions. [2025-03-17 11:55:49,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:55:49,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:49,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:49,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-17 11:55:49,628 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:49,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:49,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1476822759, now seen corresponding path program 1 times [2025-03-17 11:55:49,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:49,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630255014] [2025-03-17 11:55:49,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:49,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:49,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:55:49,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:49,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:49,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:49,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:49,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630255014] [2025-03-17 11:55:49,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630255014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:49,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:49,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:55:49,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007051415] [2025-03-17 11:55:49,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:49,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:55:49,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:49,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:55:49,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:55:49,867 INFO L87 Difference]: Start difference. First operand 907 states and 1267 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:50,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:50,187 INFO L93 Difference]: Finished difference Result 1285 states and 1763 transitions. [2025-03-17 11:55:50,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:55:50,188 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-17 11:55:50,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:50,191 INFO L225 Difference]: With dead ends: 1285 [2025-03-17 11:55:50,191 INFO L226 Difference]: Without dead ends: 1285 [2025-03-17 11:55:50,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:55:50,191 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 361 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:50,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 917 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:55:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2025-03-17 11:55:50,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 983. [2025-03-17 11:55:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 861 states have (on average 1.4761904761904763) internal successors, (1271), 938 states have internal predecessors, (1271), 38 states have call successors, (38), 19 states have call predecessors, (38), 38 states have return successors, (76), 25 states have call predecessors, (76), 38 states have call successors, (76) [2025-03-17 11:55:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1385 transitions. [2025-03-17 11:55:50,212 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1385 transitions. Word has length 49 [2025-03-17 11:55:50,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:50,212 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1385 transitions. [2025-03-17 11:55:50,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:50,212 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1385 transitions. [2025-03-17 11:55:50,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:55:50,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:50,213 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:50,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-17 11:55:50,213 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:50,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:50,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1476822760, now seen corresponding path program 1 times [2025-03-17 11:55:50,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:50,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761836891] [2025-03-17 11:55:50,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:50,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:50,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:55:50,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:50,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:50,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:50,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:50,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761836891] [2025-03-17 11:55:50,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761836891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:50,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:50,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:55:50,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388781154] [2025-03-17 11:55:50,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:50,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:55:50,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:50,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:55:50,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:55:50,372 INFO L87 Difference]: Start difference. First operand 983 states and 1385 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:50,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:50,655 INFO L93 Difference]: Finished difference Result 1301 states and 1811 transitions. [2025-03-17 11:55:50,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:55:50,655 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-17 11:55:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:50,658 INFO L225 Difference]: With dead ends: 1301 [2025-03-17 11:55:50,658 INFO L226 Difference]: Without dead ends: 1301 [2025-03-17 11:55:50,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-17 11:55:50,659 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 398 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:50,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 791 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2025-03-17 11:55:50,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1011. [2025-03-17 11:55:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 885 states have (on average 1.4757062146892654) internal successors, (1306), 964 states have internal predecessors, (1306), 40 states have call successors, (40), 20 states have call predecessors, (40), 40 states have return successors, (80), 26 states have call predecessors, (80), 40 states have call successors, (80) [2025-03-17 11:55:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1426 transitions. [2025-03-17 11:55:50,674 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1426 transitions. Word has length 49 [2025-03-17 11:55:50,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:50,675 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1426 transitions. [2025-03-17 11:55:50,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1426 transitions. [2025-03-17 11:55:50,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:55:50,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:50,675 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:50,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-17 11:55:50,675 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:50,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:50,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1476823111, now seen corresponding path program 1 times [2025-03-17 11:55:50,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:50,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023226403] [2025-03-17 11:55:50,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:50,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:50,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:55:50,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:50,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:50,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:50,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:50,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023226403] [2025-03-17 11:55:50,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023226403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:50,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:50,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:55:50,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748225395] [2025-03-17 11:55:50,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:50,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:55:50,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:50,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:55:50,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:55:50,838 INFO L87 Difference]: Start difference. First operand 1011 states and 1426 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:51,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:51,025 INFO L93 Difference]: Finished difference Result 1312 states and 1801 transitions. [2025-03-17 11:55:51,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:55:51,026 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-17 11:55:51,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:51,028 INFO L225 Difference]: With dead ends: 1312 [2025-03-17 11:55:51,028 INFO L226 Difference]: Without dead ends: 1312 [2025-03-17 11:55:51,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:55:51,029 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 388 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:51,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1041 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:55:51,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2025-03-17 11:55:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 788. [2025-03-17 11:55:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 686 states have (on average 1.4708454810495626) internal successors, (1009), 753 states have internal predecessors, (1009), 28 states have call successors, (28), 14 states have call predecessors, (28), 28 states have return successors, (56), 20 states have call predecessors, (56), 28 states have call successors, (56) [2025-03-17 11:55:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1093 transitions. [2025-03-17 11:55:51,039 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1093 transitions. Word has length 49 [2025-03-17 11:55:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:51,039 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1093 transitions. [2025-03-17 11:55:51,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1093 transitions. [2025-03-17 11:55:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:55:51,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:51,040 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:51,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-17 11:55:51,040 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:51,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:51,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1475899238, now seen corresponding path program 1 times [2025-03-17 11:55:51,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:51,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166543203] [2025-03-17 11:55:51,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:51,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:51,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:55:51,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:51,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:51,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:51,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:51,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166543203] [2025-03-17 11:55:51,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166543203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:51,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098303330] [2025-03-17 11:55:51,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:51,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:51,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:51,384 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:55:51,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:55:51,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:55:51,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:51,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:51,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:51,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-17 11:55:51,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:51,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:55:51,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:55:51,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2025-03-17 11:55:51,859 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 31 treesize of output 26 [2025-03-17 11:55:52,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2025-03-17 11:55:52,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-03-17 11:55:52,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:52,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:55:52,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098303330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:52,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:55:52,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 23 [2025-03-17 11:55:52,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192941460] [2025-03-17 11:55:52,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:52,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:55:52,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:52,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:55:52,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2025-03-17 11:55:52,076 INFO L87 Difference]: Start difference. First operand 788 states and 1093 transitions. Second operand has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:52,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:52,754 INFO L93 Difference]: Finished difference Result 1029 states and 1400 transitions. [2025-03-17 11:55:52,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:55:52,754 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-17 11:55:52,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:52,757 INFO L225 Difference]: With dead ends: 1029 [2025-03-17 11:55:52,758 INFO L226 Difference]: Without dead ends: 1029 [2025-03-17 11:55:52,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:55:52,759 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 255 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:52,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 2120 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:55:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-03-17 11:55:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 947. [2025-03-17 11:55:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 833 states have (on average 1.4717887154861944) internal successors, (1226), 906 states have internal predecessors, (1226), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2025-03-17 11:55:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1328 transitions. [2025-03-17 11:55:52,771 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1328 transitions. Word has length 49 [2025-03-17 11:55:52,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:52,772 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1328 transitions. [2025-03-17 11:55:52,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1328 transitions. [2025-03-17 11:55:52,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:55:52,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:52,773 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:52,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 11:55:52,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:52,974 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:52,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:52,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1475899239, now seen corresponding path program 1 times [2025-03-17 11:55:52,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:52,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275914479] [2025-03-17 11:55:52,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:52,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:52,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:55:52,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:52,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:52,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:53,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:53,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275914479] [2025-03-17 11:55:53,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275914479] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:53,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356159750] [2025-03-17 11:55:53,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:53,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:53,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:53,320 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:55:53,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:55:53,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:55:53,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:53,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:53,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:53,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-17 11:55:53,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:53,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:55:53,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:55:53,703 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 29 treesize of output 22 [2025-03-17 11:55:53,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:55:53,815 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 32 treesize of output 12 [2025-03-17 11:55:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:53,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:55:53,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356159750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:53,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:55:53,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 23 [2025-03-17 11:55:53,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502545441] [2025-03-17 11:55:53,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:53,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 11:55:53,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:53,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 11:55:53,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2025-03-17 11:55:53,820 INFO L87 Difference]: Start difference. First operand 947 states and 1328 transitions. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:54,473 INFO L93 Difference]: Finished difference Result 1254 states and 1715 transitions. [2025-03-17 11:55:54,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 11:55:54,474 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-17 11:55:54,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:54,477 INFO L225 Difference]: With dead ends: 1254 [2025-03-17 11:55:54,477 INFO L226 Difference]: Without dead ends: 1254 [2025-03-17 11:55:54,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2025-03-17 11:55:54,477 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 283 mSDsluCounter, 2021 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2292 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:54,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 2292 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:55:54,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-03-17 11:55:54,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 951. [2025-03-17 11:55:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 837 states have (on average 1.4719235364396654) internal successors, (1232), 910 states have internal predecessors, (1232), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2025-03-17 11:55:54,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1334 transitions. [2025-03-17 11:55:54,488 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1334 transitions. Word has length 49 [2025-03-17 11:55:54,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:54,489 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1334 transitions. [2025-03-17 11:55:54,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:54,489 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1334 transitions. [2025-03-17 11:55:54,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:55:54,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:54,489 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:54,495 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-17 11:55:54,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:54,694 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:54,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:54,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1475899590, now seen corresponding path program 1 times [2025-03-17 11:55:54,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:54,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030548008] [2025-03-17 11:55:54,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:54,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:54,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:55:54,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:54,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:54,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:54,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:54,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:54,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030548008] [2025-03-17 11:55:54,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030548008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:54,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069522893] [2025-03-17 11:55:54,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:54,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:54,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:54,966 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:55:54,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:55:55,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:55:55,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:55:55,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:55,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:55,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 11:55:55,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:55,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 11:55:55,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-17 11:55:55,390 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-17 11:55:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:55,393 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:55:55,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069522893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:55,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:55:55,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 19 [2025-03-17 11:55:55,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471338366] [2025-03-17 11:55:55,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:55,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:55:55,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:55,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:55:55,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:55:55,394 INFO L87 Difference]: Start difference. First operand 951 states and 1334 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:55,708 INFO L93 Difference]: Finished difference Result 1263 states and 1718 transitions. [2025-03-17 11:55:55,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:55:55,708 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-17 11:55:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:55,718 INFO L225 Difference]: With dead ends: 1263 [2025-03-17 11:55:55,719 INFO L226 Difference]: Without dead ends: 1263 [2025-03-17 11:55:55,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2025-03-17 11:55:55,719 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 315 mSDsluCounter, 1695 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:55,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1996 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:55:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2025-03-17 11:55:55,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 955. [2025-03-17 11:55:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 841 states have (on average 1.4708680142687276) internal successors, (1237), 914 states have internal predecessors, (1237), 34 states have call successors, (34), 17 states have call predecessors, (34), 34 states have return successors, (68), 23 states have call predecessors, (68), 34 states have call successors, (68) [2025-03-17 11:55:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1339 transitions. [2025-03-17 11:55:55,740 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1339 transitions. Word has length 49 [2025-03-17 11:55:55,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:55,740 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1339 transitions. [2025-03-17 11:55:55,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1339 transitions. [2025-03-17 11:55:55,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 11:55:55,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:55,741 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:55,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 11:55:55,941 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,SelfDestructingSolverStorable46 [2025-03-17 11:55:55,942 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:55,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:55,943 INFO L85 PathProgramCache]: Analyzing trace with hash -999961545, now seen corresponding path program 1 times [2025-03-17 11:55:55,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:55,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046826764] [2025-03-17 11:55:55,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:55,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:55,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:55,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:55,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:55,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:56,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:56,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:56,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046826764] [2025-03-17 11:55:56,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046826764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:56,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944070599] [2025-03-17 11:55:56,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:56,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:56,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:56,472 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:55:56,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 11:55:56,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:55:56,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:55:56,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:56,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:56,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-17 11:55:56,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:56,796 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 19 treesize of output 1 [2025-03-17 11:55:56,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:55:56,832 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 25 treesize of output 13 [2025-03-17 11:55:56,898 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 19 treesize of output 7 [2025-03-17 11:55:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:56,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:55:56,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944070599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:56,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:55:56,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 27 [2025-03-17 11:55:56,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141455326] [2025-03-17 11:55:56,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:56,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 11:55:56,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:56,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 11:55:56,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2025-03-17 11:55:56,933 INFO L87 Difference]: Start difference. First operand 955 states and 1339 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:57,245 INFO L93 Difference]: Finished difference Result 1265 states and 1719 transitions. [2025-03-17 11:55:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:55:57,246 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-17 11:55:57,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:57,249 INFO L225 Difference]: With dead ends: 1265 [2025-03-17 11:55:57,249 INFO L226 Difference]: Without dead ends: 1265 [2025-03-17 11:55:57,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=998, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 11:55:57,253 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 313 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:57,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1975 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2025-03-17 11:55:57,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 926. [2025-03-17 11:55:57,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 816 states have (on average 1.474264705882353) internal successors, (1203), 887 states have internal predecessors, (1203), 32 states have call successors, (32), 16 states have call predecessors, (32), 32 states have return successors, (64), 22 states have call predecessors, (64), 32 states have call successors, (64) [2025-03-17 11:55:57,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1299 transitions. [2025-03-17 11:55:57,263 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1299 transitions. Word has length 51 [2025-03-17 11:55:57,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:57,264 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1299 transitions. [2025-03-17 11:55:57,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1299 transitions. [2025-03-17 11:55:57,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 11:55:57,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:57,265 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:57,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 11:55:57,465 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,SelfDestructingSolverStorable47 [2025-03-17 11:55:57,465 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:57,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:57,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1347945392, now seen corresponding path program 1 times [2025-03-17 11:55:57,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:57,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142540786] [2025-03-17 11:55:57,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:57,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:57,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 11:55:57,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:55:57,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:57,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:57,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:57,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142540786] [2025-03-17 11:55:57,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142540786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:57,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:57,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 11:55:57,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35593968] [2025-03-17 11:55:57,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:57,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 11:55:57,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:57,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 11:55:57,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:55:57,816 INFO L87 Difference]: Start difference. First operand 926 states and 1299 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:58,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:58,093 INFO L93 Difference]: Finished difference Result 1364 states and 1870 transitions. [2025-03-17 11:55:58,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 11:55:58,094 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-03-17 11:55:58,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:58,096 INFO L225 Difference]: With dead ends: 1364 [2025-03-17 11:55:58,096 INFO L226 Difference]: Without dead ends: 1364 [2025-03-17 11:55:58,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:55:58,097 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 489 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:58,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 1032 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-03-17 11:55:58,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1140. [2025-03-17 11:55:58,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1006 states have (on average 1.4811133200795228) internal successors, (1490), 1089 states have internal predecessors, (1490), 44 states have call successors, (44), 22 states have call predecessors, (44), 44 states have return successors, (88), 28 states have call predecessors, (88), 44 states have call successors, (88) [2025-03-17 11:55:58,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1622 transitions. [2025-03-17 11:55:58,108 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1622 transitions. Word has length 52 [2025-03-17 11:55:58,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:58,108 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1622 transitions. [2025-03-17 11:55:58,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:58,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1622 transitions. [2025-03-17 11:55:58,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 11:55:58,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:58,109 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:58,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-17 11:55:58,109 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:58,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:58,109 INFO L85 PathProgramCache]: Analyzing trace with hash 394864943, now seen corresponding path program 1 times [2025-03-17 11:55:58,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:58,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537778419] [2025-03-17 11:55:58,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:58,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:58,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 11:55:58,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:55:58,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:58,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:58,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:58,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:58,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537778419] [2025-03-17 11:55:58,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537778419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:58,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:58,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:55:58,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649387163] [2025-03-17 11:55:58,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:58,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:55:58,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:58,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:55:58,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:55:58,241 INFO L87 Difference]: Start difference. First operand 1140 states and 1622 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:58,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:58,495 INFO L93 Difference]: Finished difference Result 1473 states and 2047 transitions. [2025-03-17 11:55:58,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:55:58,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-03-17 11:55:58,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:58,502 INFO L225 Difference]: With dead ends: 1473 [2025-03-17 11:55:58,502 INFO L226 Difference]: Without dead ends: 1473 [2025-03-17 11:55:58,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:55:58,503 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 155 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:58,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 747 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:58,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2025-03-17 11:55:58,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1240. [2025-03-17 11:55:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1094 states have (on average 1.4862888482632541) internal successors, (1626), 1183 states have internal predecessors, (1626), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 31 states have call predecessors, (100), 50 states have call successors, (100) [2025-03-17 11:55:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1776 transitions. [2025-03-17 11:55:58,525 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1776 transitions. Word has length 52 [2025-03-17 11:55:58,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:58,526 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1776 transitions. [2025-03-17 11:55:58,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:58,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1776 transitions. [2025-03-17 11:55:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 11:55:58,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:58,526 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:58,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-17 11:55:58,527 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:58,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:58,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1618120117, now seen corresponding path program 1 times [2025-03-17 11:55:58,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:58,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817010866] [2025-03-17 11:55:58,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:58,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:58,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 11:55:58,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:55:58,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:58,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:58,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:58,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817010866] [2025-03-17 11:55:58,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817010866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:58,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:55:58,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:55:58,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367721100] [2025-03-17 11:55:58,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:58,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:55:58,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:58,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:55:58,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:55:58,674 INFO L87 Difference]: Start difference. First operand 1240 states and 1776 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:55:58,876 INFO L93 Difference]: Finished difference Result 1574 states and 2198 transitions. [2025-03-17 11:55:58,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:55:58,876 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-03-17 11:55:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:55:58,879 INFO L225 Difference]: With dead ends: 1574 [2025-03-17 11:55:58,879 INFO L226 Difference]: Without dead ends: 1574 [2025-03-17 11:55:58,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:55:58,879 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 352 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:55:58,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 823 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:55:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2025-03-17 11:55:58,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1038. [2025-03-17 11:55:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 916 states have (on average 1.4781659388646289) internal successors, (1354), 993 states have internal predecessors, (1354), 38 states have call successors, (38), 19 states have call predecessors, (38), 38 states have return successors, (76), 25 states have call predecessors, (76), 38 states have call successors, (76) [2025-03-17 11:55:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1468 transitions. [2025-03-17 11:55:58,891 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1468 transitions. Word has length 52 [2025-03-17 11:55:58,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:55:58,891 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1468 transitions. [2025-03-17 11:55:58,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:55:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1468 transitions. [2025-03-17 11:55:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 11:55:58,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:55:58,892 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:55:58,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-17 11:55:58,893 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:55:58,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:55:58,893 INFO L85 PathProgramCache]: Analyzing trace with hash -934036844, now seen corresponding path program 1 times [2025-03-17 11:55:58,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:55:58,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991856541] [2025-03-17 11:55:58,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:58,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:55:58,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 11:55:58,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:55:58,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:58,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:59,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:59,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:55:59,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991856541] [2025-03-17 11:55:59,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991856541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:55:59,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874151370] [2025-03-17 11:55:59,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:55:59,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:55:59,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:55:59,154 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:55:59,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 11:55:59,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 11:55:59,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:55:59,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:55:59,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:55:59,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 11:55:59,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:55:59,582 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 19 treesize of output 1 [2025-03-17 11:55:59,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:55:59,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 11:55:59,667 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 21 treesize of output 9 [2025-03-17 11:55:59,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:55:59,672 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:55:59,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874151370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:55:59,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:55:59,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2025-03-17 11:55:59,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323535227] [2025-03-17 11:55:59,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:55:59,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:55:59,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:55:59,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:55:59,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:55:59,674 INFO L87 Difference]: Start difference. First operand 1038 states and 1468 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:56:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:56:00,012 INFO L93 Difference]: Finished difference Result 1266 states and 1723 transitions. [2025-03-17 11:56:00,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:56:00,012 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-03-17 11:56:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:56:00,014 INFO L225 Difference]: With dead ends: 1266 [2025-03-17 11:56:00,014 INFO L226 Difference]: Without dead ends: 1266 [2025-03-17 11:56:00,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2025-03-17 11:56:00,015 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 288 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:56:00,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1844 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:56:00,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2025-03-17 11:56:00,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 930. [2025-03-17 11:56:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 820 states have (on average 1.475609756097561) internal successors, (1210), 891 states have internal predecessors, (1210), 32 states have call successors, (32), 16 states have call predecessors, (32), 32 states have return successors, (64), 22 states have call predecessors, (64), 32 states have call successors, (64) [2025-03-17 11:56:00,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1306 transitions. [2025-03-17 11:56:00,024 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1306 transitions. Word has length 52 [2025-03-17 11:56:00,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:56:00,024 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1306 transitions. [2025-03-17 11:56:00,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 11:56:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1306 transitions. [2025-03-17 11:56:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 11:56:00,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:56:00,025 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:56:00,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 11:56:00,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:56:00,225 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-17 11:56:00,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:56:00,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1740116919, now seen corresponding path program 1 times [2025-03-17 11:56:00,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:56:00,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264463426] [2025-03-17 11:56:00,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:00,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:56:00,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:56:00,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:56:00,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:00,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:56:00,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:56:00,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264463426] [2025-03-17 11:56:00,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264463426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:56:00,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239903731] [2025-03-17 11:56:00,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:56:00,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:56:00,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:56:00,734 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:56:00,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 11:56:00,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:56:00,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:56:00,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:56:00,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:56:00,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 11:56:00,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:56:00,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:56:01,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-03-17 11:56:01,095 INFO L349 Elim1Store]: treesize reduction 44, result has 37.1 percent of original size [2025-03-17 11:56:01,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2025-03-17 11:56:05,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:56:05,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 12 [2025-03-17 11:56:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:56:05,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:56:05,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239903731] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:56:05,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:56:05,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 21 [2025-03-17 11:56:05,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038895237] [2025-03-17 11:56:05,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:56:05,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 11:56:05,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:56:05,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 11:56:05,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=521, Unknown=1, NotChecked=0, Total=600 [2025-03-17 11:56:05,322 INFO L87 Difference]: Start difference. First operand 930 states and 1306 transitions. Second operand has 22 states, 21 states have (on average 4.571428571428571) internal successors, (96), 20 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:56:13,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:56:25,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:56:29,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:56:34,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:56:38,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:56:42,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:56:46,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:56:50,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]