./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-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-?-e2fb8be-m [2025-03-08 22:48:17,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:48:17,420 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:48:17,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:48:17,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:48:17,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:48:17,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:48:17,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:48:17,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:48:17,452 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:48:17,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:48:17,452 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:48:17,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:48:17,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:48:17,452 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:48:17,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:48:17,452 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:48:17,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:48:17,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:48:17,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:48:17,453 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:48:17,453 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:48:17,453 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:48:17,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:48:17,453 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:48:17,453 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:48:17,453 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:48:17,453 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:48:17,453 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:48:17,453 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:48:17,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:48:17,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:48:17,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:48:17,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:48:17,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:48:17,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:48:17,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:48:17,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:48:17,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:48:17,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:48:17,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:48:17,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:48:17,454 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-08 22:48:17,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:48:17,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:48:17,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:48:17,745 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:48:17,745 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:48:17,745 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-08 22:48:18,836 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d68c679a/bd31551ee8284d8da87e386622641801/FLAGd6b583c38 [2025-03-08 22:48:19,075 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:48:19,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0218.i [2025-03-08 22:48:19,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d68c679a/bd31551ee8284d8da87e386622641801/FLAGd6b583c38 [2025-03-08 22:48:19,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d68c679a/bd31551ee8284d8da87e386622641801 [2025-03-08 22:48:19,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:48:19,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:48:19,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:48:19,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:48:19,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:48:19,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:48:19" (1/1) ... [2025-03-08 22:48:19,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513b7c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:19, skipping insertion in model container [2025-03-08 22:48:19,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:48:19" (1/1) ... [2025-03-08 22:48:19,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:48:19,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:48:19,667 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:48:19,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:48:19,736 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:48:19,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:19 WrapperNode [2025-03-08 22:48:19,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:48:19,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:48:19,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:48:19,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:48:19,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:19" (1/1) ... [2025-03-08 22:48:19,754 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:19" (1/1) ... [2025-03-08 22:48:19,778 INFO L138 Inliner]: procedures = 181, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2025-03-08 22:48:19,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:48:19,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:48:19,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:48:19,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:48:19,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:19" (1/1) ... [2025-03-08 22:48:19,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:19" (1/1) ... [2025-03-08 22:48:19,788 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:19" (1/1) ... [2025-03-08 22:48:19,804 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-08 22:48:19,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:19" (1/1) ... [2025-03-08 22:48:19,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:19" (1/1) ... [2025-03-08 22:48:19,811 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:19" (1/1) ... [2025-03-08 22:48:19,812 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:19" (1/1) ... [2025-03-08 22:48:19,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:19" (1/1) ... [2025-03-08 22:48:19,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:19" (1/1) ... [2025-03-08 22:48:19,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:48:19,820 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:48:19,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:48:19,820 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:48:19,820 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:19" (1/1) ... [2025-03-08 22:48:19,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:48:19,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:19,842 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:48:19,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:48:19,859 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2025-03-08 22:48:19,860 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2025-03-08 22:48:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:48:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:48:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:48:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:48:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:48:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:48:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:48:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 22:48:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 22:48:19,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:48:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:48:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:48:19,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:48:19,949 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:48:19,950 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:48:20,287 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2025-03-08 22:48:20,287 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:48:20,298 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:48:20,298 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:48:20,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:48:20 BoogieIcfgContainer [2025-03-08 22:48:20,298 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:48:20,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:48:20,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:48:20,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:48:20,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:48:19" (1/3) ... [2025-03-08 22:48:20,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1eefbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:48:20, skipping insertion in model container [2025-03-08 22:48:20,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:48:19" (2/3) ... [2025-03-08 22:48:20,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1eefbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:48:20, skipping insertion in model container [2025-03-08 22:48:20,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:48:20" (3/3) ... [2025-03-08 22:48:20,308 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0218.i [2025-03-08 22:48:20,318 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:48:20,319 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0218.i that has 2 procedures, 162 locations, 1 initial locations, 6 loop locations, and 65 error locations. [2025-03-08 22:48:20,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:48:20,355 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;@1ebbc4a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:48:20,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-03-08 22:48:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 93 states have (on average 1.956989247311828) internal successors, (182), 158 states have internal predecessors, (182), 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-08 22:48:20,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:48:20,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:20,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:48:20,363 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-08 22:48:20,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:20,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1993973896, now seen corresponding path program 1 times [2025-03-08 22:48:20,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:20,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645408295] [2025-03-08 22:48:20,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:20,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:20,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:48:20,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:48:20,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:20,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:20,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:20,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645408295] [2025-03-08 22:48:20,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645408295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:20,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:20,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:48:20,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309340183] [2025-03-08 22:48:20,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:20,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:48:20,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:20,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:48:20,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:48:20,501 INFO L87 Difference]: Start difference. First operand has 162 states, 93 states have (on average 1.956989247311828) internal successors, (182), 158 states have internal predecessors, (182), 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 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-08 22:48:20,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:20,515 INFO L93 Difference]: Finished difference Result 162 states and 181 transitions. [2025-03-08 22:48:20,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:48:20,517 INFO L78 Accepts]: Start accepts. Automaton has has 2 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-08 22:48:20,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:20,520 INFO L225 Difference]: With dead ends: 162 [2025-03-08 22:48:20,521 INFO L226 Difference]: Without dead ends: 160 [2025-03-08 22:48:20,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:48:20,523 INFO L435 NwaCegarLoop]: 181 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, 181 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:20,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:20,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-08 22:48:20,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-03-08 22:48:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 92 states have (on average 1.9021739130434783) internal successors, (175), 156 states have internal predecessors, (175), 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-08 22:48:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2025-03-08 22:48:20,556 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 6 [2025-03-08 22:48:20,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:20,556 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2025-03-08 22:48:20,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 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-08 22:48:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2025-03-08 22:48:20,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:48:20,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:20,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:20,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:48:20,557 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-08 22:48:20,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:20,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1679684424, now seen corresponding path program 1 times [2025-03-08 22:48:20,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:20,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869130702] [2025-03-08 22:48:20,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:20,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:20,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:48:20,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:48:20,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:20,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:20,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:20,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869130702] [2025-03-08 22:48:20,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869130702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:20,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:20,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 22:48:20,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251465928] [2025-03-08 22:48:20,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:20,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:48:20,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:20,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:48:20,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:48:20,672 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:20,870 INFO L93 Difference]: Finished difference Result 311 states and 348 transitions. [2025-03-08 22:48:20,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:48:20,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 22:48:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:20,872 INFO L225 Difference]: With dead ends: 311 [2025-03-08 22:48:20,873 INFO L226 Difference]: Without dead ends: 311 [2025-03-08 22:48:20,873 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-08 22:48:20,873 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 160 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:20,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 229 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:20,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-08 22:48:20,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 222. [2025-03-08 22:48:20,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 151 states have (on average 1.8741721854304636) internal successors, (283), 215 states have internal predecessors, (283), 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-08 22:48:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 291 transitions. [2025-03-08 22:48:20,895 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 291 transitions. Word has length 7 [2025-03-08 22:48:20,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:20,896 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 291 transitions. [2025-03-08 22:48:20,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:20,896 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 291 transitions. [2025-03-08 22:48:20,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:48:20,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:20,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:20,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:48:20,897 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-08 22:48:20,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:20,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1679684423, now seen corresponding path program 1 times [2025-03-08 22:48:20,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:20,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208875853] [2025-03-08 22:48:20,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:20,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:20,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:48:20,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:48:20,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:20,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:20,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:20,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208875853] [2025-03-08 22:48:20,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208875853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:20,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:20,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:48:20,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685323952] [2025-03-08 22:48:20,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:20,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:48:20,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:20,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:48:20,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:48:20,993 INFO L87 Difference]: Start difference. First operand 222 states and 291 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:21,096 INFO L93 Difference]: Finished difference Result 225 states and 294 transitions. [2025-03-08 22:48:21,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:48:21,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 22:48:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:21,097 INFO L225 Difference]: With dead ends: 225 [2025-03-08 22:48:21,097 INFO L226 Difference]: Without dead ends: 225 [2025-03-08 22:48:21,097 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-08 22:48:21,098 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 175 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 239 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-08 22:48:21,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 239 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-08 22:48:21,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2025-03-08 22:48:21,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 153 states have (on average 1.869281045751634) internal successors, (286), 217 states have internal predecessors, (286), 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-08 22:48:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 294 transitions. [2025-03-08 22:48:21,109 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 294 transitions. Word has length 7 [2025-03-08 22:48:21,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:21,109 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 294 transitions. [2025-03-08 22:48:21,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:21,109 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 294 transitions. [2025-03-08 22:48:21,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:48:21,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:21,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:21,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:48:21,109 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-08 22:48:21,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:21,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1679684392, now seen corresponding path program 1 times [2025-03-08 22:48:21,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:21,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573179443] [2025-03-08 22:48:21,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:21,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:21,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:48:21,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:48:21,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:21,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:21,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:21,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573179443] [2025-03-08 22:48:21,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573179443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:21,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:21,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:48:21,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970014006] [2025-03-08 22:48:21,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:21,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:48:21,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:21,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:48:21,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:48:21,212 INFO L87 Difference]: Start difference. First operand 224 states and 294 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:21,311 INFO L93 Difference]: Finished difference Result 224 states and 292 transitions. [2025-03-08 22:48:21,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:48:21,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 22:48:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:21,312 INFO L225 Difference]: With dead ends: 224 [2025-03-08 22:48:21,312 INFO L226 Difference]: Without dead ends: 224 [2025-03-08 22:48:21,313 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-08 22:48:21,313 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 172 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:21,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 239 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-08 22:48:21,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2025-03-08 22:48:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 151 states have (on average 1.8609271523178808) internal successors, (281), 214 states have internal predecessors, (281), 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-08 22:48:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 289 transitions. [2025-03-08 22:48:21,326 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 289 transitions. Word has length 7 [2025-03-08 22:48:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:21,326 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 289 transitions. [2025-03-08 22:48:21,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 289 transitions. [2025-03-08 22:48:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:48:21,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:21,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:21,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:48:21,327 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-08 22:48:21,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:21,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1185279354, now seen corresponding path program 1 times [2025-03-08 22:48:21,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:21,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646164436] [2025-03-08 22:48:21,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:21,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:21,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:48:21,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:48:21,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:21,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:21,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:21,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646164436] [2025-03-08 22:48:21,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646164436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:21,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:21,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:48:21,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668464272] [2025-03-08 22:48:21,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:21,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:48:21,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:21,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:48:21,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:21,485 INFO L87 Difference]: Start difference. First operand 221 states and 289 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:21,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:21,623 INFO L93 Difference]: Finished difference Result 389 states and 501 transitions. [2025-03-08 22:48:21,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:48:21,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 22:48:21,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:21,625 INFO L225 Difference]: With dead ends: 389 [2025-03-08 22:48:21,625 INFO L226 Difference]: Without dead ends: 389 [2025-03-08 22:48:21,625 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-08 22:48:21,625 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 129 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:21,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 739 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-08 22:48:21,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 287. [2025-03-08 22:48:21,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 211 states have (on average 1.8009478672985781) internal successors, (380), 276 states have internal predecessors, (380), 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-08 22:48:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 396 transitions. [2025-03-08 22:48:21,639 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 396 transitions. Word has length 10 [2025-03-08 22:48:21,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:21,639 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 396 transitions. [2025-03-08 22:48:21,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:21,639 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 396 transitions. [2025-03-08 22:48:21,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:48:21,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:21,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:21,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:48:21,640 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-08 22:48:21,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:21,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1185279002, now seen corresponding path program 1 times [2025-03-08 22:48:21,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:21,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84288328] [2025-03-08 22:48:21,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:21,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:21,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:48:21,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:48:21,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:21,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:21,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:21,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:21,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84288328] [2025-03-08 22:48:21,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84288328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:21,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:21,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:48:21,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277669633] [2025-03-08 22:48:21,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:21,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:48:21,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:21,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:48:21,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:48:21,662 INFO L87 Difference]: Start difference. First operand 287 states and 396 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:21,749 INFO L93 Difference]: Finished difference Result 350 states and 456 transitions. [2025-03-08 22:48:21,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:48:21,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 22:48:21,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:21,751 INFO L225 Difference]: With dead ends: 350 [2025-03-08 22:48:21,751 INFO L226 Difference]: Without dead ends: 346 [2025-03-08 22:48:21,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:48:21,751 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 74 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 259 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-08 22:48:21,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 259 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:21,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-08 22:48:21,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 289. [2025-03-08 22:48:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 213 states have (on average 1.7887323943661972) internal successors, (381), 278 states have internal predecessors, (381), 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-08 22:48:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 397 transitions. [2025-03-08 22:48:21,762 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 397 transitions. Word has length 10 [2025-03-08 22:48:21,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:21,762 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 397 transitions. [2025-03-08 22:48:21,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:21,762 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 397 transitions. [2025-03-08 22:48:21,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:48:21,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:21,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:21,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:48:21,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-08 22:48:21,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:21,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1186202875, now seen corresponding path program 1 times [2025-03-08 22:48:21,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:21,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979324002] [2025-03-08 22:48:21,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:21,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:21,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:48:21,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:48:21,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:21,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:21,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:21,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979324002] [2025-03-08 22:48:21,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979324002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:21,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:21,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:48:21,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762766960] [2025-03-08 22:48:21,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:21,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:48:21,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:21,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:48:21,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:21,850 INFO L87 Difference]: Start difference. First operand 289 states and 397 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:21,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:21,993 INFO L93 Difference]: Finished difference Result 380 states and 489 transitions. [2025-03-08 22:48:21,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:48:21,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 22:48:21,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:21,995 INFO L225 Difference]: With dead ends: 380 [2025-03-08 22:48:21,995 INFO L226 Difference]: Without dead ends: 375 [2025-03-08 22:48:21,995 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-08 22:48:21,996 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 117 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:21,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 754 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:21,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-08 22:48:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 284. [2025-03-08 22:48:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 208 states have (on average 1.8028846153846154) internal successors, (375), 273 states have internal predecessors, (375), 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-08 22:48:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 391 transitions. [2025-03-08 22:48:22,003 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 391 transitions. Word has length 10 [2025-03-08 22:48:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:22,003 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 391 transitions. [2025-03-08 22:48:22,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:48:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 391 transitions. [2025-03-08 22:48:22,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 22:48:22,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:22,004 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:22,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:48:22,004 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-08 22:48:22,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:22,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1728101285, now seen corresponding path program 1 times [2025-03-08 22:48:22,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:22,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404068463] [2025-03-08 22:48:22,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:22,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:22,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:48:22,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:48:22,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:22,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:22,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:22,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:22,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404068463] [2025-03-08 22:48:22,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404068463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:22,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:22,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:48:22,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402443738] [2025-03-08 22:48:22,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:22,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:48:22,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:22,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:48:22,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:48:22,052 INFO L87 Difference]: Start difference. First operand 284 states and 391 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-08 22:48:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:22,220 INFO L93 Difference]: Finished difference Result 379 states and 465 transitions. [2025-03-08 22:48:22,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:48:22,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2025-03-08 22:48:22,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:22,222 INFO L225 Difference]: With dead ends: 379 [2025-03-08 22:48:22,222 INFO L226 Difference]: Without dead ends: 379 [2025-03-08 22:48:22,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:22,223 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 163 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:22,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 331 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:22,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-08 22:48:22,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 290. [2025-03-08 22:48:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 214 states have (on average 1.780373831775701) internal successors, (381), 279 states have internal predecessors, (381), 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-08 22:48:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 397 transitions. [2025-03-08 22:48:22,231 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 397 transitions. Word has length 15 [2025-03-08 22:48:22,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:22,231 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 397 transitions. [2025-03-08 22:48:22,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-08 22:48:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 397 transitions. [2025-03-08 22:48:22,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 22:48:22,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:22,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:22,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:48:22,233 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-08 22:48:22,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:22,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1728101286, now seen corresponding path program 1 times [2025-03-08 22:48:22,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:22,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169744207] [2025-03-08 22:48:22,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:22,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:22,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:48:22,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:48:22,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:22,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:22,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:22,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169744207] [2025-03-08 22:48:22,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169744207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:22,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:22,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:48:22,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326601544] [2025-03-08 22:48:22,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:22,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:48:22,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:22,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:48:22,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:48:22,326 INFO L87 Difference]: Start difference. First operand 290 states and 397 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-08 22:48:22,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:22,421 INFO L93 Difference]: Finished difference Result 291 states and 389 transitions. [2025-03-08 22:48:22,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:48:22,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2025-03-08 22:48:22,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:22,423 INFO L225 Difference]: With dead ends: 291 [2025-03-08 22:48:22,423 INFO L226 Difference]: Without dead ends: 291 [2025-03-08 22:48:22,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:22,424 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 174 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 226 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-08 22:48:22,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 226 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-08 22:48:22,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2025-03-08 22:48:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 214 states have (on average 1.7242990654205608) internal successors, (369), 276 states have internal predecessors, (369), 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-08 22:48:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 385 transitions. [2025-03-08 22:48:22,431 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 385 transitions. Word has length 15 [2025-03-08 22:48:22,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:22,431 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 385 transitions. [2025-03-08 22:48:22,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-08 22:48:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 385 transitions. [2025-03-08 22:48:22,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:48:22,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:22,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:22,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:48:22,432 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-08 22:48:22,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:22,433 INFO L85 PathProgramCache]: Analyzing trace with hash 63282787, now seen corresponding path program 1 times [2025-03-08 22:48:22,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:22,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115511579] [2025-03-08 22:48:22,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:22,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:22,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:48:22,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:48:22,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:22,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:22,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-08 22:48:22,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:22,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115511579] [2025-03-08 22:48:22,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115511579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:22,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:22,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:48:22,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223057422] [2025-03-08 22:48:22,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:22,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:48:22,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:22,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:48:22,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:22,518 INFO L87 Difference]: Start difference. First operand 287 states and 385 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-08 22:48:22,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:22,725 INFO L93 Difference]: Finished difference Result 392 states and 486 transitions. [2025-03-08 22:48:22,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:48:22,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-08 22:48:22,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:22,727 INFO L225 Difference]: With dead ends: 392 [2025-03-08 22:48:22,727 INFO L226 Difference]: Without dead ends: 392 [2025-03-08 22:48:22,727 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-08 22:48:22,728 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 296 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:22,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 385 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:22,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-08 22:48:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 284. [2025-03-08 22:48:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 215 states have (on average 1.6883720930232557) internal successors, (363), 273 states have internal predecessors, (363), 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-08 22:48:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 379 transitions. [2025-03-08 22:48:22,733 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 379 transitions. Word has length 17 [2025-03-08 22:48:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:22,733 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 379 transitions. [2025-03-08 22:48:22,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-08 22:48:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 379 transitions. [2025-03-08 22:48:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:48:22,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:22,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:22,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:48:22,734 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-08 22:48:22,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:22,734 INFO L85 PathProgramCache]: Analyzing trace with hash 63282788, now seen corresponding path program 1 times [2025-03-08 22:48:22,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:22,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912658488] [2025-03-08 22:48:22,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:22,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:22,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:48:22,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:48:22,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:22,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:22,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:22,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:22,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912658488] [2025-03-08 22:48:22,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912658488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:22,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:22,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:48:22,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116130305] [2025-03-08 22:48:22,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:22,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:48:22,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:22,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:48:22,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:22,844 INFO L87 Difference]: Start difference. First operand 284 states and 379 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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-08 22:48:23,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:23,016 INFO L93 Difference]: Finished difference Result 356 states and 480 transitions. [2025-03-08 22:48:23,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:48:23,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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-08 22:48:23,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:23,017 INFO L225 Difference]: With dead ends: 356 [2025-03-08 22:48:23,017 INFO L226 Difference]: Without dead ends: 356 [2025-03-08 22:48:23,017 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-08 22:48:23,018 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 245 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:23,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 460 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:23,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-08 22:48:23,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 346. [2025-03-08 22:48:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 273 states have (on average 1.6703296703296704) internal successors, (456), 333 states have internal predecessors, (456), 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-08 22:48:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 480 transitions. [2025-03-08 22:48:23,025 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 480 transitions. Word has length 17 [2025-03-08 22:48:23,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:23,025 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 480 transitions. [2025-03-08 22:48:23,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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-08 22:48:23,026 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 480 transitions. [2025-03-08 22:48:23,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:48:23,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:23,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:23,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:48:23,026 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-08 22:48:23,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:23,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1744171675, now seen corresponding path program 1 times [2025-03-08 22:48:23,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:23,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627024044] [2025-03-08 22:48:23,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:23,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:23,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:48:23,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:48:23,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:23,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:23,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:23,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627024044] [2025-03-08 22:48:23,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627024044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:23,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:23,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:48:23,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389106392] [2025-03-08 22:48:23,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:23,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:48:23,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:23,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:48:23,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:23,078 INFO L87 Difference]: Start difference. First operand 346 states and 480 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-08 22:48:23,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:23,098 INFO L93 Difference]: Finished difference Result 346 states and 478 transitions. [2025-03-08 22:48:23,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:48:23,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-08 22:48:23,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:23,100 INFO L225 Difference]: With dead ends: 346 [2025-03-08 22:48:23,100 INFO L226 Difference]: Without dead ends: 346 [2025-03-08 22:48:23,100 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-08 22:48:23,100 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 1 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 856 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-08 22:48:23,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 856 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:23,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-08 22:48:23,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-03-08 22:48:23,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 273 states have (on average 1.663003663003663) internal successors, (454), 333 states have internal predecessors, (454), 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-08 22:48:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 478 transitions. [2025-03-08 22:48:23,107 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 478 transitions. Word has length 17 [2025-03-08 22:48:23,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:23,108 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 478 transitions. [2025-03-08 22:48:23,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-08 22:48:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 478 transitions. [2025-03-08 22:48:23,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:48:23,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:23,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:23,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:48:23,109 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-08 22:48:23,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:23,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1765314657, now seen corresponding path program 1 times [2025-03-08 22:48:23,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:23,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668804657] [2025-03-08 22:48:23,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:23,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:23,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:48:23,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:48:23,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:23,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:23,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:23,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668804657] [2025-03-08 22:48:23,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668804657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:23,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:23,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:48:23,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051559174] [2025-03-08 22:48:23,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:23,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:48:23,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:23,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:48:23,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:48:23,346 INFO L87 Difference]: Start difference. First operand 346 states and 478 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-08 22:48:23,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:23,765 INFO L93 Difference]: Finished difference Result 458 states and 580 transitions. [2025-03-08 22:48:23,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:48:23,765 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 18 [2025-03-08 22:48:23,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:23,767 INFO L225 Difference]: With dead ends: 458 [2025-03-08 22:48:23,768 INFO L226 Difference]: Without dead ends: 458 [2025-03-08 22:48:23,768 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-08 22:48:23,768 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 186 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:23,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 690 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:48:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-08 22:48:23,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 343. [2025-03-08 22:48:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 270 states have (on average 1.662962962962963) internal successors, (449), 330 states have internal predecessors, (449), 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-08 22:48:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 473 transitions. [2025-03-08 22:48:23,781 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 473 transitions. Word has length 18 [2025-03-08 22:48:23,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:23,782 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 473 transitions. [2025-03-08 22:48:23,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-08 22:48:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 473 transitions. [2025-03-08 22:48:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 22:48:23,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:23,783 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-08 22:48:23,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:48:23,784 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-08 22:48:23,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:23,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1366890110, now seen corresponding path program 1 times [2025-03-08 22:48:23,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:23,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104479890] [2025-03-08 22:48:23,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:23,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:23,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 22:48:23,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:48:23,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:23,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:23,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:23,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:23,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104479890] [2025-03-08 22:48:23,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104479890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:23,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:23,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:48:23,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639678821] [2025-03-08 22:48:23,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:23,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:48:23,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:23,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:48:23,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:48:23,946 INFO L87 Difference]: Start difference. First operand 343 states and 473 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-08 22:48:24,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:24,118 INFO L93 Difference]: Finished difference Result 478 states and 626 transitions. [2025-03-08 22:48:24,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:48:24,118 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-08 22:48:24,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:24,120 INFO L225 Difference]: With dead ends: 478 [2025-03-08 22:48:24,120 INFO L226 Difference]: Without dead ends: 478 [2025-03-08 22:48:24,120 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-08 22:48:24,121 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 146 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:24,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 977 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:24,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-08 22:48:24,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 361. [2025-03-08 22:48:24,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 288 states have (on average 1.6388888888888888) internal successors, (472), 346 states have internal predecessors, (472), 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-08 22:48:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 496 transitions. [2025-03-08 22:48:24,128 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 496 transitions. Word has length 21 [2025-03-08 22:48:24,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:24,128 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 496 transitions. [2025-03-08 22:48:24,128 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-08 22:48:24,128 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 496 transitions. [2025-03-08 22:48:24,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 22:48:24,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:24,128 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-08 22:48:24,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:48:24,129 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-08 22:48:24,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:24,129 INFO L85 PathProgramCache]: Analyzing trace with hash -640433250, now seen corresponding path program 1 times [2025-03-08 22:48:24,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:24,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725015425] [2025-03-08 22:48:24,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:24,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:24,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 22:48:24,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:48:24,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:24,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:24,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:24,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725015425] [2025-03-08 22:48:24,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725015425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:24,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:24,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:48:24,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700317704] [2025-03-08 22:48:24,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:24,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:48:24,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:24,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:48:24,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:48:24,297 INFO L87 Difference]: Start difference. First operand 361 states and 496 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-08 22:48:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:24,554 INFO L93 Difference]: Finished difference Result 454 states and 597 transitions. [2025-03-08 22:48:24,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:48:24,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-08 22:48:24,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:24,556 INFO L225 Difference]: With dead ends: 454 [2025-03-08 22:48:24,556 INFO L226 Difference]: Without dead ends: 454 [2025-03-08 22:48:24,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:48:24,556 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 108 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:24,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 995 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:24,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-08 22:48:24,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 355. [2025-03-08 22:48:24,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 282 states have (on average 1.6347517730496455) internal successors, (461), 340 states have internal predecessors, (461), 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-08 22:48:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 485 transitions. [2025-03-08 22:48:24,564 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 485 transitions. Word has length 21 [2025-03-08 22:48:24,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:24,564 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 485 transitions. [2025-03-08 22:48:24,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-08 22:48:24,564 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 485 transitions. [2025-03-08 22:48:24,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 22:48:24,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:24,564 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] [2025-03-08 22:48:24,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:48:24,565 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-08 22:48:24,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:24,565 INFO L85 PathProgramCache]: Analyzing trace with hash -474629, now seen corresponding path program 1 times [2025-03-08 22:48:24,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:24,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224672483] [2025-03-08 22:48:24,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:24,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:24,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 22:48:24,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:48:24,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:24,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:24,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:24,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:24,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224672483] [2025-03-08 22:48:24,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224672483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:24,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:24,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:48:24,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141263998] [2025-03-08 22:48:24,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:24,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:48:24,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:24,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:48:24,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:48:24,695 INFO L87 Difference]: Start difference. First operand 355 states and 485 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-08 22:48:24,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:24,913 INFO L93 Difference]: Finished difference Result 476 states and 626 transitions. [2025-03-08 22:48:24,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:48:24,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 22 [2025-03-08 22:48:24,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:24,915 INFO L225 Difference]: With dead ends: 476 [2025-03-08 22:48:24,915 INFO L226 Difference]: Without dead ends: 476 [2025-03-08 22:48:24,915 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-08 22:48:24,916 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 116 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:24,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1055 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:24,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-03-08 22:48:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 368. [2025-03-08 22:48:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 295 states have (on average 1.616949152542373) internal successors, (477), 351 states have internal predecessors, (477), 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-08 22:48:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 501 transitions. [2025-03-08 22:48:24,926 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 501 transitions. Word has length 22 [2025-03-08 22:48:24,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:24,927 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 501 transitions. [2025-03-08 22:48:24,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-08 22:48:24,927 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 501 transitions. [2025-03-08 22:48:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:48:24,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:24,928 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] [2025-03-08 22:48:24,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:48:24,928 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-08 22:48:24,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:24,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1275258694, now seen corresponding path program 1 times [2025-03-08 22:48:24,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:24,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983281265] [2025-03-08 22:48:24,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:24,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:24,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:48:24,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:48:24,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:24,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:24,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:24,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983281265] [2025-03-08 22:48:24,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983281265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:24,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:24,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:48:24,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467266320] [2025-03-08 22:48:24,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:24,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:48:24,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:24,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:48:24,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:48:24,973 INFO L87 Difference]: Start difference. First operand 368 states and 501 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-08 22:48:25,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:25,110 INFO L93 Difference]: Finished difference Result 445 states and 561 transitions. [2025-03-08 22:48:25,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:48:25,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 23 [2025-03-08 22:48:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:25,112 INFO L225 Difference]: With dead ends: 445 [2025-03-08 22:48:25,112 INFO L226 Difference]: Without dead ends: 445 [2025-03-08 22:48:25,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:25,112 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 165 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:25,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 330 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:25,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-03-08 22:48:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 382. [2025-03-08 22:48:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 309 states have (on average 1.6343042071197411) internal successors, (505), 365 states have internal predecessors, (505), 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-08 22:48:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 529 transitions. [2025-03-08 22:48:25,121 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 529 transitions. Word has length 23 [2025-03-08 22:48:25,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:25,121 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 529 transitions. [2025-03-08 22:48:25,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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-08 22:48:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 529 transitions. [2025-03-08 22:48:25,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:48:25,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:25,123 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] [2025-03-08 22:48:25,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:48:25,123 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-08 22:48:25,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:25,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1275258693, now seen corresponding path program 1 times [2025-03-08 22:48:25,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:25,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034920151] [2025-03-08 22:48:25,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:25,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:25,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:48:25,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:48:25,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:25,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:25,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:25,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034920151] [2025-03-08 22:48:25,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034920151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:25,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:25,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:48:25,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630819716] [2025-03-08 22:48:25,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:25,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:48:25,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:25,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:48:25,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:48:25,248 INFO L87 Difference]: Start difference. First operand 382 states and 529 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-08 22:48:25,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:25,389 INFO L93 Difference]: Finished difference Result 350 states and 469 transitions. [2025-03-08 22:48:25,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:48:25,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 23 [2025-03-08 22:48:25,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:25,390 INFO L225 Difference]: With dead ends: 350 [2025-03-08 22:48:25,391 INFO L226 Difference]: Without dead ends: 350 [2025-03-08 22:48:25,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:48:25,391 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 58 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:25,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1047 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:25,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-08 22:48:25,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 320. [2025-03-08 22:48:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 251 states have (on average 1.649402390438247) internal successors, (414), 307 states have internal predecessors, (414), 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-08 22:48:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 432 transitions. [2025-03-08 22:48:25,397 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 432 transitions. Word has length 23 [2025-03-08 22:48:25,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:25,397 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 432 transitions. [2025-03-08 22:48:25,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-08 22:48:25,397 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 432 transitions. [2025-03-08 22:48:25,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:48:25,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:25,397 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-08 22:48:25,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:48:25,398 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-08 22:48:25,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:25,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1447826480, now seen corresponding path program 1 times [2025-03-08 22:48:25,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:25,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029014885] [2025-03-08 22:48:25,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:25,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:25,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:48:25,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:48:25,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:25,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:25,426 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-08 22:48:25,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:25,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029014885] [2025-03-08 22:48:25,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029014885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:25,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:25,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:48:25,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92905914] [2025-03-08 22:48:25,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:25,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:48:25,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:25,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:48:25,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:48:25,428 INFO L87 Difference]: Start difference. First operand 320 states and 432 transitions. Second operand has 4 states, 4 states have (on average 5.75) 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-08 22:48:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:25,444 INFO L93 Difference]: Finished difference Result 332 states and 444 transitions. [2025-03-08 22:48:25,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:48:25,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) 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-08 22:48:25,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:25,446 INFO L225 Difference]: With dead ends: 332 [2025-03-08 22:48:25,446 INFO L226 Difference]: Without dead ends: 332 [2025-03-08 22:48:25,446 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-08 22:48:25,446 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 493 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-08 22:48:25,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 493 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:25,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-08 22:48:25,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-03-08 22:48:25,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 263 states have (on average 1.6197718631178708) internal successors, (426), 319 states have internal predecessors, (426), 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-08 22:48:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 444 transitions. [2025-03-08 22:48:25,452 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 444 transitions. Word has length 25 [2025-03-08 22:48:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:25,452 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 444 transitions. [2025-03-08 22:48:25,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) 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-08 22:48:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 444 transitions. [2025-03-08 22:48:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:48:25,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:25,453 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-08 22:48:25,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:48:25,453 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-08 22:48:25,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:25,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1448775798, now seen corresponding path program 1 times [2025-03-08 22:48:25,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:25,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815286317] [2025-03-08 22:48:25,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:25,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:25,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:48:25,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:48:25,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:25,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:25,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:25,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815286317] [2025-03-08 22:48:25,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815286317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:25,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:25,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:48:25,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820591813] [2025-03-08 22:48:25,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:25,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:48:25,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:25,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:48:25,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:48:25,482 INFO L87 Difference]: Start difference. First operand 332 states and 444 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-08 22:48:25,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:25,541 INFO L93 Difference]: Finished difference Result 330 states and 436 transitions. [2025-03-08 22:48:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:48:25,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-08 22:48:25,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:25,543 INFO L225 Difference]: With dead ends: 330 [2025-03-08 22:48:25,543 INFO L226 Difference]: Without dead ends: 330 [2025-03-08 22:48:25,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:48:25,544 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 34 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:25,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 225 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:25,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-08 22:48:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-03-08 22:48:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 263 states have (on average 1.5893536121673004) internal successors, (418), 317 states have internal predecessors, (418), 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-08 22:48:25,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 436 transitions. [2025-03-08 22:48:25,552 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 436 transitions. Word has length 25 [2025-03-08 22:48:25,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:25,553 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 436 transitions. [2025-03-08 22:48:25,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-08 22:48:25,553 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 436 transitions. [2025-03-08 22:48:25,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 22:48:25,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:25,555 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-08 22:48:25,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:48:25,555 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-08 22:48:25,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:25,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1448775799, now seen corresponding path program 1 times [2025-03-08 22:48:25,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:25,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533699790] [2025-03-08 22:48:25,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:25,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:25,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:48:25,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:48:25,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:25,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:25,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:25,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533699790] [2025-03-08 22:48:25,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533699790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:25,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:25,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:48:25,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289225599] [2025-03-08 22:48:25,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:25,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:48:25,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:25,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:48:25,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:48:25,617 INFO L87 Difference]: Start difference. First operand 330 states and 436 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-08 22:48:25,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:25,682 INFO L93 Difference]: Finished difference Result 408 states and 539 transitions. [2025-03-08 22:48:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:48:25,682 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-08 22:48:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:25,683 INFO L225 Difference]: With dead ends: 408 [2025-03-08 22:48:25,683 INFO L226 Difference]: Without dead ends: 408 [2025-03-08 22:48:25,683 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-08 22:48:25,684 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 73 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:25,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 257 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-08 22:48:25,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 402. [2025-03-08 22:48:25,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 335 states have (on average 1.5552238805970149) internal successors, (521), 389 states have internal predecessors, (521), 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-08 22:48:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 539 transitions. [2025-03-08 22:48:25,690 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 539 transitions. Word has length 25 [2025-03-08 22:48:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:25,690 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 539 transitions. [2025-03-08 22:48:25,690 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-08 22:48:25,690 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 539 transitions. [2025-03-08 22:48:25,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:48:25,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:25,691 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-08 22:48:25,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:48:25,691 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-08 22:48:25,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:25,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1499222869, now seen corresponding path program 1 times [2025-03-08 22:48:25,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:25,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113965579] [2025-03-08 22:48:25,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:25,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:25,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:48:25,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:48:25,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:25,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:25,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:25,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113965579] [2025-03-08 22:48:25,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113965579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:25,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:25,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:48:25,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594460116] [2025-03-08 22:48:25,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:25,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:48:25,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:25,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:48:25,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:25,735 INFO L87 Difference]: Start difference. First operand 402 states and 539 transitions. Second operand has 6 states, 6 states have (on average 4.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-08 22:48:25,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:25,755 INFO L93 Difference]: Finished difference Result 425 states and 561 transitions. [2025-03-08 22:48:25,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:48:25,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.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-08 22:48:25,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:25,756 INFO L225 Difference]: With dead ends: 425 [2025-03-08 22:48:25,756 INFO L226 Difference]: Without dead ends: 425 [2025-03-08 22:48:25,757 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-08 22:48:25,757 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 44 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 820 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-08 22:48:25,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 820 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:25,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-08 22:48:25,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 384. [2025-03-08 22:48:25,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 317 states have (on average 1.5520504731861198) internal successors, (492), 371 states have internal predecessors, (492), 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-08 22:48:25,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 510 transitions. [2025-03-08 22:48:25,766 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 510 transitions. Word has length 26 [2025-03-08 22:48:25,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:25,766 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 510 transitions. [2025-03-08 22:48:25,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.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-08 22:48:25,766 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 510 transitions. [2025-03-08 22:48:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:48:25,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:25,767 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-08 22:48:25,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:48:25,767 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-08 22:48:25,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:25,768 INFO L85 PathProgramCache]: Analyzing trace with hash 502150516, now seen corresponding path program 1 times [2025-03-08 22:48:25,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:25,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739220347] [2025-03-08 22:48:25,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:25,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:25,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:48:25,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:48:25,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:25,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:25,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:25,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739220347] [2025-03-08 22:48:25,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739220347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:25,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:25,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:48:25,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121884442] [2025-03-08 22:48:25,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:25,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:48:25,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:25,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:48:25,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:48:25,842 INFO L87 Difference]: Start difference. First operand 384 states and 510 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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-08 22:48:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:25,927 INFO L93 Difference]: Finished difference Result 446 states and 591 transitions. [2025-03-08 22:48:25,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:48:25,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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-08 22:48:25,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:25,928 INFO L225 Difference]: With dead ends: 446 [2025-03-08 22:48:25,929 INFO L226 Difference]: Without dead ends: 446 [2025-03-08 22:48:25,929 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-08 22:48:25,929 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 56 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:25,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 359 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:25,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-08 22:48:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 385. [2025-03-08 22:48:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 318 states have (on average 1.550314465408805) internal successors, (493), 372 states have internal predecessors, (493), 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-08 22:48:25,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 511 transitions. [2025-03-08 22:48:25,937 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 511 transitions. Word has length 26 [2025-03-08 22:48:25,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:25,938 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 511 transitions. [2025-03-08 22:48:25,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 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-08 22:48:25,938 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 511 transitions. [2025-03-08 22:48:25,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:48:25,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:25,938 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-08 22:48:25,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:48:25,939 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-08 22:48:25,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:25,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1294800843, now seen corresponding path program 1 times [2025-03-08 22:48:25,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:25,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019851953] [2025-03-08 22:48:25,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:25,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:25,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:48:25,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:48:25,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:25,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:25,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:25,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:25,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019851953] [2025-03-08 22:48:25,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019851953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:25,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:25,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:48:25,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805459704] [2025-03-08 22:48:25,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:25,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:48:25,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:25,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:48:25,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:25,989 INFO L87 Difference]: Start difference. First operand 385 states and 511 transitions. Second operand has 6 states, 6 states have (on average 4.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-08 22:48:26,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:26,005 INFO L93 Difference]: Finished difference Result 328 states and 424 transitions. [2025-03-08 22:48:26,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:48:26,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.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-08 22:48:26,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:26,006 INFO L225 Difference]: With dead ends: 328 [2025-03-08 22:48:26,006 INFO L226 Difference]: Without dead ends: 328 [2025-03-08 22:48:26,006 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-08 22:48:26,007 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 830 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-08 22:48:26,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 830 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:48:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-08 22:48:26,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-03-08 22:48:26,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 262 states have (on average 1.549618320610687) internal successors, (406), 315 states have internal predecessors, (406), 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-08 22:48:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 424 transitions. [2025-03-08 22:48:26,012 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 424 transitions. Word has length 26 [2025-03-08 22:48:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:26,012 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 424 transitions. [2025-03-08 22:48:26,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.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-08 22:48:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 424 transitions. [2025-03-08 22:48:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 22:48:26,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:26,013 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-08 22:48:26,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:48:26,013 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-08 22:48:26,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:26,013 INFO L85 PathProgramCache]: Analyzing trace with hash 704141424, now seen corresponding path program 1 times [2025-03-08 22:48:26,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:26,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663670695] [2025-03-08 22:48:26,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:26,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:26,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:48:26,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:48:26,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:26,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:26,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:26,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663670695] [2025-03-08 22:48:26,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663670695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:26,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:26,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:48:26,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569108769] [2025-03-08 22:48:26,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:26,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:48:26,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:26,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:48:26,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:26,068 INFO L87 Difference]: Start difference. First operand 328 states and 424 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-08 22:48:26,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:26,139 INFO L93 Difference]: Finished difference Result 419 states and 550 transitions. [2025-03-08 22:48:26,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:48:26,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-08 22:48:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:26,141 INFO L225 Difference]: With dead ends: 419 [2025-03-08 22:48:26,141 INFO L226 Difference]: Without dead ends: 419 [2025-03-08 22:48:26,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:26,142 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 71 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:26,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 529 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:26,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-08 22:48:26,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 395. [2025-03-08 22:48:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 329 states have (on average 1.5379939209726443) internal successors, (506), 382 states have internal predecessors, (506), 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-08 22:48:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 524 transitions. [2025-03-08 22:48:26,153 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 524 transitions. Word has length 27 [2025-03-08 22:48:26,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:26,153 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 524 transitions. [2025-03-08 22:48:26,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-08 22:48:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 524 transitions. [2025-03-08 22:48:26,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 22:48:26,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:26,154 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-08 22:48:26,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:48:26,154 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-08 22:48:26,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:26,155 INFO L85 PathProgramCache]: Analyzing trace with hash 704141458, now seen corresponding path program 1 times [2025-03-08 22:48:26,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:26,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184320498] [2025-03-08 22:48:26,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:26,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:26,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:48:26,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:48:26,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:26,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:26,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:26,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:26,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184320498] [2025-03-08 22:48:26,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184320498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:26,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:26,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:48:26,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728669154] [2025-03-08 22:48:26,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:26,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:48:26,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:26,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:48:26,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:48:26,248 INFO L87 Difference]: Start difference. First operand 395 states and 524 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-08 22:48:26,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:26,342 INFO L93 Difference]: Finished difference Result 454 states and 591 transitions. [2025-03-08 22:48:26,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:48:26,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-08 22:48:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:26,344 INFO L225 Difference]: With dead ends: 454 [2025-03-08 22:48:26,344 INFO L226 Difference]: Without dead ends: 454 [2025-03-08 22:48:26,344 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-08 22:48:26,344 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 14 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 706 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-08 22:48:26,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 706 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:26,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-08 22:48:26,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 445. [2025-03-08 22:48:26,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 379 states have (on average 1.4854881266490765) internal successors, (563), 432 states have internal predecessors, (563), 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-08 22:48:26,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 581 transitions. [2025-03-08 22:48:26,355 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 581 transitions. Word has length 27 [2025-03-08 22:48:26,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:26,355 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 581 transitions. [2025-03-08 22:48:26,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-08 22:48:26,356 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 581 transitions. [2025-03-08 22:48:26,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:48:26,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:26,356 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] [2025-03-08 22:48:26,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:48:26,357 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-08 22:48:26,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:26,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1530311213, now seen corresponding path program 1 times [2025-03-08 22:48:26,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:26,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692915886] [2025-03-08 22:48:26,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:26,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:26,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:48:26,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:48:26,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:26,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:26,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:26,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692915886] [2025-03-08 22:48:26,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692915886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:26,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:26,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:48:26,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439914524] [2025-03-08 22:48:26,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:26,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:48:26,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:26,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:48:26,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:48:26,432 INFO L87 Difference]: Start difference. First operand 445 states and 581 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-08 22:48:26,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:26,521 INFO L93 Difference]: Finished difference Result 474 states and 606 transitions. [2025-03-08 22:48:26,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:48:26,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 28 [2025-03-08 22:48:26,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:26,522 INFO L225 Difference]: With dead ends: 474 [2025-03-08 22:48:26,522 INFO L226 Difference]: Without dead ends: 474 [2025-03-08 22:48:26,522 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-08 22:48:26,523 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 67 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:26,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 367 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-03-08 22:48:26,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 359. [2025-03-08 22:48:26,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 294 states have (on average 1.4829931972789117) internal successors, (436), 346 states have internal predecessors, (436), 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-08 22:48:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 454 transitions. [2025-03-08 22:48:26,530 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 454 transitions. Word has length 28 [2025-03-08 22:48:26,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:26,530 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 454 transitions. [2025-03-08 22:48:26,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-08 22:48:26,530 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 454 transitions. [2025-03-08 22:48:26,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 22:48:26,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:26,531 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-08 22:48:26,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 22:48:26,531 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-08 22:48:26,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:26,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1804799734, now seen corresponding path program 1 times [2025-03-08 22:48:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:26,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558917622] [2025-03-08 22:48:26,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:26,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:26,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:48:26,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:48:26,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:26,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:26,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:26,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558917622] [2025-03-08 22:48:26,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558917622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:26,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:26,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:48:26,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316805146] [2025-03-08 22:48:26,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:26,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:48:26,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:26,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:48:26,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:26,580 INFO L87 Difference]: Start difference. First operand 359 states and 454 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-08 22:48:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:26,674 INFO L93 Difference]: Finished difference Result 360 states and 454 transitions. [2025-03-08 22:48:26,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:48:26,675 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-08 22:48:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:26,676 INFO L225 Difference]: With dead ends: 360 [2025-03-08 22:48:26,676 INFO L226 Difference]: Without dead ends: 360 [2025-03-08 22:48:26,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:26,677 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 52 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:26,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 411 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-08 22:48:26,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 358. [2025-03-08 22:48:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 294 states have (on average 1.4761904761904763) internal successors, (434), 345 states have internal predecessors, (434), 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-08 22:48:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 452 transitions. [2025-03-08 22:48:26,685 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 452 transitions. Word has length 33 [2025-03-08 22:48:26,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:26,685 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 452 transitions. [2025-03-08 22:48:26,685 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-08 22:48:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 452 transitions. [2025-03-08 22:48:26,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 22:48:26,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:26,686 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-08 22:48:26,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 22:48:26,686 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-08 22:48:26,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:26,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1804799733, now seen corresponding path program 1 times [2025-03-08 22:48:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:26,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737501447] [2025-03-08 22:48:26,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:26,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:26,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:48:26,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:48:26,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:26,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:26,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:26,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737501447] [2025-03-08 22:48:26,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737501447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:26,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:26,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:48:26,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974142392] [2025-03-08 22:48:26,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:26,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:48:26,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:26,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:48:26,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:26,776 INFO L87 Difference]: Start difference. First operand 358 states and 452 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-08 22:48:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:26,872 INFO L93 Difference]: Finished difference Result 359 states and 452 transitions. [2025-03-08 22:48:26,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:48:26,873 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-08 22:48:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:26,874 INFO L225 Difference]: With dead ends: 359 [2025-03-08 22:48:26,874 INFO L226 Difference]: Without dead ends: 359 [2025-03-08 22:48:26,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:26,874 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 40 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:26,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 441 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:26,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-08 22:48:26,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2025-03-08 22:48:26,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 294 states have (on average 1.469387755102041) internal successors, (432), 344 states have internal predecessors, (432), 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-08 22:48:26,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 450 transitions. [2025-03-08 22:48:26,881 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 450 transitions. Word has length 33 [2025-03-08 22:48:26,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:26,881 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 450 transitions. [2025-03-08 22:48:26,881 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-08 22:48:26,881 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 450 transitions. [2025-03-08 22:48:26,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 22:48:26,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:26,881 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, 1, 1] [2025-03-08 22:48:26,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 22:48:26,881 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-08 22:48:26,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:26,882 INFO L85 PathProgramCache]: Analyzing trace with hash 754245895, now seen corresponding path program 1 times [2025-03-08 22:48:26,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:26,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493820630] [2025-03-08 22:48:26,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:26,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:26,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:48:26,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:48:26,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:26,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:26,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:26,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:26,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493820630] [2025-03-08 22:48:26,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493820630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:26,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:26,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:48:26,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264048843] [2025-03-08 22:48:26,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:26,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:48:26,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:26,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:48:26,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:26,940 INFO L87 Difference]: Start difference. First operand 357 states and 450 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-08 22:48:27,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:27,030 INFO L93 Difference]: Finished difference Result 396 states and 496 transitions. [2025-03-08 22:48:27,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:48:27,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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 35 [2025-03-08 22:48:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:27,032 INFO L225 Difference]: With dead ends: 396 [2025-03-08 22:48:27,032 INFO L226 Difference]: Without dead ends: 396 [2025-03-08 22:48:27,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:27,032 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 81 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:27,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 360 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-08 22:48:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 354. [2025-03-08 22:48:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 294 states have (on average 1.4489795918367347) internal successors, (426), 341 states have internal predecessors, (426), 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-08 22:48:27,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 444 transitions. [2025-03-08 22:48:27,038 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 444 transitions. Word has length 35 [2025-03-08 22:48:27,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:27,038 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 444 transitions. [2025-03-08 22:48:27,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-08 22:48:27,039 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 444 transitions. [2025-03-08 22:48:27,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 22:48:27,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:27,039 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, 1, 1] [2025-03-08 22:48:27,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 22:48:27,039 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-08 22:48:27,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:27,040 INFO L85 PathProgramCache]: Analyzing trace with hash 754245896, now seen corresponding path program 1 times [2025-03-08 22:48:27,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:27,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682859299] [2025-03-08 22:48:27,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:27,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:27,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:48:27,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:48:27,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:27,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:27,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:27,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682859299] [2025-03-08 22:48:27,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682859299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:27,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:27,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:48:27,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839804193] [2025-03-08 22:48:27,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:27,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:48:27,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:27,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:48:27,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:48:27,147 INFO L87 Difference]: Start difference. First operand 354 states and 444 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-08 22:48:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:27,281 INFO L93 Difference]: Finished difference Result 395 states and 494 transitions. [2025-03-08 22:48:27,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:48:27,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 35 [2025-03-08 22:48:27,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:27,283 INFO L225 Difference]: With dead ends: 395 [2025-03-08 22:48:27,283 INFO L226 Difference]: Without dead ends: 395 [2025-03-08 22:48:27,283 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-08 22:48:27,283 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 282 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 427 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-08 22:48:27,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 427 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-08 22:48:27,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 353. [2025-03-08 22:48:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 294 states have (on average 1.4421768707482994) internal successors, (424), 340 states have internal predecessors, (424), 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-08 22:48:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 442 transitions. [2025-03-08 22:48:27,291 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 442 transitions. Word has length 35 [2025-03-08 22:48:27,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:27,291 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 442 transitions. [2025-03-08 22:48:27,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-08 22:48:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 442 transitions. [2025-03-08 22:48:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 22:48:27,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:27,291 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, 1, 1] [2025-03-08 22:48:27,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 22:48:27,292 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-08 22:48:27,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:27,292 INFO L85 PathProgramCache]: Analyzing trace with hash 754245924, now seen corresponding path program 1 times [2025-03-08 22:48:27,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:27,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880078854] [2025-03-08 22:48:27,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:27,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:27,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:48:27,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:48:27,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:27,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:27,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:27,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880078854] [2025-03-08 22:48:27,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880078854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:27,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:27,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:48:27,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662415755] [2025-03-08 22:48:27,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:27,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:48:27,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:27,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:48:27,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:48:27,458 INFO L87 Difference]: Start difference. First operand 353 states and 442 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-08 22:48:27,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:27,651 INFO L93 Difference]: Finished difference Result 402 states and 467 transitions. [2025-03-08 22:48:27,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:48:27,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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 35 [2025-03-08 22:48:27,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:27,653 INFO L225 Difference]: With dead ends: 402 [2025-03-08 22:48:27,653 INFO L226 Difference]: Without dead ends: 402 [2025-03-08 22:48:27,653 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-08 22:48:27,654 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 163 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:27,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 371 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:27,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-08 22:48:27,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 353. [2025-03-08 22:48:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 294 states have (on average 1.435374149659864) internal successors, (422), 340 states have internal predecessors, (422), 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-08 22:48:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 440 transitions. [2025-03-08 22:48:27,661 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 440 transitions. Word has length 35 [2025-03-08 22:48:27,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:27,661 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 440 transitions. [2025-03-08 22:48:27,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-08 22:48:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 440 transitions. [2025-03-08 22:48:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 22:48:27,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:27,662 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-08 22:48:27,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 22:48:27,662 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-08 22:48:27,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:27,662 INFO L85 PathProgramCache]: Analyzing trace with hash -269402603, now seen corresponding path program 1 times [2025-03-08 22:48:27,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:27,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189650606] [2025-03-08 22:48:27,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:27,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:27,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 22:48:27,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 22:48:27,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:27,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:28,212 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-08 22:48:28,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:28,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189650606] [2025-03-08 22:48:28,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189650606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:28,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:28,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 22:48:28,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813198580] [2025-03-08 22:48:28,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:28,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:48:28,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:28,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:48:28,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:48:28,214 INFO L87 Difference]: Start difference. First operand 353 states and 440 transitions. Second operand has 12 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-08 22:48:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:28,564 INFO L93 Difference]: Finished difference Result 384 states and 472 transitions. [2025-03-08 22:48:28,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:48:28,565 INFO L78 Accepts]: Start accepts. Automaton has has 12 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-08 22:48:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:28,566 INFO L225 Difference]: With dead ends: 384 [2025-03-08 22:48:28,566 INFO L226 Difference]: Without dead ends: 384 [2025-03-08 22:48:28,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:48:28,567 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 80 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:28,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 832 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:28,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-08 22:48:28,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 375. [2025-03-08 22:48:28,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 316 states have (on average 1.4082278481012658) internal successors, (445), 362 states have internal predecessors, (445), 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-08 22:48:28,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 463 transitions. [2025-03-08 22:48:28,572 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 463 transitions. Word has length 49 [2025-03-08 22:48:28,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:28,573 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 463 transitions. [2025-03-08 22:48:28,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 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-08 22:48:28,573 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 463 transitions. [2025-03-08 22:48:28,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 22:48:28,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:28,573 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] [2025-03-08 22:48:28,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 22:48:28,573 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-08 22:48:28,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:28,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1506103167, now seen corresponding path program 1 times [2025-03-08 22:48:28,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:28,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456041342] [2025-03-08 22:48:28,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:28,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:28,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:48:28,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:48:28,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:28,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:29,069 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-08 22:48:29,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:29,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456041342] [2025-03-08 22:48:29,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456041342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:29,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:29,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 22:48:29,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470729442] [2025-03-08 22:48:29,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:29,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:48:29,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:29,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:48:29,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:48:29,071 INFO L87 Difference]: Start difference. First operand 375 states and 463 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-08 22:48:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:29,587 INFO L93 Difference]: Finished difference Result 472 states and 538 transitions. [2025-03-08 22:48:29,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:48:29,588 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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 50 [2025-03-08 22:48:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:29,589 INFO L225 Difference]: With dead ends: 472 [2025-03-08 22:48:29,589 INFO L226 Difference]: Without dead ends: 472 [2025-03-08 22:48:29,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2025-03-08 22:48:29,590 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 271 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:29,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1023 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:48:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-08 22:48:29,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 405. [2025-03-08 22:48:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 346 states have (on average 1.3872832369942196) internal successors, (480), 392 states have internal predecessors, (480), 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-08 22:48:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 498 transitions. [2025-03-08 22:48:29,597 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 498 transitions. Word has length 50 [2025-03-08 22:48:29,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:29,597 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 498 transitions. [2025-03-08 22:48:29,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-08 22:48:29,597 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 498 transitions. [2025-03-08 22:48:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 22:48:29,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:29,598 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] [2025-03-08 22:48:29,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 22:48:29,598 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-08 22:48:29,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:29,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2087388142, now seen corresponding path program 1 times [2025-03-08 22:48:29,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:29,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368795603] [2025-03-08 22:48:29,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:29,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:29,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:48:29,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:48:29,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:29,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:30,296 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-08 22:48:30,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:30,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368795603] [2025-03-08 22:48:30,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368795603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:30,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241277386] [2025-03-08 22:48:30,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:30,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:30,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:30,299 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:30,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:48:30,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:48:30,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:48:30,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:30,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:30,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-08 22:48:30,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:30,595 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:48:30,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 22:48:30,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:48:30,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:48:30,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 16 treesize of output 11 [2025-03-08 22:48:30,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 22:48:30,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:48:30,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 22:48:30,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:48:30,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 22:48:31,030 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-08 22:48:31,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:31,193 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_237 (Array Int Int)) (v_ArrVal_239 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_237))) (store .cse0 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse0 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| v_ArrVal_239))) |c_~#list~0.base|) |c_~#list~0.offset|) 0)) (forall ((v_ArrVal_238 (Array Int Int)) (|ULTIMATE.start_create_item_~item~0#1.offset| Int)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_238))) (store .cse1 |c_ULTIMATE.start_create_item_~cursor#1.base| (store (select .cse1 |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset| |ULTIMATE.start_create_item_~item~0#1.offset|))) |c_~#list~0.base|) |c_~#list~0.offset|) 0))) is different from false [2025-03-08 22:48:32,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241277386] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:32,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:48:32,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 23 [2025-03-08 22:48:32,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141451642] [2025-03-08 22:48:32,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:32,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 22:48:32,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:32,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 22:48:32,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=626, Unknown=3, NotChecked=52, Total=812 [2025-03-08 22:48:32,900 INFO L87 Difference]: Start difference. First operand 405 states and 498 transitions. Second operand has 23 states, 23 states have (on average 3.782608695652174) internal successors, (87), 21 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:48:33,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:33,745 INFO L93 Difference]: Finished difference Result 760 states and 908 transitions. [2025-03-08 22:48:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 22:48:33,745 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.782608695652174) internal successors, (87), 21 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2025-03-08 22:48:33,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:33,747 INFO L225 Difference]: With dead ends: 760 [2025-03-08 22:48:33,747 INFO L226 Difference]: Without dead ends: 760 [2025-03-08 22:48:33,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=300, Invalid=1341, Unknown=3, NotChecked=78, Total=1722 [2025-03-08 22:48:33,748 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 487 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:33,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1991 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 22:48:33,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-03-08 22:48:33,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 526. [2025-03-08 22:48:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 459 states have (on average 1.3965141612200436) internal successors, (641), 508 states have internal predecessors, (641), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 12 states have call predecessors, (20), 10 states have call successors, (20) [2025-03-08 22:48:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 671 transitions. [2025-03-08 22:48:33,757 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 671 transitions. Word has length 50 [2025-03-08 22:48:33,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:33,757 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 671 transitions. [2025-03-08 22:48:33,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.782608695652174) internal successors, (87), 21 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:48:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 671 transitions. [2025-03-08 22:48:33,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 22:48:33,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:33,758 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] [2025-03-08 22:48:33,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:48:33,958 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,SelfDestructingSolverStorable34 [2025-03-08 22:48:33,959 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-08 22:48:33,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:33,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2087388494, now seen corresponding path program 1 times [2025-03-08 22:48:33,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:33,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466890338] [2025-03-08 22:48:33,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:33,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:33,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:48:33,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:48:33,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:33,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:34,563 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-08 22:48:34,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:34,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466890338] [2025-03-08 22:48:34,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466890338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:34,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:34,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 22:48:34,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497421972] [2025-03-08 22:48:34,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:34,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 22:48:34,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:34,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 22:48:34,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:48:34,565 INFO L87 Difference]: Start difference. First operand 526 states and 671 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 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-08 22:48:35,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:35,233 INFO L93 Difference]: Finished difference Result 488 states and 557 transitions. [2025-03-08 22:48:35,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 22:48:35,233 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 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 50 [2025-03-08 22:48:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:35,234 INFO L225 Difference]: With dead ends: 488 [2025-03-08 22:48:35,234 INFO L226 Difference]: Without dead ends: 488 [2025-03-08 22:48:35,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2025-03-08 22:48:35,235 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 281 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:35,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1384 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:48:35,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-08 22:48:35,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 400. [2025-03-08 22:48:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 341 states have (on average 1.401759530791789) internal successors, (478), 387 states have internal predecessors, (478), 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-08 22:48:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 496 transitions. [2025-03-08 22:48:35,240 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 496 transitions. Word has length 50 [2025-03-08 22:48:35,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:35,240 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 496 transitions. [2025-03-08 22:48:35,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 17 states have internal predecessors, (48), 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-08 22:48:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 496 transitions. [2025-03-08 22:48:35,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:48:35,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:35,240 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-08 22:48:35,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 22:48:35,241 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-08 22:48:35,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:35,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2106554373, now seen corresponding path program 1 times [2025-03-08 22:48:35,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:35,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550146499] [2025-03-08 22:48:35,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:35,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:35,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:48:35,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:48:35,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:35,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:35,695 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-08 22:48:35,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:35,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550146499] [2025-03-08 22:48:35,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550146499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:35,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:35,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 22:48:35,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745315431] [2025-03-08 22:48:35,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:35,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 22:48:35,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:35,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 22:48:35,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:48:35,697 INFO L87 Difference]: Start difference. First operand 400 states and 496 transitions. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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-08 22:48:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:36,231 INFO L93 Difference]: Finished difference Result 698 states and 854 transitions. [2025-03-08 22:48:36,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 22:48:36,232 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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-08 22:48:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:36,233 INFO L225 Difference]: With dead ends: 698 [2025-03-08 22:48:36,233 INFO L226 Difference]: Without dead ends: 698 [2025-03-08 22:48:36,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2025-03-08 22:48:36,234 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 419 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:36,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1547 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:48:36,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-08 22:48:36,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 491. [2025-03-08 22:48:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 425 states have (on average 1.383529411764706) internal successors, (588), 474 states have internal predecessors, (588), 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-08 22:48:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 618 transitions. [2025-03-08 22:48:36,240 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 618 transitions. Word has length 51 [2025-03-08 22:48:36,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:36,241 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 618 transitions. [2025-03-08 22:48:36,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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-08 22:48:36,241 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 618 transitions. [2025-03-08 22:48:36,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:48:36,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:36,241 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-08 22:48:36,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 22:48:36,242 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-08 22:48:36,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:36,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2106554372, now seen corresponding path program 1 times [2025-03-08 22:48:36,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:36,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286063632] [2025-03-08 22:48:36,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:36,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:36,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:48:36,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:48:36,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:36,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:36,689 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-08 22:48:36,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:36,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286063632] [2025-03-08 22:48:36,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286063632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:36,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:36,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 22:48:36,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743335281] [2025-03-08 22:48:36,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:36,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:48:36,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:36,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:48:36,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:48:36,692 INFO L87 Difference]: Start difference. First operand 491 states and 618 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 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-08 22:48:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:37,187 INFO L93 Difference]: Finished difference Result 832 states and 1050 transitions. [2025-03-08 22:48:37,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:48:37,187 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 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-08 22:48:37,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:37,189 INFO L225 Difference]: With dead ends: 832 [2025-03-08 22:48:37,189 INFO L226 Difference]: Without dead ends: 832 [2025-03-08 22:48:37,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:48:37,190 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 328 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:37,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1134 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:48:37,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-08 22:48:37,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 644. [2025-03-08 22:48:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 562 states have (on average 1.405693950177936) internal successors, (790), 619 states have internal predecessors, (790), 18 states have call successors, (18), 9 states have call predecessors, (18), 18 states have return successors, (36), 15 states have call predecessors, (36), 18 states have call successors, (36) [2025-03-08 22:48:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 844 transitions. [2025-03-08 22:48:37,202 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 844 transitions. Word has length 51 [2025-03-08 22:48:37,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:37,203 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 844 transitions. [2025-03-08 22:48:37,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 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-08 22:48:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 844 transitions. [2025-03-08 22:48:37,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:48:37,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:37,203 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-08 22:48:37,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 22:48:37,204 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-08 22:48:37,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:37,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2106554725, now seen corresponding path program 1 times [2025-03-08 22:48:37,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:37,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451534636] [2025-03-08 22:48:37,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:37,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:37,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:48:37,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:48:37,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:37,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:37,641 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-08 22:48:37,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:37,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451534636] [2025-03-08 22:48:37,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451534636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:37,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:37,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 22:48:37,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970996669] [2025-03-08 22:48:37,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:37,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 22:48:37,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:37,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 22:48:37,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:48:37,642 INFO L87 Difference]: Start difference. First operand 644 states and 844 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 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-08 22:48:37,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:37,944 INFO L93 Difference]: Finished difference Result 947 states and 1223 transitions. [2025-03-08 22:48:37,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 22:48:37,944 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 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-08 22:48:37,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:37,946 INFO L225 Difference]: With dead ends: 947 [2025-03-08 22:48:37,946 INFO L226 Difference]: Without dead ends: 947 [2025-03-08 22:48:37,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:48:37,947 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 481 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:37,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1616 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:37,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-08 22:48:37,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 744. [2025-03-08 22:48:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 654 states have (on average 1.437308868501529) internal successors, (940), 715 states have internal predecessors, (940), 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-08 22:48:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1006 transitions. [2025-03-08 22:48:37,955 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1006 transitions. Word has length 51 [2025-03-08 22:48:37,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:37,955 INFO L471 AbstractCegarLoop]: Abstraction has 744 states and 1006 transitions. [2025-03-08 22:48:37,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 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-08 22:48:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1006 transitions. [2025-03-08 22:48:37,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:48:37,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:37,956 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-08 22:48:37,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 22:48:37,956 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-08 22:48:37,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:37,957 INFO L85 PathProgramCache]: Analyzing trace with hash -2105630852, now seen corresponding path program 1 times [2025-03-08 22:48:37,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:37,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042035486] [2025-03-08 22:48:37,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:37,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:37,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:48:37,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:48:37,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:37,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:38,103 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-08 22:48:38,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:38,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042035486] [2025-03-08 22:48:38,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042035486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:38,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:38,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:48:38,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775688343] [2025-03-08 22:48:38,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:38,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:48:38,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:38,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:48:38,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:48:38,105 INFO L87 Difference]: Start difference. First operand 744 states and 1006 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) 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-08 22:48:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:38,386 INFO L93 Difference]: Finished difference Result 1226 states and 1667 transitions. [2025-03-08 22:48:38,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:48:38,386 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) 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-08 22:48:38,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:38,389 INFO L225 Difference]: With dead ends: 1226 [2025-03-08 22:48:38,389 INFO L226 Difference]: Without dead ends: 1226 [2025-03-08 22:48:38,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:48:38,390 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 166 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:38,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1042 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:48:38,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-03-08 22:48:38,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 964. [2025-03-08 22:48:38,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 842 states have (on average 1.4180522565320666) internal successors, (1194), 919 states have internal predecessors, (1194), 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-08 22:48:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1308 transitions. [2025-03-08 22:48:38,401 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1308 transitions. Word has length 51 [2025-03-08 22:48:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:38,401 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1308 transitions. [2025-03-08 22:48:38,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) 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-08 22:48:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1308 transitions. [2025-03-08 22:48:38,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:48:38,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:38,401 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-08 22:48:38,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 22:48:38,402 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-08 22:48:38,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:38,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2105630851, now seen corresponding path program 1 times [2025-03-08 22:48:38,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:38,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578818888] [2025-03-08 22:48:38,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:38,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:38,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:48:38,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:48:38,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:38,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:39,340 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-08 22:48:39,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:39,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578818888] [2025-03-08 22:48:39,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578818888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:39,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599489807] [2025-03-08 22:48:39,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:39,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:39,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:39,343 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:39,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:48:39,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:48:39,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:48:39,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:39,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:39,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 22:48:39,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:39,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:48:39,830 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-08 22:48:39,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:48:40,019 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:48:40,020 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-08 22:48:40,023 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:48:40,023 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-08 22:48:40,070 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-08 22:48:40,070 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:40,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599489807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:40,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:48:40,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 27 [2025-03-08 22:48:40,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210882141] [2025-03-08 22:48:40,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:40,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:48:40,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:40,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:48:40,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2025-03-08 22:48:40,071 INFO L87 Difference]: Start difference. First operand 964 states and 1308 transitions. Second operand has 11 states, 10 states have (on average 4.9) 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-08 22:48:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:40,450 INFO L93 Difference]: Finished difference Result 1259 states and 1694 transitions. [2025-03-08 22:48:40,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:48:40,452 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) 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-08 22:48:40,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:40,454 INFO L225 Difference]: With dead ends: 1259 [2025-03-08 22:48:40,454 INFO L226 Difference]: Without dead ends: 1259 [2025-03-08 22:48:40,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2025-03-08 22:48:40,455 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 358 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:40,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1131 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:48:40,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2025-03-08 22:48:40,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1062. [2025-03-08 22:48:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 932 states have (on average 1.44206008583691) internal successors, (1344), 1013 states have internal predecessors, (1344), 42 states have call successors, (42), 21 states have call predecessors, (42), 42 states have return successors, (84), 27 states have call predecessors, (84), 42 states have call successors, (84) [2025-03-08 22:48:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1470 transitions. [2025-03-08 22:48:40,471 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1470 transitions. Word has length 51 [2025-03-08 22:48:40,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:40,471 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1470 transitions. [2025-03-08 22:48:40,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) 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-08 22:48:40,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1470 transitions. [2025-03-08 22:48:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:48:40,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:40,472 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-08 22:48:40,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:40,673 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,SelfDestructingSolverStorable40 [2025-03-08 22:48:40,673 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-08 22:48:40,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:40,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2105631204, now seen corresponding path program 1 times [2025-03-08 22:48:40,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:40,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500401855] [2025-03-08 22:48:40,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:40,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:40,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:48:40,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:48:40,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:40,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:40,810 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-08 22:48:40,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:40,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500401855] [2025-03-08 22:48:40,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500401855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:40,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:40,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:48:40,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533246837] [2025-03-08 22:48:40,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:40,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:48:40,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:40,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:48:40,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:48:40,813 INFO L87 Difference]: Start difference. First operand 1062 states and 1470 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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-08 22:48:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:40,968 INFO L93 Difference]: Finished difference Result 1374 states and 1877 transitions. [2025-03-08 22:48:40,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:48:40,968 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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-08 22:48:40,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:40,971 INFO L225 Difference]: With dead ends: 1374 [2025-03-08 22:48:40,971 INFO L226 Difference]: Without dead ends: 1374 [2025-03-08 22:48:40,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:48:40,972 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 160 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:40,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1243 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:48:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2025-03-08 22:48:40,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1148. [2025-03-08 22:48:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1010 states have (on average 1.4613861386138614) internal successors, (1476), 1095 states have internal predecessors, (1476), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 29 states have call predecessors, (92), 46 states have call successors, (92) [2025-03-08 22:48:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1614 transitions. [2025-03-08 22:48:40,987 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1614 transitions. Word has length 51 [2025-03-08 22:48:40,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:40,987 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1614 transitions. [2025-03-08 22:48:40,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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-08 22:48:40,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1614 transitions. [2025-03-08 22:48:40,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:48:40,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:40,988 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-08 22:48:40,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 22:48:40,988 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-08 22:48:40,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:40,989 INFO L85 PathProgramCache]: Analyzing trace with hash -908916804, now seen corresponding path program 1 times [2025-03-08 22:48:40,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:40,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292829091] [2025-03-08 22:48:40,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:40,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:40,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:48:41,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:48:41,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:41,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:41,149 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-08 22:48:41,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:41,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292829091] [2025-03-08 22:48:41,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292829091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:41,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:41,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 22:48:41,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396480753] [2025-03-08 22:48:41,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:41,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:48:41,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:41,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:48:41,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:48:41,150 INFO L87 Difference]: Start difference. First operand 1148 states and 1614 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 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-08 22:48:41,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:41,389 INFO L93 Difference]: Finished difference Result 1403 states and 1951 transitions. [2025-03-08 22:48:41,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:48:41,393 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 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-08 22:48:41,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:41,396 INFO L225 Difference]: With dead ends: 1403 [2025-03-08 22:48:41,396 INFO L226 Difference]: Without dead ends: 1403 [2025-03-08 22:48:41,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-08 22:48:41,396 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 290 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:41,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 892 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:41,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-03-08 22:48:41,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1177. [2025-03-08 22:48:41,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1035 states have (on average 1.4608695652173913) internal successors, (1512), 1122 states have internal predecessors, (1512), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 30 states have call predecessors, (96), 48 states have call successors, (96) [2025-03-08 22:48:41,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1656 transitions. [2025-03-08 22:48:41,409 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1656 transitions. Word has length 51 [2025-03-08 22:48:41,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:41,410 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1656 transitions. [2025-03-08 22:48:41,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 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-08 22:48:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1656 transitions. [2025-03-08 22:48:41,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:48:41,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:41,411 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-08 22:48:41,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 22:48:41,411 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-08 22:48:41,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash -908917156, now seen corresponding path program 1 times [2025-03-08 22:48:41,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:41,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814676786] [2025-03-08 22:48:41,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:41,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:41,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:48:41,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:48:41,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:41,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:41,611 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-08 22:48:41,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:41,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814676786] [2025-03-08 22:48:41,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814676786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:41,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:41,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 22:48:41,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403651522] [2025-03-08 22:48:41,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:41,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:48:41,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:41,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:48:41,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:48:41,612 INFO L87 Difference]: Start difference. First operand 1177 states and 1656 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 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-08 22:48:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:41,856 INFO L93 Difference]: Finished difference Result 1370 states and 1869 transitions. [2025-03-08 22:48:41,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:48:41,857 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 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-08 22:48:41,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:41,860 INFO L225 Difference]: With dead ends: 1370 [2025-03-08 22:48:41,860 INFO L226 Difference]: Without dead ends: 1370 [2025-03-08 22:48:41,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:48:41,860 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 399 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:41,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1271 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:41,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2025-03-08 22:48:41,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 945. [2025-03-08 22:48:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 827 states have (on average 1.4582829504232164) internal successors, (1206), 902 states have internal predecessors, (1206), 36 states have call successors, (36), 18 states have call predecessors, (36), 36 states have return successors, (72), 24 states have call predecessors, (72), 36 states have call successors, (72) [2025-03-08 22:48:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1314 transitions. [2025-03-08 22:48:41,870 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1314 transitions. Word has length 51 [2025-03-08 22:48:41,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:41,870 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1314 transitions. [2025-03-08 22:48:41,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 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-08 22:48:41,870 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1314 transitions. [2025-03-08 22:48:41,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:48:41,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:41,871 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-08 22:48:41,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 22:48:41,871 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-08 22:48:41,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:41,871 INFO L85 PathProgramCache]: Analyzing trace with hash -907993283, now seen corresponding path program 1 times [2025-03-08 22:48:41,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:41,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373659441] [2025-03-08 22:48:41,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:41,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:41,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:48:41,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:48:41,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:41,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:42,160 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-08 22:48:42,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:42,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373659441] [2025-03-08 22:48:42,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373659441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:42,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709631188] [2025-03-08 22:48:42,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:42,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:42,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:42,163 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:42,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:48:42,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:48:42,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:48:42,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:42,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:42,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 22:48:42,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:42,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:48:42,489 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-08 22:48:42,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:48:42,526 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-08 22:48:42,582 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-08 22:48:42,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-08 22:48:42,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:42,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709631188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:42,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:48:42,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2025-03-08 22:48:42,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398385354] [2025-03-08 22:48:42,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:42,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:48:42,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:42,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:48:42,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:48:42,588 INFO L87 Difference]: Start difference. First operand 945 states and 1314 transitions. Second operand has 11 states, 10 states have (on average 4.9) internal successors, (49), 9 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-08 22:48:43,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:43,013 INFO L93 Difference]: Finished difference Result 1376 states and 1874 transitions. [2025-03-08 22:48:43,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:48:43,013 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 9 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-08 22:48:43,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:43,016 INFO L225 Difference]: With dead ends: 1376 [2025-03-08 22:48:43,016 INFO L226 Difference]: Without dead ends: 1376 [2025-03-08 22:48:43,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2025-03-08 22:48:43,017 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 278 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:43,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1807 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 22:48:43,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2025-03-08 22:48:43,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1121. [2025-03-08 22:48:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 987 states have (on average 1.4437689969604863) internal successors, (1425), 1070 states have internal predecessors, (1425), 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-08 22:48:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1557 transitions. [2025-03-08 22:48:43,027 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1557 transitions. Word has length 51 [2025-03-08 22:48:43,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:43,027 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1557 transitions. [2025-03-08 22:48:43,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 9 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-08 22:48:43,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1557 transitions. [2025-03-08 22:48:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:48:43,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:43,028 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-08 22:48:43,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:43,228 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-08 22:48:43,228 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-08 22:48:43,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:43,228 INFO L85 PathProgramCache]: Analyzing trace with hash -907993282, now seen corresponding path program 1 times [2025-03-08 22:48:43,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:43,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941621419] [2025-03-08 22:48:43,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:43,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:43,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:48:43,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:48:43,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:43,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:43,624 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-08 22:48:43,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:43,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941621419] [2025-03-08 22:48:43,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941621419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:43,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382631535] [2025-03-08 22:48:43,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:43,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:43,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:43,626 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:43,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:48:43,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:48:43,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:48:43,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:43,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:43,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-08 22:48:43,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:43,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:48:44,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:44,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:44,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 22:48:44,167 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 20 [2025-03-08 22:48:44,322 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 28 treesize of output 12 [2025-03-08 22:48:44,356 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-08 22:48:44,356 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:44,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382631535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:44,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:48:44,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 25 [2025-03-08 22:48:44,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774846335] [2025-03-08 22:48:44,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:44,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:48:44,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:44,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:48:44,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2025-03-08 22:48:44,357 INFO L87 Difference]: Start difference. First operand 1121 states and 1557 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 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-08 22:48:44,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:44,961 INFO L93 Difference]: Finished difference Result 1402 states and 1900 transitions. [2025-03-08 22:48:44,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 22:48:44,962 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 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-08 22:48:44,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:44,965 INFO L225 Difference]: With dead ends: 1402 [2025-03-08 22:48:44,965 INFO L226 Difference]: Without dead ends: 1402 [2025-03-08 22:48:44,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-03-08 22:48:44,965 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 321 mSDsluCounter, 2093 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 2376 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:44,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 2376 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:48:44,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-03-08 22:48:44,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1175. [2025-03-08 22:48:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1037 states have (on average 1.454194792671167) internal successors, (1508), 1122 states have internal predecessors, (1508), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 29 states have call predecessors, (92), 46 states have call successors, (92) [2025-03-08 22:48:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1646 transitions. [2025-03-08 22:48:44,975 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1646 transitions. Word has length 51 [2025-03-08 22:48:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:44,975 INFO L471 AbstractCegarLoop]: Abstraction has 1175 states and 1646 transitions. [2025-03-08 22:48:44,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 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-08 22:48:44,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1646 transitions. [2025-03-08 22:48:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 22:48:44,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:44,977 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-08 22:48:44,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:45,181 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-08 22:48:45,181 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-08 22:48:45,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash -907993635, now seen corresponding path program 1 times [2025-03-08 22:48:45,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:45,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342535078] [2025-03-08 22:48:45,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:45,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:45,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:48:45,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:48:45,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:45,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:45,281 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-08 22:48:45,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:45,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342535078] [2025-03-08 22:48:45,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342535078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:45,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:45,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:48:45,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755287099] [2025-03-08 22:48:45,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:45,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:48:45,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:45,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:48:45,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:48:45,282 INFO L87 Difference]: Start difference. First operand 1175 states and 1646 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 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-08 22:48:45,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:45,505 INFO L93 Difference]: Finished difference Result 1435 states and 1966 transitions. [2025-03-08 22:48:45,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:48:45,505 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 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-08 22:48:45,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:45,511 INFO L225 Difference]: With dead ends: 1435 [2025-03-08 22:48:45,511 INFO L226 Difference]: Without dead ends: 1435 [2025-03-08 22:48:45,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:48:45,511 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 143 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:45,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1379 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:45,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2025-03-08 22:48:45,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 956. [2025-03-08 22:48:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 842 states have (on average 1.4394299287410925) internal successors, (1212), 915 states have internal predecessors, (1212), 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-08 22:48:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1314 transitions. [2025-03-08 22:48:45,520 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1314 transitions. Word has length 51 [2025-03-08 22:48:45,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:45,520 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1314 transitions. [2025-03-08 22:48:45,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 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-08 22:48:45,520 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1314 transitions. [2025-03-08 22:48:45,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 22:48:45,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:45,521 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, 1, 1] [2025-03-08 22:48:45,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-08 22:48:45,521 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-08 22:48:45,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:45,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1700787155, now seen corresponding path program 1 times [2025-03-08 22:48:45,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:45,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135128921] [2025-03-08 22:48:45,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:45,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:45,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 22:48:45,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 22:48:45,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:45,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:45,850 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-08 22:48:45,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:45,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135128921] [2025-03-08 22:48:45,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135128921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:45,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:45,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 22:48:45,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385453126] [2025-03-08 22:48:45,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:45,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 22:48:45,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:45,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 22:48:45,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:48:45,851 INFO L87 Difference]: Start difference. First operand 956 states and 1314 transitions. Second operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 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-08 22:48:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:46,142 INFO L93 Difference]: Finished difference Result 1416 states and 1913 transitions. [2025-03-08 22:48:46,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 22:48:46,142 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 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 54 [2025-03-08 22:48:46,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:46,147 INFO L225 Difference]: With dead ends: 1416 [2025-03-08 22:48:46,147 INFO L226 Difference]: Without dead ends: 1416 [2025-03-08 22:48:46,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:48:46,150 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 511 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:46,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1343 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:46,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2025-03-08 22:48:46,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1189. [2025-03-08 22:48:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 1051 states have (on average 1.450047573739296) internal successors, (1524), 1136 states have internal predecessors, (1524), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 29 states have call predecessors, (92), 46 states have call successors, (92) [2025-03-08 22:48:46,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1662 transitions. [2025-03-08 22:48:46,160 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1662 transitions. Word has length 54 [2025-03-08 22:48:46,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:46,160 INFO L471 AbstractCegarLoop]: Abstraction has 1189 states and 1662 transitions. [2025-03-08 22:48:46,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 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-08 22:48:46,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1662 transitions. [2025-03-08 22:48:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 22:48:46,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:46,161 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, 1, 1] [2025-03-08 22:48:46,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-08 22:48:46,161 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-08 22:48:46,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:46,161 INFO L85 PathProgramCache]: Analyzing trace with hash -851369806, now seen corresponding path program 1 times [2025-03-08 22:48:46,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:46,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49233133] [2025-03-08 22:48:46,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:46,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:46,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 22:48:46,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 22:48:46,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:46,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:46,361 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-08 22:48:46,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:46,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49233133] [2025-03-08 22:48:46,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49233133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:46,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462653404] [2025-03-08 22:48:46,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:46,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:46,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:46,364 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:46,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:48:46,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 22:48:46,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 22:48:46,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:46,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:46,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 22:48:46,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:46,721 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-08 22:48:46,839 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:48:46,839 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-08 22:48:46,850 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-08 22:48:46,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:46,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462653404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:46,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:48:46,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2025-03-08 22:48:46,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455577410] [2025-03-08 22:48:46,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:46,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:48:46,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:46,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:48:46,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:48:46,854 INFO L87 Difference]: Start difference. First operand 1189 states and 1662 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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-08 22:48:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:47,108 INFO L93 Difference]: Finished difference Result 1521 states and 2083 transitions. [2025-03-08 22:48:47,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:48:47,108 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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 54 [2025-03-08 22:48:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:47,111 INFO L225 Difference]: With dead ends: 1521 [2025-03-08 22:48:47,111 INFO L226 Difference]: Without dead ends: 1521 [2025-03-08 22:48:47,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:48:47,111 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 261 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:47,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 961 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2025-03-08 22:48:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1290. [2025-03-08 22:48:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1140 states have (on average 1.4543859649122808) internal successors, (1658), 1231 states have internal predecessors, (1658), 52 states have call successors, (52), 26 states have call predecessors, (52), 52 states have return successors, (104), 32 states have call predecessors, (104), 52 states have call successors, (104) [2025-03-08 22:48:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1814 transitions. [2025-03-08 22:48:47,122 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1814 transitions. Word has length 54 [2025-03-08 22:48:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:47,122 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 1814 transitions. [2025-03-08 22:48:47,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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-08 22:48:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1814 transitions. [2025-03-08 22:48:47,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 22:48:47,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:47,122 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, 1, 1] [2025-03-08 22:48:47,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:48:47,327 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,SelfDestructingSolverStorable48 [2025-03-08 22:48:47,327 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-08 22:48:47,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:47,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2066689934, now seen corresponding path program 1 times [2025-03-08 22:48:47,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:47,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799202441] [2025-03-08 22:48:47,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:47,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:47,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 22:48:47,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 22:48:47,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:47,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:47,477 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-08 22:48:47,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:47,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799202441] [2025-03-08 22:48:47,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799202441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:47,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:47,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:48:47,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153340129] [2025-03-08 22:48:47,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:47,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:48:47,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:47,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:48:47,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:48:47,478 INFO L87 Difference]: Start difference. First operand 1290 states and 1814 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 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-08 22:48:47,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:47,692 INFO L93 Difference]: Finished difference Result 1517 states and 2075 transitions. [2025-03-08 22:48:47,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:48:47,692 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 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 54 [2025-03-08 22:48:47,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:47,694 INFO L225 Difference]: With dead ends: 1517 [2025-03-08 22:48:47,694 INFO L226 Difference]: Without dead ends: 1517 [2025-03-08 22:48:47,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:48:47,695 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 274 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:47,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 934 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:47,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2025-03-08 22:48:47,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1080. [2025-03-08 22:48:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 954 states have (on average 1.4444444444444444) internal successors, (1378), 1033 states have internal predecessors, (1378), 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-08 22:48:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1498 transitions. [2025-03-08 22:48:47,704 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1498 transitions. Word has length 54 [2025-03-08 22:48:47,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:47,704 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1498 transitions. [2025-03-08 22:48:47,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 11 states have internal predecessors, (52), 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-08 22:48:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1498 transitions. [2025-03-08 22:48:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 22:48:47,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:47,705 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, 1, 1] [2025-03-08 22:48:47,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-08 22:48:47,705 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-08 22:48:47,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:47,705 INFO L85 PathProgramCache]: Analyzing trace with hash -323879599, now seen corresponding path program 1 times [2025-03-08 22:48:47,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:47,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467912435] [2025-03-08 22:48:47,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:47,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:47,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 22:48:47,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 22:48:47,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:47,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:47,960 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-08 22:48:47,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:47,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467912435] [2025-03-08 22:48:47,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467912435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:47,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884442519] [2025-03-08 22:48:47,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:47,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:47,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:47,962 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:47,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:48:48,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 22:48:48,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 22:48:48,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:48,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:48,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 22:48:48,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:48,276 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-08 22:48:48,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:48:48,322 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-08 22:48:48,397 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-08 22:48:48,404 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-08 22:48:48,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:48:48,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884442519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:48,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:48:48,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2025-03-08 22:48:48,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688127807] [2025-03-08 22:48:48,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:48,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:48:48,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:48,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:48:48,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:48:48,405 INFO L87 Difference]: Start difference. First operand 1080 states and 1498 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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-08 22:48:48,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:48,746 INFO L93 Difference]: Finished difference Result 1421 states and 1922 transitions. [2025-03-08 22:48:48,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:48:48,746 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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 54 [2025-03-08 22:48:48,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:48,748 INFO L225 Difference]: With dead ends: 1421 [2025-03-08 22:48:48,748 INFO L226 Difference]: Without dead ends: 1421 [2025-03-08 22:48:48,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2025-03-08 22:48:48,749 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 296 mSDsluCounter, 1644 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1895 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:48,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1895 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:48:48,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2025-03-08 22:48:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1069. [2025-03-08 22:48:48,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 943 states have (on average 1.4464475079533403) internal successors, (1364), 1022 states have internal predecessors, (1364), 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-08 22:48:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1484 transitions. [2025-03-08 22:48:48,760 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1484 transitions. Word has length 54 [2025-03-08 22:48:48,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:48,760 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1484 transitions. [2025-03-08 22:48:48,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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-08 22:48:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1484 transitions. [2025-03-08 22:48:48,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 22:48:48,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:48,760 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, 1, 1] [2025-03-08 22:48:48,767 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-08 22:48:48,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:48,961 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-08 22:48:48,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:48,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1047084071, now seen corresponding path program 1 times [2025-03-08 22:48:48,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:48,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484397556] [2025-03-08 22:48:48,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:48,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:48,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:48:48,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:48:48,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:48,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:48:49,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:49,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484397556] [2025-03-08 22:48:49,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484397556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:49,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136286509] [2025-03-08 22:48:49,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:49,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:49,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:49,260 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:49,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:48:49,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:48:49,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:48:49,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:49,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:49,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-08 22:48:49,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:49,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:49,494 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-08 22:48:49,575 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2025-03-08 22:48:49,575 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 25 treesize of output 28 [2025-03-08 22:48:49,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:48:49,620 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-08 22:48:49,621 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-08 22:48:49,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:49,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136286509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:49,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:48:49,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2025-03-08 22:48:49,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755908915] [2025-03-08 22:48:49,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:49,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 22:48:49,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:49,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 22:48:49,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2025-03-08 22:48:49,690 INFO L87 Difference]: Start difference. First operand 1069 states and 1484 transitions. Second operand has 21 states, 20 states have (on average 5.1) internal successors, (102), 19 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:48:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:50,427 INFO L93 Difference]: Finished difference Result 1549 states and 2083 transitions. [2025-03-08 22:48:50,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 22:48:50,427 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.1) internal successors, (102), 19 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 56 [2025-03-08 22:48:50,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:50,429 INFO L225 Difference]: With dead ends: 1549 [2025-03-08 22:48:50,429 INFO L226 Difference]: Without dead ends: 1549 [2025-03-08 22:48:50,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=1432, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 22:48:50,430 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 924 mSDsluCounter, 1959 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:50,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 2115 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:48:50,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2025-03-08 22:48:50,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1089. [2025-03-08 22:48:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 963 states have (on average 1.442367601246106) internal successors, (1389), 1040 states have internal predecessors, (1389), 40 states have call successors, (40), 20 states have call predecessors, (40), 40 states have return successors, (80), 28 states have call predecessors, (80), 40 states have call successors, (80) [2025-03-08 22:48:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1509 transitions. [2025-03-08 22:48:50,439 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1509 transitions. Word has length 56 [2025-03-08 22:48:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:50,439 INFO L471 AbstractCegarLoop]: Abstraction has 1089 states and 1509 transitions. [2025-03-08 22:48:50,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.1) internal successors, (102), 19 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:48:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1509 transitions. [2025-03-08 22:48:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 22:48:50,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:50,440 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, 1, 1] [2025-03-08 22:48:50,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 22:48:50,640 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-08 22:48:50,640 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-08 22:48:50,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:50,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1047084070, now seen corresponding path program 1 times [2025-03-08 22:48:50,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:50,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412188638] [2025-03-08 22:48:50,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:50,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:50,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:48:50,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:48:50,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:50,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:51,371 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-08 22:48:51,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:51,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412188638] [2025-03-08 22:48:51,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412188638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:51,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345343094] [2025-03-08 22:48:51,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:51,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:51,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:51,374 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:51,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 22:48:51,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:48:51,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:48:51,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:51,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:51,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-08 22:48:51,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:51,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:48:51,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:51,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:51,775 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 36 treesize of output 27 [2025-03-08 22:48:51,781 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 11 [2025-03-08 22:48:51,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:48:51,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 17 [2025-03-08 22:48:51,864 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-03-08 22:48:51,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2025-03-08 22:48:52,012 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 30 treesize of output 12 [2025-03-08 22:48:52,040 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-08 22:48:52,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:52,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345343094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:52,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:48:52,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 30 [2025-03-08 22:48:52,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918303142] [2025-03-08 22:48:52,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:52,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 22:48:52,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:52,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 22:48:52,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1138, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 22:48:52,209 INFO L87 Difference]: Start difference. First operand 1089 states and 1509 transitions. Second operand has 31 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 29 states have internal predecessors, (101), 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-08 22:48:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:54,765 INFO L93 Difference]: Finished difference Result 2006 states and 2669 transitions. [2025-03-08 22:48:54,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 22:48:54,766 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 29 states have internal predecessors, (101), 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) Word has length 56 [2025-03-08 22:48:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:54,768 INFO L225 Difference]: With dead ends: 2006 [2025-03-08 22:48:54,768 INFO L226 Difference]: Without dead ends: 2006 [2025-03-08 22:48:54,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1440 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=809, Invalid=5353, Unknown=0, NotChecked=0, Total=6162 [2025-03-08 22:48:54,769 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1011 mSDsluCounter, 2541 mSDsCounter, 0 mSdLazyCounter, 2572 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 2682 SdHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:54,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 2682 Invalid, 2614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2572 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 22:48:54,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2025-03-08 22:48:54,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1235. [2025-03-08 22:48:54,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1093 states have (on average 1.425434583714547) internal successors, (1558), 1174 states have internal predecessors, (1558), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 36 states have call predecessors, (96), 48 states have call successors, (96) [2025-03-08 22:48:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1702 transitions. [2025-03-08 22:48:54,791 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1702 transitions. Word has length 56 [2025-03-08 22:48:54,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:54,791 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1702 transitions. [2025-03-08 22:48:54,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 29 states have internal predecessors, (101), 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-08 22:48:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1702 transitions. [2025-03-08 22:48:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 22:48:54,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:54,792 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:54,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 22:48:54,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2025-03-08 22:48:54,993 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-08 22:48:54,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:54,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1240559865, now seen corresponding path program 1 times [2025-03-08 22:48:54,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:54,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187806433] [2025-03-08 22:48:54,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:54,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:55,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:48:55,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:48:55,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:55,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:48:55,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:55,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187806433] [2025-03-08 22:48:55,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187806433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:48:55,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:48:55,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 22:48:55,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595726397] [2025-03-08 22:48:55,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:48:55,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:48:55,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:55,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:48:55,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:48:55,206 INFO L87 Difference]: Start difference. First operand 1235 states and 1702 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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-08 22:48:55,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:48:55,475 INFO L93 Difference]: Finished difference Result 1493 states and 2022 transitions. [2025-03-08 22:48:55,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:48:55,475 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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) Word has length 56 [2025-03-08 22:48:55,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:48:55,477 INFO L225 Difference]: With dead ends: 1493 [2025-03-08 22:48:55,477 INFO L226 Difference]: Without dead ends: 1493 [2025-03-08 22:48:55,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:48:55,478 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 161 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:48:55,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1580 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:48:55,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2025-03-08 22:48:55,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1274. [2025-03-08 22:48:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1128 states have (on average 1.4317375886524824) internal successors, (1615), 1211 states have internal predecessors, (1615), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 37 states have call predecessors, (100), 50 states have call successors, (100) [2025-03-08 22:48:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1765 transitions. [2025-03-08 22:48:55,489 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1765 transitions. Word has length 56 [2025-03-08 22:48:55,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:48:55,489 INFO L471 AbstractCegarLoop]: Abstraction has 1274 states and 1765 transitions. [2025-03-08 22:48:55,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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-08 22:48:55,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1765 transitions. [2025-03-08 22:48:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 22:48:55,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:48:55,490 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-03-08 22:48:55,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-08 22:48:55,490 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 62 more)] === [2025-03-08 22:48:55,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:48:55,490 INFO L85 PathProgramCache]: Analyzing trace with hash -935136071, now seen corresponding path program 1 times [2025-03-08 22:48:55,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:48:55,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769163518] [2025-03-08 22:48:55,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:55,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:48:55,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:48:55,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:48:55,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:55,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:48:55,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:48:55,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769163518] [2025-03-08 22:48:55,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769163518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:55,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082258870] [2025-03-08 22:48:55,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:48:55,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:48:55,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:48:55,922 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:48:55,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 22:48:56,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:48:56,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:48:56,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:48:56,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:48:56,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-08 22:48:56,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:48:56,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 22:48:56,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 22:48:56,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:48:56,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:48:56,370 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-08 22:48:56,481 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-03-08 22:48:56,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 29 [2025-03-08 22:48:56,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-03-08 22:48:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:48:56,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:48:56,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082258870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:48:56,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:48:56,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 30 [2025-03-08 22:48:56,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202991623] [2025-03-08 22:48:56,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:48:56,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 22:48:56,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:48:56,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 22:48:56,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1144, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 22:48:56,848 INFO L87 Difference]: Start difference. First operand 1274 states and 1765 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 28 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 22:49:02,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:49:14,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:49:18,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:49:22,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:49:26,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:49:30,336 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-08 22:49:34,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:49:46,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]