./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/prefixsum_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/prefixsum_rec.c -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 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:51:50,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:51:50,415 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:51:50,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:51:50,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:51:50,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:51:50,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:51:50,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:51:50,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:51:50,441 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:51:50,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:51:50,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:51:50,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:51:50,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:51:50,442 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:51:50,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:51:50,442 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:51:50,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:51:50,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:51:50,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:51:50,442 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:51:50,442 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:51:50,442 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:51:50,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:51:50,442 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:51:50,442 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:51:50,442 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:51:50,442 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:51:50,444 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:51:50,444 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:51:50,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:51:50,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:51:50,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:51:50,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:51:50,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:51:50,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:51:50,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:51:50,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:51:50,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:51:50,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:51:50,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:51:50,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:51:50,445 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 -> 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab [2025-03-17 11:51:50,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:51:50,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:51:50,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:51:50,672 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:51:50,673 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:51:50,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_rec.c [2025-03-17 11:51:51,806 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404d50eaa/222e772a965644869b6ab31a021fe3d7/FLAGac8183253 [2025-03-17 11:51:52,009 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:51:52,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_rec.c [2025-03-17 11:51:52,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404d50eaa/222e772a965644869b6ab31a021fe3d7/FLAGac8183253 [2025-03-17 11:51:52,363 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404d50eaa/222e772a965644869b6ab31a021fe3d7 [2025-03-17 11:51:52,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:51:52,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:51:52,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:51:52,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:51:52,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:51:52,370 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:51:52" (1/1) ... [2025-03-17 11:51:52,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:52, skipping insertion in model container [2025-03-17 11:51:52,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:51:52" (1/1) ... [2025-03-17 11:51:52,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:51:52,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:51:52,527 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:51:52,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:51:52,561 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:51:52,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:52 WrapperNode [2025-03-17 11:51:52,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:51:52,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:51:52,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:51:52,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:51:52,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:52" (1/1) ... [2025-03-17 11:51:52,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:52" (1/1) ... [2025-03-17 11:51:52,593 INFO L138 Inliner]: procedures = 22, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 74 [2025-03-17 11:51:52,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:51:52,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:51:52,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:51:52,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:51:52,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:52" (1/1) ... [2025-03-17 11:51:52,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:52" (1/1) ... [2025-03-17 11:51:52,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:52" (1/1) ... [2025-03-17 11:51:52,622 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-03-17 11:51:52,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:52" (1/1) ... [2025-03-17 11:51:52,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:52" (1/1) ... [2025-03-17 11:51:52,634 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:52" (1/1) ... [2025-03-17 11:51:52,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:52" (1/1) ... [2025-03-17 11:51:52,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:52" (1/1) ... [2025-03-17 11:51:52,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:52" (1/1) ... [2025-03-17 11:51:52,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:51:52,645 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:51:52,645 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:51:52,645 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:51:52,646 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:52" (1/1) ... [2025-03-17 11:51:52,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:51:52,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:51:52,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:51:52,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:51:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:51:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 11:51:52,696 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 11:51:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:51:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:51:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2025-03-17 11:51:52,696 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2025-03-17 11:51:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:51:52,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:51:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:51:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2025-03-17 11:51:52,697 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2025-03-17 11:51:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:51:52,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:51:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:51:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:51:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-17 11:51:52,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-17 11:51:52,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:51:52,767 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:51:52,768 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:51:53,023 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-03-17 11:51:53,023 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:51:53,031 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:51:53,035 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:51:53,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:51:53 BoogieIcfgContainer [2025-03-17 11:51:53,036 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:51:53,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:51:53,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:51:53,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:51:53,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:51:52" (1/3) ... [2025-03-17 11:51:53,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca0166e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:51:53, skipping insertion in model container [2025-03-17 11:51:53,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:51:52" (2/3) ... [2025-03-17 11:51:53,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca0166e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:51:53, skipping insertion in model container [2025-03-17 11:51:53,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:51:53" (3/3) ... [2025-03-17 11:51:53,043 INFO L128 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2025-03-17 11:51:53,055 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:51:53,056 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG prefixsum_rec.c that has 5 procedures, 101 locations, 1 initial locations, 3 loop locations, and 34 error locations. [2025-03-17 11:51:53,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:51:53,089 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;@d8ddb05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:51:53,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-03-17 11:51:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 86 states have internal predecessors, (93), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 11:51:53,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 11:51:53,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:53,100 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:51:53,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-17 11:51:53,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:53,106 INFO L85 PathProgramCache]: Analyzing trace with hash -195415943, now seen corresponding path program 1 times [2025-03-17 11:51:53,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:53,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896076481] [2025-03-17 11:51:53,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:53,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:53,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:51:53,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:51:53,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:53,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:51:53,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:53,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896076481] [2025-03-17 11:51:53,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896076481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:51:53,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572667752] [2025-03-17 11:51:53,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:53,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:51:53,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:51:53,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:51:53,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:51:53,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:51:53,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:51:53,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:53,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:53,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 11:51:53,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:51:53,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:51:53,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:51:53,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572667752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:51:53,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:51:53,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 11:51:53,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360997020] [2025-03-17 11:51:53,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:51:53,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:51:53,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:51:53,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:51:53,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:51:53,367 INFO L87 Difference]: Start difference. First operand has 101 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 86 states have internal predecessors, (93), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:51:53,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:51:53,383 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2025-03-17 11:51:53,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:51:53,385 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2025-03-17 11:51:53,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:51:53,391 INFO L225 Difference]: With dead ends: 101 [2025-03-17 11:51:53,391 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 11:51:53,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:51:53,395 INFO L435 NwaCegarLoop]: 111 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, 111 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:51:53,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:51:53,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 11:51:53,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-17 11:51:53,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 84 states have internal predecessors, (89), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 11:51:53,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2025-03-17 11:51:53,429 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 26 [2025-03-17 11:51:53,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:51:53,430 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2025-03-17 11:51:53,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:51:53,430 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2025-03-17 11:51:53,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 11:51:53,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:53,432 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:51:53,438 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-17 11:51:53,633 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,SelfDestructingSolverStorable0 [2025-03-17 11:51:53,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-17 11:51:53,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:53,634 INFO L85 PathProgramCache]: Analyzing trace with hash 538814361, now seen corresponding path program 1 times [2025-03-17 11:51:53,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:53,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304656463] [2025-03-17 11:51:53,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:53,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:53,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:51:53,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:51:53,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:53,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 11:51:53,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:53,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304656463] [2025-03-17 11:51:53,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304656463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:51:53,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:51:53,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:51:53,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241874689] [2025-03-17 11:51:53,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:51:53,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:51:53,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:51:53,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:51:53,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:51:53,869 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 11:51:53,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:51:53,954 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2025-03-17 11:51:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:51:53,955 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), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2025-03-17 11:51:53,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:51:53,955 INFO L225 Difference]: With dead ends: 96 [2025-03-17 11:51:53,956 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 11:51:53,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:51:53,956 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 25 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:51:53,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 198 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:51:53,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 11:51:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-17 11:51:53,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 51 states have (on average 1.6862745098039216) internal successors, (86), 81 states have internal predecessors, (86), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 11:51:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2025-03-17 11:51:53,963 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 26 [2025-03-17 11:51:53,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:51:53,964 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2025-03-17 11:51:53,964 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), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 11:51:53,964 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2025-03-17 11:51:53,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 11:51:53,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:53,964 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:51:53,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:51:53,965 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-17 11:51:53,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:53,965 INFO L85 PathProgramCache]: Analyzing trace with hash 538814362, now seen corresponding path program 1 times [2025-03-17 11:51:53,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:53,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794331924] [2025-03-17 11:51:53,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:53,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:53,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:51:54,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:51:54,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:54,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 11:51:54,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:54,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794331924] [2025-03-17 11:51:54,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794331924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:51:54,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:51:54,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 11:51:54,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951603592] [2025-03-17 11:51:54,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:51:54,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:51:54,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:51:54,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:51:54,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:51:54,586 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:51:54,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:51:54,911 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2025-03-17 11:51:54,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:51:54,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2025-03-17 11:51:54,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:51:54,914 INFO L225 Difference]: With dead ends: 119 [2025-03-17 11:51:54,914 INFO L226 Difference]: Without dead ends: 119 [2025-03-17 11:51:54,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:51:54,915 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 65 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:51:54,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 248 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:51:54,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-17 11:51:54,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2025-03-17 11:51:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 87 states have internal predecessors, (94), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 11:51:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2025-03-17 11:51:54,923 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 26 [2025-03-17 11:51:54,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:51:54,923 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2025-03-17 11:51:54,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:51:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2025-03-17 11:51:54,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 11:51:54,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:54,924 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:51:54,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:51:54,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-17 11:51:54,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:54,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1238760030, now seen corresponding path program 1 times [2025-03-17 11:51:54,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:54,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348234806] [2025-03-17 11:51:54,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:54,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:54,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 11:51:54,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 11:51:54,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:54,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 11:51:55,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:55,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348234806] [2025-03-17 11:51:55,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348234806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:51:55,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364457345] [2025-03-17 11:51:55,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:55,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:51:55,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:51:55,411 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:51:55,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:51:55,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 11:51:55,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 11:51:55,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:55,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:55,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 11:51:55,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:51:55,556 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-17 11:51:55,570 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 7 [2025-03-17 11:51:55,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:51:55,803 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 43 treesize of output 32 [2025-03-17 11:51:55,824 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:51:55,825 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-17 11:51:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:51:56,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:51:56,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364457345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:51:56,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:51:56,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2025-03-17 11:51:56,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109446041] [2025-03-17 11:51:56,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:51:56,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:51:56,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:51:56,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:51:56,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:51:56,194 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 18 states have internal predecessors, (30), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 11:51:57,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:51:57,413 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2025-03-17 11:51:57,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 11:51:57,414 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 18 states have internal predecessors, (30), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 27 [2025-03-17 11:51:57,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:51:57,415 INFO L225 Difference]: With dead ends: 123 [2025-03-17 11:51:57,416 INFO L226 Difference]: Without dead ends: 123 [2025-03-17 11:51:57,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 11:51:57,417 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 332 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 11:51:57,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 576 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 11:51:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-17 11:51:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 96. [2025-03-17 11:51:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 81 states have internal predecessors, (86), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 11:51:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2025-03-17 11:51:57,427 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 27 [2025-03-17 11:51:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:51:57,428 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2025-03-17 11:51:57,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 18 states have internal predecessors, (30), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 11:51:57,430 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2025-03-17 11:51:57,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 11:51:57,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:57,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:51:57,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:51:57,631 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,SelfDestructingSolverStorable3 [2025-03-17 11:51:57,631 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-17 11:51:57,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:57,632 INFO L85 PathProgramCache]: Analyzing trace with hash -476623942, now seen corresponding path program 1 times [2025-03-17 11:51:57,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:57,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632693049] [2025-03-17 11:51:57,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:57,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:57,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 11:51:57,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 11:51:57,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:57,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 11:51:57,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:57,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632693049] [2025-03-17 11:51:57,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632693049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:51:57,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:51:57,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:51:57,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807032106] [2025-03-17 11:51:57,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:51:57,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:51:57,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:51:57,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:51:57,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:51:57,669 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:51:57,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:51:57,724 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2025-03-17 11:51:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:51:57,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2025-03-17 11:51:57,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:51:57,725 INFO L225 Difference]: With dead ends: 95 [2025-03-17 11:51:57,725 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 11:51:57,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:51:57,726 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 23 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:51:57,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 201 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:51:57,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 11:51:57,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-17 11:51:57,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 80 states have internal predecessors, (85), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 11:51:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2025-03-17 11:51:57,729 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 27 [2025-03-17 11:51:57,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:51:57,730 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2025-03-17 11:51:57,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:51:57,730 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2025-03-17 11:51:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 11:51:57,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:57,730 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:51:57,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:51:57,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-17 11:51:57,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:57,731 INFO L85 PathProgramCache]: Analyzing trace with hash -476623941, now seen corresponding path program 1 times [2025-03-17 11:51:57,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:57,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765751348] [2025-03-17 11:51:57,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:57,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:57,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 11:51:57,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 11:51:57,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:57,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 11:51:57,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:57,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765751348] [2025-03-17 11:51:57,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765751348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:51:57,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:51:57,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:51:57,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306533623] [2025-03-17 11:51:57,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:51:57,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:51:57,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:51:57,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:51:57,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:51:57,907 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 11:51:58,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:51:58,040 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2025-03-17 11:51:58,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:51:58,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2025-03-17 11:51:58,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:51:58,042 INFO L225 Difference]: With dead ends: 97 [2025-03-17 11:51:58,042 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 11:51:58,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:51:58,042 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 3 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:51:58,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 327 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:51:58,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 11:51:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-03-17 11:51:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 81 states have internal predecessors, (86), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 11:51:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2025-03-17 11:51:58,046 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 27 [2025-03-17 11:51:58,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:51:58,046 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2025-03-17 11:51:58,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 11:51:58,047 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2025-03-17 11:51:58,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 11:51:58,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:58,047 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:51:58,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:51:58,047 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-17 11:51:58,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:58,048 INFO L85 PathProgramCache]: Analyzing trace with hash 58074326, now seen corresponding path program 1 times [2025-03-17 11:51:58,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:58,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893698473] [2025-03-17 11:51:58,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:58,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:58,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 11:51:58,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 11:51:58,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:58,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:51:58,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:58,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893698473] [2025-03-17 11:51:58,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893698473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:51:58,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100622721] [2025-03-17 11:51:58,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:58,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:51:58,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:51:58,170 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:51:58,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:51:58,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 11:51:58,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 11:51:58,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:58,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:58,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 11:51:58,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:51:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:51:58,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:51:58,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100622721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:51:58,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 11:51:58,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 15 [2025-03-17 11:51:58,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480292711] [2025-03-17 11:51:58,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:51:58,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:51:58,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:51:58,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:51:58,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:51:58,370 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 11:51:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:51:58,461 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2025-03-17 11:51:58,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:51:58,464 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2025-03-17 11:51:58,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:51:58,464 INFO L225 Difference]: With dead ends: 112 [2025-03-17 11:51:58,464 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 11:51:58,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-17 11:51:58,465 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 17 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:51:58,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 387 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:51:58,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 11:51:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2025-03-17 11:51:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 90 states have internal predecessors, (96), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 11:51:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2025-03-17 11:51:58,472 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 30 [2025-03-17 11:51:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:51:58,472 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2025-03-17 11:51:58,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 11:51:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2025-03-17 11:51:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 11:51:58,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:51:58,473 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 11:51:58,480 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-17 11:51:58,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:51:58,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-17 11:51:58,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:51:58,674 INFO L85 PathProgramCache]: Analyzing trace with hash -527155490, now seen corresponding path program 1 times [2025-03-17 11:51:58,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:51:58,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629035835] [2025-03-17 11:51:58,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:58,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:51:58,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 11:51:58,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:51:58,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:58,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 11:51:58,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:51:58,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629035835] [2025-03-17 11:51:58,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629035835] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:51:58,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61517522] [2025-03-17 11:51:58,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:51:58,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:51:58,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:51:58,880 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:51:58,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:51:58,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 11:51:58,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:51:58,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:51:58,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:51:58,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 11:51:58,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:51:58,989 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-17 11:51:58,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:51:59,071 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:51:59,071 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-17 11:51:59,083 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 16 treesize of output 11 [2025-03-17 11:52:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:52:03,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:03,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61517522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:03,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:52:03,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 19 [2025-03-17 11:52:03,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118987624] [2025-03-17 11:52:03,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:03,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 11:52:03,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:03,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 11:52:03,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2025-03-17 11:52:03,731 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-17 11:52:05,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:05,162 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2025-03-17 11:52:05,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:52:05,163 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 31 [2025-03-17 11:52:05,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:05,163 INFO L225 Difference]: With dead ends: 113 [2025-03-17 11:52:05,166 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 11:52:05,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 11:52:05,167 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 215 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:05,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 367 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 11:52:05,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 11:52:05,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2025-03-17 11:52:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 85 states have internal predecessors, (90), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 11:52:05,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2025-03-17 11:52:05,170 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 31 [2025-03-17 11:52:05,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:05,171 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2025-03-17 11:52:05,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-17 11:52:05,171 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2025-03-17 11:52:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 11:52:05,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:05,171 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:05,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 11:52:05,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:05,372 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-17 11:52:05,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:05,372 INFO L85 PathProgramCache]: Analyzing trace with hash 838049015, now seen corresponding path program 1 times [2025-03-17 11:52:05,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:05,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428436878] [2025-03-17 11:52:05,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:05,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:05,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 11:52:05,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 11:52:05,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:05,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 11:52:05,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:05,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428436878] [2025-03-17 11:52:05,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428436878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:05,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681752905] [2025-03-17 11:52:05,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:05,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:05,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:05,575 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:05,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:52:05,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 11:52:05,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 11:52:05,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:05,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:05,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 11:52:05,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:05,634 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 10 treesize of output 9 [2025-03-17 11:52:05,729 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-17 11:52:05,729 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 16 treesize of output 18 [2025-03-17 11:52:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 11:52:05,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:06,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681752905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:06,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:52:06,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-03-17 11:52:06,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338344809] [2025-03-17 11:52:06,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:06,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 11:52:06,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:06,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 11:52:06,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-03-17 11:52:06,215 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 11:52:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:06,549 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2025-03-17 11:52:06,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:52:06,550 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2025-03-17 11:52:06,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:06,551 INFO L225 Difference]: With dead ends: 99 [2025-03-17 11:52:06,551 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 11:52:06,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:52:06,552 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 95 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:06,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 368 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:52:06,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 11:52:06,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-17 11:52:06,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 84 states have internal predecessors, (89), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 11:52:06,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2025-03-17 11:52:06,555 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 32 [2025-03-17 11:52:06,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:06,555 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2025-03-17 11:52:06,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 11:52:06,555 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2025-03-17 11:52:06,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 11:52:06,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:06,556 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:06,561 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-17 11:52:06,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:06,756 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-17 11:52:06,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash -326665702, now seen corresponding path program 2 times [2025-03-17 11:52:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:06,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930794511] [2025-03-17 11:52:06,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:52:06,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:06,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-17 11:52:06,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:52:06,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:52:06,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:52:07,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:07,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930794511] [2025-03-17 11:52:07,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930794511] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:07,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71091225] [2025-03-17 11:52:07,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:52:07,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:07,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:07,155 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:07,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 11:52:07,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-17 11:52:07,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:52:07,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:52:07,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:07,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 11:52:07,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:07,247 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-17 11:52:07,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:52:07,365 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:52:07,365 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-17 11:52:07,371 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 16 treesize of output 11 [2025-03-17 11:52:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:52:07,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:07,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71091225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:07,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:52:07,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2025-03-17 11:52:07,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607142228] [2025-03-17 11:52:07,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:07,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 11:52:07,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:07,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 11:52:07,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:52:07,878 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-17 11:52:08,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:08,673 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2025-03-17 11:52:08,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 11:52:08,674 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 35 [2025-03-17 11:52:08,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:08,674 INFO L225 Difference]: With dead ends: 105 [2025-03-17 11:52:08,674 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 11:52:08,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=312, Invalid=1494, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 11:52:08,675 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 224 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:08,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 479 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:52:08,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 11:52:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-17 11:52:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 65 states have (on average 1.476923076923077) internal successors, (96), 90 states have internal predecessors, (96), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 11:52:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2025-03-17 11:52:08,678 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 35 [2025-03-17 11:52:08,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:08,678 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2025-03-17 11:52:08,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 states have internal predecessors, (45), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-17 11:52:08,679 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2025-03-17 11:52:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 11:52:08,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:08,679 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 11:52:08,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 11:52:08,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:08,880 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting upsweepErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-17 11:52:08,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:08,880 INFO L85 PathProgramCache]: Analyzing trace with hash 699734993, now seen corresponding path program 1 times [2025-03-17 11:52:08,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:08,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662790227] [2025-03-17 11:52:08,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:08,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:08,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 11:52:08,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 11:52:08,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:08,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 11:52:08,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:08,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662790227] [2025-03-17 11:52:08,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662790227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:08,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:08,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:52:08,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928421416] [2025-03-17 11:52:08,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:08,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:52:08,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:08,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:52:08,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:52:08,923 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 11:52:08,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:08,996 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2025-03-17 11:52:08,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:52:08,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2025-03-17 11:52:08,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:08,997 INFO L225 Difference]: With dead ends: 102 [2025-03-17 11:52:08,997 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 11:52:08,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:52:08,998 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 34 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:08,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 228 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:52:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 11:52:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-17 11:52:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 87 states have internal predecessors, (93), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 11:52:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2025-03-17 11:52:09,001 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 38 [2025-03-17 11:52:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:09,001 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2025-03-17 11:52:09,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 11:52:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2025-03-17 11:52:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 11:52:09,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:09,002 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 11:52:09,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:52:09,002 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting upsweepErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-17 11:52:09,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:09,002 INFO L85 PathProgramCache]: Analyzing trace with hash 699734994, now seen corresponding path program 1 times [2025-03-17 11:52:09,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:09,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408609820] [2025-03-17 11:52:09,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:09,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:09,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 11:52:09,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 11:52:09,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:09,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 11:52:09,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:09,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408609820] [2025-03-17 11:52:09,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408609820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:09,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089991735] [2025-03-17 11:52:09,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:09,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:09,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:09,216 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:09,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 11:52:09,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 11:52:09,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 11:52:09,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:09,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:09,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 11:52:09,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 11:52:09,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:09,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2025-03-17 11:52:09,977 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 11:52:09,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089991735] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:52:09,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:52:09,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2025-03-17 11:52:09,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457234170] [2025-03-17 11:52:09,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:09,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-17 11:52:09,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:09,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 11:52:09,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 11:52:09,979 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 35 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 32 states have internal predecessors, (54), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-17 11:52:10,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:10,498 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2025-03-17 11:52:10,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 11:52:10,498 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 32 states have internal predecessors, (54), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 38 [2025-03-17 11:52:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:10,499 INFO L225 Difference]: With dead ends: 137 [2025-03-17 11:52:10,499 INFO L226 Difference]: Without dead ends: 137 [2025-03-17 11:52:10,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=2001, Unknown=0, NotChecked=0, Total=2352 [2025-03-17 11:52:10,500 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 129 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:10,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 897 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:52:10,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-17 11:52:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 114. [2025-03-17 11:52:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 96 states have internal predecessors, (106), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 11:52:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2025-03-17 11:52:10,503 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 38 [2025-03-17 11:52:10,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:10,503 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2025-03-17 11:52:10,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 32 states have internal predecessors, (54), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-17 11:52:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2025-03-17 11:52:10,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 11:52:10,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:10,503 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:10,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 11:52:10,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:10,704 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting upsweepErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-17 11:52:10,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:10,704 INFO L85 PathProgramCache]: Analyzing trace with hash 216948306, now seen corresponding path program 1 times [2025-03-17 11:52:10,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:10,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883512551] [2025-03-17 11:52:10,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:10,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:10,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:52:10,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:52:10,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:10,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 11:52:10,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:10,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883512551] [2025-03-17 11:52:10,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883512551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:10,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86460493] [2025-03-17 11:52:10,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:10,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:10,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:10,881 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:10,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 11:52:10,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:52:10,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:52:10,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:10,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:10,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 11:52:10,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 11:52:11,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:11,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-03-17 11:52:11,251 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 11:52:11,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86460493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:52:11,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:52:11,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-03-17 11:52:11,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541127614] [2025-03-17 11:52:11,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:11,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 11:52:11,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:11,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 11:52:11,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2025-03-17 11:52:11,252 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand has 32 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 29 states have internal predecessors, (57), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-17 11:52:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:11,571 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2025-03-17 11:52:11,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:52:11,572 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 29 states have internal predecessors, (57), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 39 [2025-03-17 11:52:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:11,573 INFO L225 Difference]: With dead ends: 125 [2025-03-17 11:52:11,573 INFO L226 Difference]: Without dead ends: 125 [2025-03-17 11:52:11,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1286, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 11:52:11,574 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 64 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:11,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 961 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:52:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-17 11:52:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-03-17 11:52:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 103 states have internal predecessors, (113), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 11:52:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 141 transitions. [2025-03-17 11:52:11,577 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 141 transitions. Word has length 39 [2025-03-17 11:52:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:11,578 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 141 transitions. [2025-03-17 11:52:11,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 29 states have internal predecessors, (57), 10 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-17 11:52:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2025-03-17 11:52:11,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 11:52:11,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:11,579 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:11,587 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-17 11:52:11,780 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,SelfDestructingSolverStorable12 [2025-03-17 11:52:11,780 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting upsweepErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-17 11:52:11,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:11,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1964784437, now seen corresponding path program 1 times [2025-03-17 11:52:11,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:11,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860809661] [2025-03-17 11:52:11,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:11,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:11,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 11:52:11,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 11:52:11,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:11,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 11:52:11,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:11,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860809661] [2025-03-17 11:52:11,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860809661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:11,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544295376] [2025-03-17 11:52:11,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:11,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:11,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:11,858 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-17 11:52:11,859 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-17 11:52:11,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 11:52:11,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 11:52:11,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:11,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:11,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 11:52:11,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:11,981 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 11:52:11,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 11:52:12,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544295376] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:52:12,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:52:12,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2025-03-17 11:52:12,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825343523] [2025-03-17 11:52:12,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:12,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 11:52:12,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:12,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 11:52:12,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-17 11:52:12,052 INFO L87 Difference]: Start difference. First operand 124 states and 141 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 11:52:12,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:12,144 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2025-03-17 11:52:12,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:52:12,144 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2025-03-17 11:52:12,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:12,145 INFO L225 Difference]: With dead ends: 138 [2025-03-17 11:52:12,145 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 11:52:12,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:52:12,146 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 27 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:12,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 659 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:52:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 11:52:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2025-03-17 11:52:12,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 89 states have (on average 1.348314606741573) internal successors, (120), 111 states have internal predecessors, (120), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 11:52:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 150 transitions. [2025-03-17 11:52:12,153 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 150 transitions. Word has length 41 [2025-03-17 11:52:12,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:12,154 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 150 transitions. [2025-03-17 11:52:12,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 11:52:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 150 transitions. [2025-03-17 11:52:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 11:52:12,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:12,155 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 11:52:12,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 11:52:12,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 11:52:12,355 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting downsweepErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-17 11:52:12,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:12,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1807515242, now seen corresponding path program 1 times [2025-03-17 11:52:12,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:12,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447792565] [2025-03-17 11:52:12,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:12,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:12,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 11:52:12,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:52:12,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:12,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 11:52:12,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:12,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447792565] [2025-03-17 11:52:12,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447792565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:52:12,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:52:12,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:52:12,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912530909] [2025-03-17 11:52:12,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:52:12,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:52:12,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:12,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:52:12,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:52:12,403 INFO L87 Difference]: Start difference. First operand 133 states and 150 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 11:52:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:12,474 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2025-03-17 11:52:12,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:52:12,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2025-03-17 11:52:12,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:12,476 INFO L225 Difference]: With dead ends: 128 [2025-03-17 11:52:12,476 INFO L226 Difference]: Without dead ends: 128 [2025-03-17 11:52:12,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:52:12,477 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 45 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:12,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 205 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:52:12,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-17 11:52:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-03-17 11:52:12,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 106 states have internal predecessors, (115), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 11:52:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2025-03-17 11:52:12,480 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 47 [2025-03-17 11:52:12,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:12,480 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2025-03-17 11:52:12,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 11:52:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2025-03-17 11:52:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 11:52:12,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:12,481 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 11:52:12,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:52:12,481 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting downsweepErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-17 11:52:12,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:12,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1807515241, now seen corresponding path program 1 times [2025-03-17 11:52:12,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:12,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924831775] [2025-03-17 11:52:12,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:12,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:12,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 11:52:12,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:52:12,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:12,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 11:52:12,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:12,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924831775] [2025-03-17 11:52:12,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924831775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:12,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036489536] [2025-03-17 11:52:12,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:52:12,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:12,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:12,692 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:12,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 11:52:12,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 11:52:12,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 11:52:12,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:52:12,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:12,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 11:52:12,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:12,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:52:12,763 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-17 11:52:12,832 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 11:52:12,832 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 18 treesize of output 17 [2025-03-17 11:52:12,843 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:52:12,843 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-17 11:52:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:52:21,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:22,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036489536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:22,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:52:22,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2025-03-17 11:52:22,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695069015] [2025-03-17 11:52:22,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:22,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 11:52:22,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:22,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 11:52:22,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1101, Unknown=2, NotChecked=0, Total=1260 [2025-03-17 11:52:22,030 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand has 26 states, 25 states have (on average 2.28) internal successors, (57), 24 states have internal predecessors, (57), 8 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-17 11:52:26,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:52:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:52:26,872 INFO L93 Difference]: Finished difference Result 152 states and 173 transitions. [2025-03-17 11:52:26,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 11:52:26,872 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 24 states have internal predecessors, (57), 8 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 47 [2025-03-17 11:52:26,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:52:26,873 INFO L225 Difference]: With dead ends: 152 [2025-03-17 11:52:26,873 INFO L226 Difference]: Without dead ends: 152 [2025-03-17 11:52:26,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=358, Invalid=2396, Unknown=2, NotChecked=0, Total=2756 [2025-03-17 11:52:26,874 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 204 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-17 11:52:26,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 558 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-17 11:52:26,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-17 11:52:26,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 142. [2025-03-17 11:52:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 100 states have (on average 1.29) internal successors, (129), 117 states have internal predecessors, (129), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 11:52:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2025-03-17 11:52:26,878 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 47 [2025-03-17 11:52:26,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:52:26,878 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2025-03-17 11:52:26,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 24 states have internal predecessors, (57), 8 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-17 11:52:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2025-03-17 11:52:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 11:52:26,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:52:26,878 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:52:26,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 11:52:27,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 11:52:27,079 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting upsweepErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [downsweepErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, downsweepErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2025-03-17 11:52:27,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:52:27,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1702889283, now seen corresponding path program 2 times [2025-03-17 11:52:27,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:52:27,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496200865] [2025-03-17 11:52:27,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:52:27,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:52:27,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-17 11:52:27,095 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:52:27,095 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:52:27,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:52:27,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:52:27,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496200865] [2025-03-17 11:52:27,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496200865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:27,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913904592] [2025-03-17 11:52:27,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:52:27,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:52:27,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:52:27,548 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:52:27,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 11:52:27,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-17 11:52:27,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:52:27,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:52:27,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:52:27,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-17 11:52:27,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:52:27,664 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-17 11:52:27,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:52:27,761 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:52:27,761 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-17 11:52:27,769 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 18 treesize of output 13 [2025-03-17 11:52:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:52:53,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:52:56,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913904592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:52:56,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:52:56,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 40 [2025-03-17 11:52:56,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737949044] [2025-03-17 11:52:56,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:52:56,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-17 11:52:56,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:52:56,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-17 11:52:56,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=2778, Unknown=6, NotChecked=0, Total=3080 [2025-03-17 11:52:56,289 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand has 41 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 11 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-17 11:53:00,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:53:04,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:53:08,758 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]