./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/lockfree-3.0.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/memsafety/lockfree-3.0.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 7f8fac16618381191df281797d9a226d8ef27ceee39fb50cf9cc5019cb90ab70 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:23:59,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:23:59,564 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:23:59,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:23:59,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:23:59,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:23:59,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:23:59,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:23:59,592 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:23:59,592 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:23:59,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:23:59,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:23:59,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:23:59,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:23:59,593 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:23:59,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:23:59,594 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:23:59,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:23:59,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:23:59,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:23:59,594 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:23:59,594 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:23:59,594 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:23:59,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:23:59,594 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:23:59,594 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:23:59,594 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:23:59,595 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:23:59,595 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:23:59,595 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:23:59,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:23:59,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:23:59,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:23:59,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:23:59,595 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:23:59,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:23:59,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:23:59,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:23:59,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:23:59,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:23:59,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:23:59,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:23:59,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:23:59,595 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:23:59,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:23:59,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:23:59,596 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 -> 7f8fac16618381191df281797d9a226d8ef27ceee39fb50cf9cc5019cb90ab70 [2025-04-29 11:23:59,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:23:59,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:23:59,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:23:59,826 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:23:59,827 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:23:59,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.0.c [2025-04-29 11:24:01,142 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/772cd02f6/1e1ef962404c4a248e2fa61f9c257913/FLAGd27b37458 [2025-04-29 11:24:01,350 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:24:01,350 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/lockfree-3.0.c [2025-04-29 11:24:01,351 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:24:01,351 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:24:01,355 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/772cd02f6/1e1ef962404c4a248e2fa61f9c257913/FLAGd27b37458 [2025-04-29 11:24:02,343 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/772cd02f6/1e1ef962404c4a248e2fa61f9c257913 [2025-04-29 11:24:02,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:24:02,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:24:02,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:24:02,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:24:02,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:24:02,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:24:02" (1/1) ... [2025-04-29 11:24:02,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60c9686a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:02, skipping insertion in model container [2025-04-29 11:24:02,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:24:02" (1/1) ... [2025-04-29 11:24:02,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:24:02,490 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:24:02,503 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:24:02,526 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:24:02,545 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:24:02,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:02 WrapperNode [2025-04-29 11:24:02,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:24:02,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:24:02,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:24:02,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:24:02,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:02" (1/1) ... [2025-04-29 11:24:02,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:02" (1/1) ... [2025-04-29 11:24:02,575 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2025-04-29 11:24:02,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:24:02,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:24:02,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:24:02,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:24:02,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:02" (1/1) ... [2025-04-29 11:24:02,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:02" (1/1) ... [2025-04-29 11:24:02,586 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:02" (1/1) ... [2025-04-29 11:24:02,596 INFO L175 MemorySlicer]: Split 8 memory accesses to 1 slices as follows [8]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 5 writes are split as follows [5]. [2025-04-29 11:24:02,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:02" (1/1) ... [2025-04-29 11:24:02,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:02" (1/1) ... [2025-04-29 11:24:02,600 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:02" (1/1) ... [2025-04-29 11:24:02,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:02" (1/1) ... [2025-04-29 11:24:02,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:02" (1/1) ... [2025-04-29 11:24:02,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:02" (1/1) ... [2025-04-29 11:24:02,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:02" (1/1) ... [2025-04-29 11:24:02,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:24:02,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:24:02,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:24:02,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:24:02,608 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:02" (1/1) ... [2025-04-29 11:24:02,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:24:02,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:02,630 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-04-29 11:24:02,634 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-04-29 11:24:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:24:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:24:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:24:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:24:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:24:02,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:24:02,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:24:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:24:02,706 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:24:02,708 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:24:02,900 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-04-29 11:24:02,900 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:24:02,910 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:24:02,910 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:24:02,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:24:02 BoogieIcfgContainer [2025-04-29 11:24:02,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:24:02,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:24:02,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:24:02,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:24:02,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:24:02" (1/3) ... [2025-04-29 11:24:02,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8042b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:24:02, skipping insertion in model container [2025-04-29 11:24:02,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:02" (2/3) ... [2025-04-29 11:24:02,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8042b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:24:02, skipping insertion in model container [2025-04-29 11:24:02,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:24:02" (3/3) ... [2025-04-29 11:24:02,917 INFO L128 eAbstractionObserver]: Analyzing ICFG lockfree-3.0.c [2025-04-29 11:24:02,928 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:24:02,929 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lockfree-3.0.c that has 1 procedures, 64 locations, 82 edges, 1 initial locations, 2 loop locations, and 20 error locations. [2025-04-29 11:24:02,960 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:24:02,969 INFO L340 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;@ae709c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:24:02,971 INFO L341 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-04-29 11:24:02,973 INFO L278 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 63 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:02,977 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:24:02,977 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:02,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:24:02,978 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:02,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:02,981 INFO L85 PathProgramCache]: Analyzing trace with hash 28820323, now seen corresponding path program 1 times [2025-04-29 11:24:02,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:02,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414150411] [2025-04-29 11:24:02,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:02,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:03,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:24:03,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:24:03,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:03,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:03,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:03,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414150411] [2025-04-29 11:24:03,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414150411] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:03,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:03,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:03,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960089726] [2025-04-29 11:24:03,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:03,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 11:24:03,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:03,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 11:24:03,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:24:03,092 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 63 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:03,104 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2025-04-29 11:24:03,105 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 11:24:03,107 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-29 11:24:03,107 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:03,112 INFO L225 Difference]: With dead ends: 64 [2025-04-29 11:24:03,112 INFO L226 Difference]: Without dead ends: 62 [2025-04-29 11:24:03,113 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:24:03,115 INFO L437 NwaCegarLoop]: 81 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, 81 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-04-29 11:24:03,115 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-04-29 11:24:03,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-04-29 11:24:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.880952380952381) internal successors, (79), 61 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2025-04-29 11:24:03,139 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2025-04-29 11:24:03,140 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:03,140 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-04-29 11:24:03,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,140 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2025-04-29 11:24:03,140 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:24:03,140 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:03,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:03,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:24:03,140 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:03,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:03,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1805898957, now seen corresponding path program 1 times [2025-04-29 11:24:03,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:03,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141469994] [2025-04-29 11:24:03,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:03,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:03,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:24:03,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:24:03,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:03,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:03,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:03,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141469994] [2025-04-29 11:24:03,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141469994] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:03,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:03,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:24:03,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189148736] [2025-04-29 11:24:03,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:03,243 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:24:03,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:03,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:24:03,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:24:03,244 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:03,290 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2025-04-29 11:24:03,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:24:03,290 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:24:03,290 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:03,291 INFO L225 Difference]: With dead ends: 80 [2025-04-29 11:24:03,291 INFO L226 Difference]: Without dead ends: 80 [2025-04-29 11:24:03,291 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:24:03,292 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 18 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:03,292 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 211 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-04-29 11:24:03,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 64. [2025-04-29 11:24:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.8409090909090908) internal successors, (81), 63 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2025-04-29 11:24:03,296 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 7 [2025-04-29 11:24:03,296 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:03,296 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2025-04-29 11:24:03,296 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,296 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2025-04-29 11:24:03,297 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:24:03,297 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:03,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:03,297 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:24:03,297 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:03,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:03,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1805958539, now seen corresponding path program 1 times [2025-04-29 11:24:03,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:03,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266108203] [2025-04-29 11:24:03,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:03,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:03,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:24:03,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:24:03,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:03,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:03,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:03,343 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266108203] [2025-04-29 11:24:03,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266108203] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:03,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:03,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:03,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919799192] [2025-04-29 11:24:03,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:03,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:03,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:03,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:03,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:03,344 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:03,391 INFO L93 Difference]: Finished difference Result 117 states and 151 transitions. [2025-04-29 11:24:03,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:03,393 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:24:03,393 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:03,393 INFO L225 Difference]: With dead ends: 117 [2025-04-29 11:24:03,394 INFO L226 Difference]: Without dead ends: 116 [2025-04-29 11:24:03,394 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:03,394 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:03,394 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 121 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:03,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-29 11:24:03,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2025-04-29 11:24:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.8421052631578947) internal successors, (140), 95 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2025-04-29 11:24:03,406 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 7 [2025-04-29 11:24:03,406 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:03,406 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2025-04-29 11:24:03,406 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,406 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2025-04-29 11:24:03,407 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:24:03,408 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:03,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:03,408 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:24:03,409 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:03,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:03,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1805958155, now seen corresponding path program 1 times [2025-04-29 11:24:03,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:03,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246342664] [2025-04-29 11:24:03,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:03,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:03,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:24:03,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:24:03,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:03,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:03,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:03,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246342664] [2025-04-29 11:24:03,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246342664] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:03,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:03,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:03,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790740019] [2025-04-29 11:24:03,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:03,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:03,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:03,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:03,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:03,467 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:03,497 INFO L93 Difference]: Finished difference Result 176 states and 263 transitions. [2025-04-29 11:24:03,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:03,497 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:24:03,497 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:03,498 INFO L225 Difference]: With dead ends: 176 [2025-04-29 11:24:03,498 INFO L226 Difference]: Without dead ends: 175 [2025-04-29 11:24:03,498 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:03,499 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 62 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:03,499 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 140 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-04-29 11:24:03,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 153. [2025-04-29 11:24:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 133 states have (on average 1.849624060150376) internal successors, (246), 152 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 246 transitions. [2025-04-29 11:24:03,505 INFO L79 Accepts]: Start accepts. Automaton has 153 states and 246 transitions. Word has length 7 [2025-04-29 11:24:03,505 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:03,505 INFO L485 AbstractCegarLoop]: Abstraction has 153 states and 246 transitions. [2025-04-29 11:24:03,506 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,506 INFO L278 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2025-04-29 11:24:03,506 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:24:03,506 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:03,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:03,506 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:24:03,506 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:03,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:03,507 INFO L85 PathProgramCache]: Analyzing trace with hash 353556108, now seen corresponding path program 1 times [2025-04-29 11:24:03,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:03,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891561368] [2025-04-29 11:24:03,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:03,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:03,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:24:03,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:24:03,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:03,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:03,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:03,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:03,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891561368] [2025-04-29 11:24:03,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891561368] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:03,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:03,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:03,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524926081] [2025-04-29 11:24:03,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:03,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:03,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:03,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:03,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:03,577 INFO L87 Difference]: Start difference. First operand 153 states and 246 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:03,635 INFO L93 Difference]: Finished difference Result 231 states and 355 transitions. [2025-04-29 11:24:03,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:03,636 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:24:03,636 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:03,637 INFO L225 Difference]: With dead ends: 231 [2025-04-29 11:24:03,637 INFO L226 Difference]: Without dead ends: 231 [2025-04-29 11:24:03,637 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:03,638 INFO L437 NwaCegarLoop]: 121 mSDtfsCounter, 69 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:03,638 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 173 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:03,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-04-29 11:24:03,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 209. [2025-04-29 11:24:03,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 191 states have (on average 1.7853403141361257) internal successors, (341), 208 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 341 transitions. [2025-04-29 11:24:03,654 INFO L79 Accepts]: Start accepts. Automaton has 209 states and 341 transitions. Word has length 9 [2025-04-29 11:24:03,655 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:03,655 INFO L485 AbstractCegarLoop]: Abstraction has 209 states and 341 transitions. [2025-04-29 11:24:03,655 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,655 INFO L278 IsEmpty]: Start isEmpty. Operand 209 states and 341 transitions. [2025-04-29 11:24:03,655 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:24:03,655 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:03,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:03,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:24:03,655 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:03,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash 353556109, now seen corresponding path program 1 times [2025-04-29 11:24:03,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:03,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021575960] [2025-04-29 11:24:03,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:03,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:03,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:24:03,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:24:03,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:03,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:03,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:03,737 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021575960] [2025-04-29 11:24:03,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021575960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:03,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:03,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:03,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061363733] [2025-04-29 11:24:03,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:03,737 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:03,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:03,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:03,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:03,738 INFO L87 Difference]: Start difference. First operand 209 states and 341 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:03,782 INFO L93 Difference]: Finished difference Result 226 states and 346 transitions. [2025-04-29 11:24:03,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:03,782 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-29 11:24:03,783 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:03,783 INFO L225 Difference]: With dead ends: 226 [2025-04-29 11:24:03,784 INFO L226 Difference]: Without dead ends: 226 [2025-04-29 11:24:03,785 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:03,785 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 68 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:03,785 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 181 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-04-29 11:24:03,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 207. [2025-04-29 11:24:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 191 states have (on average 1.743455497382199) internal successors, (333), 206 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 333 transitions. [2025-04-29 11:24:03,795 INFO L79 Accepts]: Start accepts. Automaton has 207 states and 333 transitions. Word has length 9 [2025-04-29 11:24:03,795 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:03,795 INFO L485 AbstractCegarLoop]: Abstraction has 207 states and 333 transitions. [2025-04-29 11:24:03,796 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,796 INFO L278 IsEmpty]: Start isEmpty. Operand 207 states and 333 transitions. [2025-04-29 11:24:03,796 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:24:03,796 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:03,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:03,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:24:03,796 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:03,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:03,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1924654535, now seen corresponding path program 1 times [2025-04-29 11:24:03,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:03,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402033689] [2025-04-29 11:24:03,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:03,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:03,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:24:03,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:24:03,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:03,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:03,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:03,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:03,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402033689] [2025-04-29 11:24:03,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402033689] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:03,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:03,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:24:03,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497441936] [2025-04-29 11:24:03,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:03,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:24:03,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:03,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:24:03,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:24:03,829 INFO L87 Difference]: Start difference. First operand 207 states and 333 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:03,869 INFO L93 Difference]: Finished difference Result 384 states and 592 transitions. [2025-04-29 11:24:03,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:24:03,870 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:24:03,870 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:03,871 INFO L225 Difference]: With dead ends: 384 [2025-04-29 11:24:03,871 INFO L226 Difference]: Without dead ends: 384 [2025-04-29 11:24:03,871 INFO L436 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-04-29 11:24:03,872 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 52 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:03,872 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 264 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:03,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-04-29 11:24:03,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 357. [2025-04-29 11:24:03,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 341 states have (on average 1.6744868035190617) internal successors, (571), 356 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 571 transitions. [2025-04-29 11:24:03,887 INFO L79 Accepts]: Start accepts. Automaton has 357 states and 571 transitions. Word has length 10 [2025-04-29 11:24:03,887 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:03,888 INFO L485 AbstractCegarLoop]: Abstraction has 357 states and 571 transitions. [2025-04-29 11:24:03,888 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,888 INFO L278 IsEmpty]: Start isEmpty. Operand 357 states and 571 transitions. [2025-04-29 11:24:03,889 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:24:03,889 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:03,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:03,889 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:24:03,889 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:03,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:03,890 INFO L85 PathProgramCache]: Analyzing trace with hash 516607341, now seen corresponding path program 1 times [2025-04-29 11:24:03,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:03,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035311259] [2025-04-29 11:24:03,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:03,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:03,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:24:03,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:24:03,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:03,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:03,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:03,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035311259] [2025-04-29 11:24:03,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035311259] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:03,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:03,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:24:03,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309793907] [2025-04-29 11:24:03,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:03,936 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:24:03,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:03,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:24:03,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:24:03,936 INFO L87 Difference]: Start difference. First operand 357 states and 571 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:03,979 INFO L93 Difference]: Finished difference Result 632 states and 946 transitions. [2025-04-29 11:24:03,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:24:03,979 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-29 11:24:03,979 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:03,981 INFO L225 Difference]: With dead ends: 632 [2025-04-29 11:24:03,981 INFO L226 Difference]: Without dead ends: 632 [2025-04-29 11:24:03,981 INFO L436 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-04-29 11:24:03,982 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:03,982 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 262 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-04-29 11:24:03,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 601. [2025-04-29 11:24:03,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 585 states have (on average 1.570940170940171) internal successors, (919), 600 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 919 transitions. [2025-04-29 11:24:03,993 INFO L79 Accepts]: Start accepts. Automaton has 601 states and 919 transitions. Word has length 11 [2025-04-29 11:24:03,993 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:03,993 INFO L485 AbstractCegarLoop]: Abstraction has 601 states and 919 transitions. [2025-04-29 11:24:03,993 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:03,993 INFO L278 IsEmpty]: Start isEmpty. Operand 601 states and 919 transitions. [2025-04-29 11:24:03,993 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:24:03,994 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:03,994 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:03,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:24:03,994 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:03,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:03,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1842867688, now seen corresponding path program 1 times [2025-04-29 11:24:03,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:03,994 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068073234] [2025-04-29 11:24:03,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:03,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:04,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:24:04,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:24:04,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:04,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:24:04,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:04,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068073234] [2025-04-29 11:24:04,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068073234] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:04,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:04,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:24:04,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808138379] [2025-04-29 11:24:04,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:04,066 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:04,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:04,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:04,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:04,068 INFO L87 Difference]: Start difference. First operand 601 states and 919 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:04,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:04,076 INFO L93 Difference]: Finished difference Result 625 states and 943 transitions. [2025-04-29 11:24:04,077 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:04,077 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-29 11:24:04,077 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:04,079 INFO L225 Difference]: With dead ends: 625 [2025-04-29 11:24:04,079 INFO L226 Difference]: Without dead ends: 625 [2025-04-29 11:24:04,079 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:04,080 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:04,080 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-04-29 11:24:04,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 617. [2025-04-29 11:24:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 601 states have (on average 1.5557404326123128) internal successors, (935), 616 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 935 transitions. [2025-04-29 11:24:04,090 INFO L79 Accepts]: Start accepts. Automaton has 617 states and 935 transitions. Word has length 16 [2025-04-29 11:24:04,090 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:04,090 INFO L485 AbstractCegarLoop]: Abstraction has 617 states and 935 transitions. [2025-04-29 11:24:04,090 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:04,090 INFO L278 IsEmpty]: Start isEmpty. Operand 617 states and 935 transitions. [2025-04-29 11:24:04,090 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:24:04,090 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:04,090 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:04,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:24:04,091 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:04,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:04,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1842808106, now seen corresponding path program 1 times [2025-04-29 11:24:04,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:04,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618168116] [2025-04-29 11:24:04,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:04,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:04,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:24:04,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:24:04,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:04,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:04,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:04,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618168116] [2025-04-29 11:24:04,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618168116] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:04,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:04,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:24:04,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980160966] [2025-04-29 11:24:04,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:04,169 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:24:04,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:04,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:24:04,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:24:04,169 INFO L87 Difference]: Start difference. First operand 617 states and 935 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:04,207 INFO L93 Difference]: Finished difference Result 941 states and 1441 transitions. [2025-04-29 11:24:04,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:24:04,207 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-29 11:24:04,207 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:04,210 INFO L225 Difference]: With dead ends: 941 [2025-04-29 11:24:04,210 INFO L226 Difference]: Without dead ends: 941 [2025-04-29 11:24:04,210 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:24:04,211 INFO L437 NwaCegarLoop]: 115 mSDtfsCounter, 102 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:04,211 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 279 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:04,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-04-29 11:24:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 923. [2025-04-29 11:24:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 907 states have (on average 1.579933847850055) internal successors, (1433), 922 states have internal predecessors, (1433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1433 transitions. [2025-04-29 11:24:04,227 INFO L79 Accepts]: Start accepts. Automaton has 923 states and 1433 transitions. Word has length 16 [2025-04-29 11:24:04,227 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:04,227 INFO L485 AbstractCegarLoop]: Abstraction has 923 states and 1433 transitions. [2025-04-29 11:24:04,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:04,228 INFO L278 IsEmpty]: Start isEmpty. Operand 923 states and 1433 transitions. [2025-04-29 11:24:04,228 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:24:04,228 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:04,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:04,228 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:24:04,229 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:04,229 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:04,229 INFO L85 PathProgramCache]: Analyzing trace with hash 933583904, now seen corresponding path program 1 times [2025-04-29 11:24:04,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:04,229 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496581234] [2025-04-29 11:24:04,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:04,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:04,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:24:04,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:24:04,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:04,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:04,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:04,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496581234] [2025-04-29 11:24:04,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496581234] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:04,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543530637] [2025-04-29 11:24:04,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:04,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:04,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:04,284 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-04-29 11:24:04,286 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-04-29 11:24:04,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:24:04,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:24:04,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:04,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:04,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:24:04,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:04,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:04,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:04,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543530637] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:04,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:04,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2025-04-29 11:24:04,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522237110] [2025-04-29 11:24:04,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:04,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:24:04,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:04,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:24:04,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:24:04,422 INFO L87 Difference]: Start difference. First operand 923 states and 1433 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:04,534 INFO L93 Difference]: Finished difference Result 1435 states and 2143 transitions. [2025-04-29 11:24:04,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:24:04,534 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:24:04,535 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:04,538 INFO L225 Difference]: With dead ends: 1435 [2025-04-29 11:24:04,538 INFO L226 Difference]: Without dead ends: 1435 [2025-04-29 11:24:04,539 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:24:04,539 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 139 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:04,539 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 370 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:04,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2025-04-29 11:24:04,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1325. [2025-04-29 11:24:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1309 states have (on average 1.5454545454545454) internal successors, (2023), 1324 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 2023 transitions. [2025-04-29 11:24:04,558 INFO L79 Accepts]: Start accepts. Automaton has 1325 states and 2023 transitions. Word has length 18 [2025-04-29 11:24:04,558 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:04,558 INFO L485 AbstractCegarLoop]: Abstraction has 1325 states and 2023 transitions. [2025-04-29 11:24:04,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:04,558 INFO L278 IsEmpty]: Start isEmpty. Operand 1325 states and 2023 transitions. [2025-04-29 11:24:04,559 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:24:04,559 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:04,559 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:04,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:04,759 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-29 11:24:04,760 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:04,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:04,760 INFO L85 PathProgramCache]: Analyzing trace with hash -644832843, now seen corresponding path program 1 times [2025-04-29 11:24:04,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:04,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496192579] [2025-04-29 11:24:04,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:04,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:04,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:24:04,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:24:04,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:04,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:04,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:24:04,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:04,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496192579] [2025-04-29 11:24:04,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496192579] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:04,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:04,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:24:04,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810065840] [2025-04-29 11:24:04,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:04,813 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:24:04,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:04,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:24:04,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:24:04,814 INFO L87 Difference]: Start difference. First operand 1325 states and 2023 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:04,836 INFO L93 Difference]: Finished difference Result 382 states and 535 transitions. [2025-04-29 11:24:04,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:24:04,837 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-29 11:24:04,837 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:04,838 INFO L225 Difference]: With dead ends: 382 [2025-04-29 11:24:04,838 INFO L226 Difference]: Without dead ends: 382 [2025-04-29 11:24:04,838 INFO L436 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-04-29 11:24:04,838 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 45 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:04,838 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 173 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:04,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-04-29 11:24:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 370. [2025-04-29 11:24:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 358 states have (on average 1.4776536312849162) internal successors, (529), 369 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:04,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 529 transitions. [2025-04-29 11:24:04,845 INFO L79 Accepts]: Start accepts. Automaton has 370 states and 529 transitions. Word has length 23 [2025-04-29 11:24:04,845 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:04,845 INFO L485 AbstractCegarLoop]: Abstraction has 370 states and 529 transitions. [2025-04-29 11:24:04,845 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:04,845 INFO L278 IsEmpty]: Start isEmpty. Operand 370 states and 529 transitions. [2025-04-29 11:24:04,847 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:24:04,847 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:04,847 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:04,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:24:04,848 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:04,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:04,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1395065772, now seen corresponding path program 1 times [2025-04-29 11:24:04,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:04,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823448532] [2025-04-29 11:24:04,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:04,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:04,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:24:04,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:24:04,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:04,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:04,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:04,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823448532] [2025-04-29 11:24:04,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823448532] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:04,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290766563] [2025-04-29 11:24:04,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:04,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:04,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:04,935 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-04-29 11:24:04,936 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-04-29 11:24:04,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:24:04,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:24:04,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:04,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:04,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:24:04,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:05,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:05,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290766563] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:05,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:05,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-29 11:24:05,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644887040] [2025-04-29 11:24:05,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:05,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:24:05,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:05,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:24:05,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:24:05,115 INFO L87 Difference]: Start difference. First operand 370 states and 529 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:05,182 INFO L93 Difference]: Finished difference Result 1102 states and 1561 transitions. [2025-04-29 11:24:05,183 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:24:05,183 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-29 11:24:05,183 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:05,187 INFO L225 Difference]: With dead ends: 1102 [2025-04-29 11:24:05,187 INFO L226 Difference]: Without dead ends: 1102 [2025-04-29 11:24:05,188 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:24:05,188 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 177 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:05,188 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 161 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2025-04-29 11:24:05,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1060. [2025-04-29 11:24:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 1048 states have (on average 1.4608778625954197) internal successors, (1531), 1059 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1531 transitions. [2025-04-29 11:24:05,204 INFO L79 Accepts]: Start accepts. Automaton has 1060 states and 1531 transitions. Word has length 27 [2025-04-29 11:24:05,204 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:05,204 INFO L485 AbstractCegarLoop]: Abstraction has 1060 states and 1531 transitions. [2025-04-29 11:24:05,204 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:05,204 INFO L278 IsEmpty]: Start isEmpty. Operand 1060 states and 1531 transitions. [2025-04-29 11:24:05,205 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:24:05,205 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:05,205 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:05,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:24:05,405 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-29 11:24:05,406 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:05,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:05,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1359367982, now seen corresponding path program 1 times [2025-04-29 11:24:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:05,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450415399] [2025-04-29 11:24:05,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:05,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:05,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:24:05,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:24:05,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:05,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:05,485 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:05,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:05,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450415399] [2025-04-29 11:24:05,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450415399] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:05,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666622795] [2025-04-29 11:24:05,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:05,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:05,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:05,487 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-04-29 11:24:05,489 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-04-29 11:24:05,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:24:05,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:24:05,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:05,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:05,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:24:05,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:05,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:05,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666622795] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:05,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:05,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-04-29 11:24:05,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348878259] [2025-04-29 11:24:05,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:05,611 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:24:05,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:05,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:24:05,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:24:05,611 INFO L87 Difference]: Start difference. First operand 1060 states and 1531 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:05,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:05,769 INFO L93 Difference]: Finished difference Result 2542 states and 3529 transitions. [2025-04-29 11:24:05,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:24:05,769 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-29 11:24:05,769 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:05,777 INFO L225 Difference]: With dead ends: 2542 [2025-04-29 11:24:05,777 INFO L226 Difference]: Without dead ends: 2542 [2025-04-29 11:24:05,778 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:24:05,778 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 362 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:05,779 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 432 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2025-04-29 11:24:05,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2284. [2025-04-29 11:24:05,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 2272 states have (on average 1.4423415492957747) internal successors, (3277), 2283 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3277 transitions. [2025-04-29 11:24:05,814 INFO L79 Accepts]: Start accepts. Automaton has 2284 states and 3277 transitions. Word has length 28 [2025-04-29 11:24:05,814 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:05,814 INFO L485 AbstractCegarLoop]: Abstraction has 2284 states and 3277 transitions. [2025-04-29 11:24:05,814 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:05,814 INFO L278 IsEmpty]: Start isEmpty. Operand 2284 states and 3277 transitions. [2025-04-29 11:24:05,816 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:24:05,816 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:05,816 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:05,822 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-04-29 11:24:06,021 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:06,021 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:06,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:06,021 INFO L85 PathProgramCache]: Analyzing trace with hash 716480828, now seen corresponding path program 1 times [2025-04-29 11:24:06,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:06,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762221674] [2025-04-29 11:24:06,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:06,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:06,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:24:06,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:24:06,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:06,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:24:06,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:06,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762221674] [2025-04-29 11:24:06,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762221674] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:06,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804633700] [2025-04-29 11:24:06,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:06,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:06,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:06,090 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-04-29 11:24:06,092 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-04-29 11:24:06,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:24:06,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:24:06,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:06,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:06,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-29 11:24:06,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:24:06,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:24:06,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804633700] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:06,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:06,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2025-04-29 11:24:06,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681904146] [2025-04-29 11:24:06,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:06,180 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:24:06,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:06,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:24:06,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:24:06,182 INFO L87 Difference]: Start difference. First operand 2284 states and 3277 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:06,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:06,252 INFO L93 Difference]: Finished difference Result 1107 states and 1543 transitions. [2025-04-29 11:24:06,253 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:24:06,254 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-29 11:24:06,254 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:06,257 INFO L225 Difference]: With dead ends: 1107 [2025-04-29 11:24:06,257 INFO L226 Difference]: Without dead ends: 1107 [2025-04-29 11:24:06,257 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:24:06,257 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 79 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:06,257 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 481 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:06,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-04-29 11:24:06,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 877. [2025-04-29 11:24:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 865 states have (on average 1.4439306358381503) internal successors, (1249), 876 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1249 transitions. [2025-04-29 11:24:06,270 INFO L79 Accepts]: Start accepts. Automaton has 877 states and 1249 transitions. Word has length 30 [2025-04-29 11:24:06,270 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:06,270 INFO L485 AbstractCegarLoop]: Abstraction has 877 states and 1249 transitions. [2025-04-29 11:24:06,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:06,270 INFO L278 IsEmpty]: Start isEmpty. Operand 877 states and 1249 transitions. [2025-04-29 11:24:06,271 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-29 11:24:06,271 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:06,271 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:06,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:06,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-29 11:24:06,472 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:06,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:06,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1293143655, now seen corresponding path program 1 times [2025-04-29 11:24:06,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:06,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314358368] [2025-04-29 11:24:06,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:06,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:06,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:24:06,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:24:06,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:06,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-04-29 11:24:06,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:06,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314358368] [2025-04-29 11:24:06,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314358368] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:06,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689300420] [2025-04-29 11:24:06,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:06,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:06,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:06,613 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-04-29 11:24:06,615 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-04-29 11:24:06,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:24:06,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:24:06,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:06,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:06,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:24:06,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 56 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:24:06,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:06,838 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 56 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:24:06,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689300420] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:06,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:06,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 12 [2025-04-29 11:24:06,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285436193] [2025-04-29 11:24:06,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:06,839 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:24:06,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:06,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:24:06,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:24:06,839 INFO L87 Difference]: Start difference. First operand 877 states and 1249 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:07,029 INFO L93 Difference]: Finished difference Result 2056 states and 2854 transitions. [2025-04-29 11:24:07,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:24:07,030 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-04-29 11:24:07,030 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:07,035 INFO L225 Difference]: With dead ends: 2056 [2025-04-29 11:24:07,035 INFO L226 Difference]: Without dead ends: 2056 [2025-04-29 11:24:07,036 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 102 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2025-04-29 11:24:07,037 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 453 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:07,037 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 539 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:07,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2025-04-29 11:24:07,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 985. [2025-04-29 11:24:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 973 states have (on average 1.4583761562178827) internal successors, (1419), 984 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1419 transitions. [2025-04-29 11:24:07,055 INFO L79 Accepts]: Start accepts. Automaton has 985 states and 1419 transitions. Word has length 55 [2025-04-29 11:24:07,055 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:07,056 INFO L485 AbstractCegarLoop]: Abstraction has 985 states and 1419 transitions. [2025-04-29 11:24:07,056 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:07,056 INFO L278 IsEmpty]: Start isEmpty. Operand 985 states and 1419 transitions. [2025-04-29 11:24:07,057 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-29 11:24:07,057 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:07,057 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:07,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:07,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-29 11:24:07,258 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:07,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:07,258 INFO L85 PathProgramCache]: Analyzing trace with hash 270158360, now seen corresponding path program 1 times [2025-04-29 11:24:07,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:07,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061926715] [2025-04-29 11:24:07,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:07,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:07,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:24:07,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:24:07,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:07,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-04-29 11:24:07,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:07,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061926715] [2025-04-29 11:24:07,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061926715] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:07,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128436200] [2025-04-29 11:24:07,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:07,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:07,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:07,362 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-04-29 11:24:07,364 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-04-29 11:24:07,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:24:07,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:24:07,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:07,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:07,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 11:24:07,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:07,519 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 20 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:07,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 20 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:07,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128436200] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:07,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:07,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2025-04-29 11:24:07,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659363648] [2025-04-29 11:24:07,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:07,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:24:07,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:07,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:24:07,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:24:07,585 INFO L87 Difference]: Start difference. First operand 985 states and 1419 transitions. Second operand has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:07,916 INFO L93 Difference]: Finished difference Result 2445 states and 3245 transitions. [2025-04-29 11:24:07,916 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-29 11:24:07,916 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-04-29 11:24:07,917 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:07,922 INFO L225 Difference]: With dead ends: 2445 [2025-04-29 11:24:07,922 INFO L226 Difference]: Without dead ends: 2445 [2025-04-29 11:24:07,923 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=967, Unknown=0, NotChecked=0, Total=1190 [2025-04-29 11:24:07,923 INFO L437 NwaCegarLoop]: 243 mSDtfsCounter, 282 mSDsluCounter, 2105 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:07,923 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 2348 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:24:07,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2025-04-29 11:24:07,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 1818. [2025-04-29 11:24:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1806 states have (on average 1.393687707641196) internal successors, (2517), 1817 states have internal predecessors, (2517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2517 transitions. [2025-04-29 11:24:07,946 INFO L79 Accepts]: Start accepts. Automaton has 1818 states and 2517 transitions. Word has length 59 [2025-04-29 11:24:07,946 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:07,946 INFO L485 AbstractCegarLoop]: Abstraction has 1818 states and 2517 transitions. [2025-04-29 11:24:07,946 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:07,946 INFO L278 IsEmpty]: Start isEmpty. Operand 1818 states and 2517 transitions. [2025-04-29 11:24:07,947 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-29 11:24:07,947 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:07,947 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:07,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:08,147 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-29 11:24:08,148 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:08,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:08,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1825876446, now seen corresponding path program 1 times [2025-04-29 11:24:08,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:08,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065763367] [2025-04-29 11:24:08,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:08,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:08,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-29 11:24:08,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-29 11:24:08,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:08,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 38 proven. 51 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-04-29 11:24:08,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:08,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065763367] [2025-04-29 11:24:08,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065763367] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:08,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012979213] [2025-04-29 11:24:08,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:08,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:08,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:08,251 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-04-29 11:24:08,252 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-04-29 11:24:08,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-29 11:24:08,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-29 11:24:08,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:08,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:08,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:24:08,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:08,385 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 38 proven. 51 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-04-29 11:24:08,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 38 proven. 51 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-04-29 11:24:08,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012979213] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:08,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:08,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-29 11:24:08,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486707471] [2025-04-29 11:24:08,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:08,444 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:24:08,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:08,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:24:08,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:24:08,446 INFO L87 Difference]: Start difference. First operand 1818 states and 2517 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:08,507 INFO L93 Difference]: Finished difference Result 3241 states and 4532 transitions. [2025-04-29 11:24:08,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:24:08,508 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-04-29 11:24:08,508 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:08,515 INFO L225 Difference]: With dead ends: 3241 [2025-04-29 11:24:08,515 INFO L226 Difference]: Without dead ends: 3241 [2025-04-29 11:24:08,516 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:24:08,517 INFO L437 NwaCegarLoop]: 94 mSDtfsCounter, 114 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:08,517 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 261 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:08,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2025-04-29 11:24:08,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 2663. [2025-04-29 11:24:08,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2651 states have (on average 1.4236137306676726) internal successors, (3774), 2662 states have internal predecessors, (3774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3774 transitions. [2025-04-29 11:24:08,553 INFO L79 Accepts]: Start accepts. Automaton has 2663 states and 3774 transitions. Word has length 69 [2025-04-29 11:24:08,553 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:08,554 INFO L485 AbstractCegarLoop]: Abstraction has 2663 states and 3774 transitions. [2025-04-29 11:24:08,554 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:08,554 INFO L278 IsEmpty]: Start isEmpty. Operand 2663 states and 3774 transitions. [2025-04-29 11:24:08,555 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-04-29 11:24:08,555 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:08,555 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:08,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:08,755 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:08,755 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:08,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash -844997803, now seen corresponding path program 1 times [2025-04-29 11:24:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:08,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108121928] [2025-04-29 11:24:08,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:08,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:08,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 11:24:08,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 11:24:08,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:08,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-29 11:24:08,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:08,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108121928] [2025-04-29 11:24:08,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108121928] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:08,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089546018] [2025-04-29 11:24:08,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:08,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:08,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:08,890 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-04-29 11:24:08,892 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-04-29 11:24:08,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 11:24:08,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 11:24:08,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:08,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:08,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:24:08,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-29 11:24:09,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-29 11:24:09,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089546018] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:09,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:09,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-29 11:24:09,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269006450] [2025-04-29 11:24:09,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:09,097 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:24:09,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:09,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:24:09,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:24:09,097 INFO L87 Difference]: Start difference. First operand 2663 states and 3774 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:09,226 INFO L93 Difference]: Finished difference Result 5554 states and 7773 transitions. [2025-04-29 11:24:09,226 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:24:09,226 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-04-29 11:24:09,227 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:09,239 INFO L225 Difference]: With dead ends: 5554 [2025-04-29 11:24:09,239 INFO L226 Difference]: Without dead ends: 5554 [2025-04-29 11:24:09,240 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:24:09,240 INFO L437 NwaCegarLoop]: 96 mSDtfsCounter, 251 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:09,240 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 271 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:09,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5554 states. [2025-04-29 11:24:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5554 to 4754. [2025-04-29 11:24:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4754 states, 4743 states have (on average 1.425258275353152) internal successors, (6760), 4753 states have internal predecessors, (6760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 6760 transitions. [2025-04-29 11:24:09,325 INFO L79 Accepts]: Start accepts. Automaton has 4754 states and 6760 transitions. Word has length 77 [2025-04-29 11:24:09,325 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:09,325 INFO L485 AbstractCegarLoop]: Abstraction has 4754 states and 6760 transitions. [2025-04-29 11:24:09,325 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:09,326 INFO L278 IsEmpty]: Start isEmpty. Operand 4754 states and 6760 transitions. [2025-04-29 11:24:09,326 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-04-29 11:24:09,326 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:09,326 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:09,333 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-04-29 11:24:09,527 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:09,527 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:09,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:09,528 INFO L85 PathProgramCache]: Analyzing trace with hash -844997802, now seen corresponding path program 1 times [2025-04-29 11:24:09,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:09,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120902003] [2025-04-29 11:24:09,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:09,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:09,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 11:24:09,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 11:24:09,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:09,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-29 11:24:09,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:09,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120902003] [2025-04-29 11:24:09,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120902003] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:09,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732549288] [2025-04-29 11:24:09,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:09,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:09,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:09,722 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-04-29 11:24:09,724 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-04-29 11:24:09,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 11:24:09,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 11:24:09,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:09,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:09,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:24:09,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:09,812 INFO L354 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-04-29 11:24:09,990 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-29 11:24:09,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-29 11:24:10,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732549288] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:10,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:10,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 9 [2025-04-29 11:24:10,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289739899] [2025-04-29 11:24:10,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:10,192 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:24:10,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:10,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:24:10,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:24:10,193 INFO L87 Difference]: Start difference. First operand 4754 states and 6760 transitions. Second operand has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:10,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:10,398 INFO L93 Difference]: Finished difference Result 8759 states and 12296 transitions. [2025-04-29 11:24:10,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:24:10,398 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-04-29 11:24:10,398 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:10,424 INFO L225 Difference]: With dead ends: 8759 [2025-04-29 11:24:10,424 INFO L226 Difference]: Without dead ends: 8759 [2025-04-29 11:24:10,424 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:24:10,425 INFO L437 NwaCegarLoop]: 103 mSDtfsCounter, 645 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:10,425 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 352 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:10,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8759 states. [2025-04-29 11:24:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8759 to 7138. [2025-04-29 11:24:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7138 states, 7127 states have (on average 1.4365090500912026) internal successors, (10238), 7137 states have internal predecessors, (10238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7138 states to 7138 states and 10238 transitions. [2025-04-29 11:24:10,530 INFO L79 Accepts]: Start accepts. Automaton has 7138 states and 10238 transitions. Word has length 77 [2025-04-29 11:24:10,531 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:10,531 INFO L485 AbstractCegarLoop]: Abstraction has 7138 states and 10238 transitions. [2025-04-29 11:24:10,531 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:10,531 INFO L278 IsEmpty]: Start isEmpty. Operand 7138 states and 10238 transitions. [2025-04-29 11:24:10,534 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-04-29 11:24:10,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:10,535 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 6, 6, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:10,542 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-04-29 11:24:10,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:10,736 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:10,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:10,736 INFO L85 PathProgramCache]: Analyzing trace with hash 172166538, now seen corresponding path program 1 times [2025-04-29 11:24:10,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:10,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505438493] [2025-04-29 11:24:10,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:10,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:10,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-04-29 11:24:10,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-04-29 11:24:10,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:10,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:10,836 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-04-29 11:24:10,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:10,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505438493] [2025-04-29 11:24:10,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505438493] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:10,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:10,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:24:10,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799656157] [2025-04-29 11:24:10,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:10,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:24:10,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:10,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:24:10,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:24:10,837 INFO L87 Difference]: Start difference. First operand 7138 states and 10238 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:10,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:10,922 INFO L93 Difference]: Finished difference Result 12586 states and 17966 transitions. [2025-04-29 11:24:10,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:24:10,923 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-04-29 11:24:10,923 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:10,946 INFO L225 Difference]: With dead ends: 12586 [2025-04-29 11:24:10,946 INFO L226 Difference]: Without dead ends: 12586 [2025-04-29 11:24:10,947 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:24:10,947 INFO L437 NwaCegarLoop]: 97 mSDtfsCounter, 58 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:10,947 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 353 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:10,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12586 states. [2025-04-29 11:24:11,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12586 to 8370. [2025-04-29 11:24:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8370 states, 8359 states have (on average 1.4492164134465846) internal successors, (12114), 8369 states have internal predecessors, (12114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8370 states to 8370 states and 12114 transitions. [2025-04-29 11:24:11,080 INFO L79 Accepts]: Start accepts. Automaton has 8370 states and 12114 transitions. Word has length 96 [2025-04-29 11:24:11,080 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:11,080 INFO L485 AbstractCegarLoop]: Abstraction has 8370 states and 12114 transitions. [2025-04-29 11:24:11,080 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:11,081 INFO L278 IsEmpty]: Start isEmpty. Operand 8370 states and 12114 transitions. [2025-04-29 11:24:11,083 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-04-29 11:24:11,083 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:11,083 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 6, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:11,083 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:24:11,084 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:11,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:11,084 INFO L85 PathProgramCache]: Analyzing trace with hash 829545069, now seen corresponding path program 1 times [2025-04-29 11:24:11,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:11,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718481599] [2025-04-29 11:24:11,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:11,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:11,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-04-29 11:24:11,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-04-29 11:24:11,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:11,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:11,256 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-04-29 11:24:11,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:11,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718481599] [2025-04-29 11:24:11,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718481599] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:11,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006883805] [2025-04-29 11:24:11,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:11,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:11,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:11,259 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-04-29 11:24:11,260 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-04-29 11:24:11,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-04-29 11:24:11,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-04-29 11:24:11,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:11,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:11,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-29 11:24:11,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:11,453 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-04-29 11:24:11,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-04-29 11:24:11,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006883805] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:11,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:11,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-04-29 11:24:11,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977070519] [2025-04-29 11:24:11,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:11,529 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:24:11,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:11,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:24:11,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:24:11,529 INFO L87 Difference]: Start difference. First operand 8370 states and 12114 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:11,756 INFO L93 Difference]: Finished difference Result 17108 states and 23825 transitions. [2025-04-29 11:24:11,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 11:24:11,756 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-04-29 11:24:11,756 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:11,787 INFO L225 Difference]: With dead ends: 17108 [2025-04-29 11:24:11,788 INFO L226 Difference]: Without dead ends: 17108 [2025-04-29 11:24:11,788 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:24:11,790 INFO L437 NwaCegarLoop]: 145 mSDtfsCounter, 353 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:11,790 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 1128 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:11,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17108 states. [2025-04-29 11:24:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17108 to 15462. [2025-04-29 11:24:11,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15462 states, 15451 states have (on average 1.399197462947382) internal successors, (21619), 15461 states have internal predecessors, (21619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15462 states to 15462 states and 21619 transitions. [2025-04-29 11:24:11,997 INFO L79 Accepts]: Start accepts. Automaton has 15462 states and 21619 transitions. Word has length 104 [2025-04-29 11:24:11,997 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:11,997 INFO L485 AbstractCegarLoop]: Abstraction has 15462 states and 21619 transitions. [2025-04-29 11:24:11,998 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:11,998 INFO L278 IsEmpty]: Start isEmpty. Operand 15462 states and 21619 transitions. [2025-04-29 11:24:12,001 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-04-29 11:24:12,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:12,002 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 11, 7, 6, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:12,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:12,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-29 11:24:12,203 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:12,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:12,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1392239262, now seen corresponding path program 1 times [2025-04-29 11:24:12,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:12,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696621677] [2025-04-29 11:24:12,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:12,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:12,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-04-29 11:24:12,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-04-29 11:24:12,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:12,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 185 proven. 1 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-04-29 11:24:12,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:12,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696621677] [2025-04-29 11:24:12,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696621677] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:12,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394935040] [2025-04-29 11:24:12,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:12,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:12,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:12,310 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-04-29 11:24:12,312 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-04-29 11:24:12,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-04-29 11:24:12,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-04-29 11:24:12,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:12,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:12,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 11:24:12,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 298 proven. 8 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-04-29 11:24:12,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:12,676 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 298 proven. 8 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-04-29 11:24:12,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394935040] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:12,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:12,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 16 [2025-04-29 11:24:12,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731240685] [2025-04-29 11:24:12,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:12,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:24:12,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:12,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:24:12,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:24:12,680 INFO L87 Difference]: Start difference. First operand 15462 states and 21619 transitions. Second operand has 16 states, 16 states have (on average 11.0625) internal successors, (177), 16 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:12,894 INFO L93 Difference]: Finished difference Result 14580 states and 18970 transitions. [2025-04-29 11:24:12,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:24:12,895 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.0625) internal successors, (177), 16 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2025-04-29 11:24:12,895 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:12,913 INFO L225 Difference]: With dead ends: 14580 [2025-04-29 11:24:12,913 INFO L226 Difference]: Without dead ends: 11282 [2025-04-29 11:24:12,914 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 221 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=261, Invalid=495, Unknown=0, NotChecked=0, Total=756 [2025-04-29 11:24:12,914 INFO L437 NwaCegarLoop]: 281 mSDtfsCounter, 346 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:12,914 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1534 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:12,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11282 states. [2025-04-29 11:24:13,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11282 to 10298. [2025-04-29 11:24:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10298 states, 10288 states have (on average 1.3133748055987557) internal successors, (13512), 10297 states have internal predecessors, (13512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10298 states to 10298 states and 13512 transitions. [2025-04-29 11:24:13,054 INFO L79 Accepts]: Start accepts. Automaton has 10298 states and 13512 transitions. Word has length 115 [2025-04-29 11:24:13,054 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:13,054 INFO L485 AbstractCegarLoop]: Abstraction has 10298 states and 13512 transitions. [2025-04-29 11:24:13,054 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.0625) internal successors, (177), 16 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:13,054 INFO L278 IsEmpty]: Start isEmpty. Operand 10298 states and 13512 transitions. [2025-04-29 11:24:13,057 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-04-29 11:24:13,057 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:13,058 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:13,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-29 11:24:13,258 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-29 11:24:13,258 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:13,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:13,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1564274726, now seen corresponding path program 1 times [2025-04-29 11:24:13,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:13,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606998399] [2025-04-29 11:24:13,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:13,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:13,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-04-29 11:24:13,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-04-29 11:24:13,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:13,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 104 proven. 3 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-04-29 11:24:13,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:13,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606998399] [2025-04-29 11:24:13,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606998399] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:13,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138578238] [2025-04-29 11:24:13,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:13,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:13,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:13,371 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:13,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 11:24:13,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-04-29 11:24:13,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-04-29 11:24:13,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:13,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:13,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-29 11:24:13,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:13,593 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 224 proven. 10 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-04-29 11:24:13,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 224 proven. 10 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-04-29 11:24:13,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138578238] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:13,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:13,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2025-04-29 11:24:13,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820926809] [2025-04-29 11:24:13,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:13,727 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:24:13,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:13,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:24:13,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:24:13,728 INFO L87 Difference]: Start difference. First operand 10298 states and 13512 transitions. Second operand has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:13,866 INFO L93 Difference]: Finished difference Result 6917 states and 8807 transitions. [2025-04-29 11:24:13,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:24:13,866 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-04-29 11:24:13,866 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:13,878 INFO L225 Difference]: With dead ends: 6917 [2025-04-29 11:24:13,879 INFO L226 Difference]: Without dead ends: 6917 [2025-04-29 11:24:13,879 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 229 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:24:13,880 INFO L437 NwaCegarLoop]: 225 mSDtfsCounter, 210 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:13,880 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1231 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6917 states. [2025-04-29 11:24:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6917 to 5443. [2025-04-29 11:24:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5443 states, 5433 states have (on average 1.2849254555494203) internal successors, (6981), 5442 states have internal predecessors, (6981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5443 states to 5443 states and 6981 transitions. [2025-04-29 11:24:13,950 INFO L79 Accepts]: Start accepts. Automaton has 5443 states and 6981 transitions. Word has length 118 [2025-04-29 11:24:13,951 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:13,951 INFO L485 AbstractCegarLoop]: Abstraction has 5443 states and 6981 transitions. [2025-04-29 11:24:13,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:13,951 INFO L278 IsEmpty]: Start isEmpty. Operand 5443 states and 6981 transitions. [2025-04-29 11:24:13,955 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-04-29 11:24:13,955 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:13,955 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:13,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-29 11:24:14,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-29 11:24:14,159 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:14,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:14,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1453372266, now seen corresponding path program 1 times [2025-04-29 11:24:14,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:14,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697731842] [2025-04-29 11:24:14,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:14,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:14,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-29 11:24:14,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-29 11:24:14,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:14,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 244 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-04-29 11:24:14,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:14,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697731842] [2025-04-29 11:24:14,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697731842] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:14,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72677041] [2025-04-29 11:24:14,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:14,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:14,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:14,288 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:14,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-29 11:24:14,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-29 11:24:14,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-29 11:24:14,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:14,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:14,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:24:14,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 157 proven. 12 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2025-04-29 11:24:14,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 157 proven. 12 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2025-04-29 11:24:14,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72677041] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:14,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:14,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2025-04-29 11:24:14,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572878473] [2025-04-29 11:24:14,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:14,683 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:24:14,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:14,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:24:14,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:24:14,683 INFO L87 Difference]: Start difference. First operand 5443 states and 6981 transitions. Second operand has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:15,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:15,431 INFO L93 Difference]: Finished difference Result 14154 states and 18017 transitions. [2025-04-29 11:24:15,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-29 11:24:15,432 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-04-29 11:24:15,432 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:15,454 INFO L225 Difference]: With dead ends: 14154 [2025-04-29 11:24:15,455 INFO L226 Difference]: Without dead ends: 14154 [2025-04-29 11:24:15,455 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=446, Invalid=1360, Unknown=0, NotChecked=0, Total=1806 [2025-04-29 11:24:15,456 INFO L437 NwaCegarLoop]: 91 mSDtfsCounter, 1319 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:15,456 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 858 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 11:24:15,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14154 states. [2025-04-29 11:24:15,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14154 to 5444. [2025-04-29 11:24:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5444 states, 5434 states have (on average 1.284873021715127) internal successors, (6982), 5443 states have internal predecessors, (6982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5444 states to 5444 states and 6982 transitions. [2025-04-29 11:24:15,529 INFO L79 Accepts]: Start accepts. Automaton has 5444 states and 6982 transitions. Word has length 122 [2025-04-29 11:24:15,531 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:15,531 INFO L485 AbstractCegarLoop]: Abstraction has 5444 states and 6982 transitions. [2025-04-29 11:24:15,531 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:15,531 INFO L278 IsEmpty]: Start isEmpty. Operand 5444 states and 6982 transitions. [2025-04-29 11:24:15,534 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-04-29 11:24:15,534 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:15,534 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:15,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-29 11:24:15,737 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-29 11:24:15,737 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:15,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:15,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1453371882, now seen corresponding path program 1 times [2025-04-29 11:24:15,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:15,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203184620] [2025-04-29 11:24:15,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:15,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:15,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-29 11:24:15,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-29 11:24:15,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:15,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:15,834 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 220 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-29 11:24:15,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:15,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203184620] [2025-04-29 11:24:15,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203184620] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:15,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703011585] [2025-04-29 11:24:15,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:15,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:15,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:15,836 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:15,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-29 11:24:15,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-29 11:24:15,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-29 11:24:15,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:15,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:15,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:24:15,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 220 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-29 11:24:16,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 220 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-29 11:24:16,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703011585] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:16,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:16,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-29 11:24:16,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554616833] [2025-04-29 11:24:16,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:16,138 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:24:16,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:16,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:24:16,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:24:16,139 INFO L87 Difference]: Start difference. First operand 5444 states and 6982 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:16,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:16,329 INFO L93 Difference]: Finished difference Result 7513 states and 9544 transitions. [2025-04-29 11:24:16,329 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:24:16,329 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-04-29 11:24:16,329 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:16,339 INFO L225 Difference]: With dead ends: 7513 [2025-04-29 11:24:16,339 INFO L226 Difference]: Without dead ends: 7513 [2025-04-29 11:24:16,340 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:24:16,340 INFO L437 NwaCegarLoop]: 126 mSDtfsCounter, 309 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:16,340 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 433 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7513 states. [2025-04-29 11:24:16,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7513 to 5444. [2025-04-29 11:24:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5444 states, 5435 states have (on average 1.284820607175713) internal successors, (6983), 5443 states have internal predecessors, (6983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5444 states to 5444 states and 6983 transitions. [2025-04-29 11:24:16,386 INFO L79 Accepts]: Start accepts. Automaton has 5444 states and 6983 transitions. Word has length 122 [2025-04-29 11:24:16,386 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:16,386 INFO L485 AbstractCegarLoop]: Abstraction has 5444 states and 6983 transitions. [2025-04-29 11:24:16,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:16,387 INFO L278 IsEmpty]: Start isEmpty. Operand 5444 states and 6983 transitions. [2025-04-29 11:24:16,389 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-04-29 11:24:16,389 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:16,389 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:16,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:16,594 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:16,594 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:16,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:16,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1453371883, now seen corresponding path program 1 times [2025-04-29 11:24:16,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:16,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416215330] [2025-04-29 11:24:16,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:16,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:16,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-29 11:24:16,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-29 11:24:16,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:16,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:16,795 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 220 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-29 11:24:16,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:16,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416215330] [2025-04-29 11:24:16,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416215330] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:16,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803672748] [2025-04-29 11:24:16,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:16,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:16,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:16,798 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:16,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-29 11:24:16,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-29 11:24:16,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-29 11:24:16,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:16,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:16,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-29 11:24:16,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:16,906 INFO L354 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-04-29 11:24:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 220 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-29 11:24:17,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 220 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-29 11:24:17,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803672748] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:17,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:17,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-04-29 11:24:17,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732805843] [2025-04-29 11:24:17,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:17,488 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:24:17,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:17,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:24:17,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:24:17,489 INFO L87 Difference]: Start difference. First operand 5444 states and 6983 transitions. Second operand has 16 states, 15 states have (on average 12.866666666666667) internal successors, (193), 16 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:18,113 INFO L93 Difference]: Finished difference Result 16428 states and 21015 transitions. [2025-04-29 11:24:18,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 11:24:18,116 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 12.866666666666667) internal successors, (193), 16 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2025-04-29 11:24:18,116 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:18,144 INFO L225 Difference]: With dead ends: 16428 [2025-04-29 11:24:18,144 INFO L226 Difference]: Without dead ends: 16428 [2025-04-29 11:24:18,145 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=350, Invalid=910, Unknown=0, NotChecked=0, Total=1260 [2025-04-29 11:24:18,145 INFO L437 NwaCegarLoop]: 124 mSDtfsCounter, 1192 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:18,146 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 1196 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:24:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16428 states. [2025-04-29 11:24:18,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16428 to 7366. [2025-04-29 11:24:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7366 states, 7357 states have (on average 1.3047437814326492) internal successors, (9599), 7365 states have internal predecessors, (9599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:18,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7366 states to 7366 states and 9599 transitions. [2025-04-29 11:24:18,250 INFO L79 Accepts]: Start accepts. Automaton has 7366 states and 9599 transitions. Word has length 122 [2025-04-29 11:24:18,250 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:18,250 INFO L485 AbstractCegarLoop]: Abstraction has 7366 states and 9599 transitions. [2025-04-29 11:24:18,250 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 12.866666666666667) internal successors, (193), 16 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:18,250 INFO L278 IsEmpty]: Start isEmpty. Operand 7366 states and 9599 transitions. [2025-04-29 11:24:18,253 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-04-29 11:24:18,253 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:18,253 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:18,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:18,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-29 11:24:18,454 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:18,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:18,454 INFO L85 PathProgramCache]: Analyzing trace with hash -163465020, now seen corresponding path program 1 times [2025-04-29 11:24:18,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:18,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567151127] [2025-04-29 11:24:18,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:18,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:18,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-04-29 11:24:18,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-04-29 11:24:18,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:18,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:18,597 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 220 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-29 11:24:18,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:18,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567151127] [2025-04-29 11:24:18,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567151127] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:18,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101989513] [2025-04-29 11:24:18,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:18,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:18,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:18,600 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:18,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-29 11:24:18,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-04-29 11:24:18,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-04-29 11:24:18,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:18,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:18,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:24:18,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 220 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-29 11:24:18,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 58 proven. 220 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-29 11:24:18,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101989513] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:18,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:18,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-29 11:24:18,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246430962] [2025-04-29 11:24:18,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:18,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:24:18,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:18,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:24:18,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:24:18,943 INFO L87 Difference]: Start difference. First operand 7366 states and 9599 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:19,102 INFO L93 Difference]: Finished difference Result 12056 states and 15509 transitions. [2025-04-29 11:24:19,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:24:19,103 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2025-04-29 11:24:19,103 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:19,116 INFO L225 Difference]: With dead ends: 12056 [2025-04-29 11:24:19,116 INFO L226 Difference]: Without dead ends: 12056 [2025-04-29 11:24:19,116 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 252 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:24:19,117 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 531 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:19,117 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 269 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:19,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12056 states. [2025-04-29 11:24:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12056 to 7367. [2025-04-29 11:24:19,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7367 states, 7358 states have (on average 1.3047023647730362) internal successors, (9600), 7366 states have internal predecessors, (9600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7367 states to 7367 states and 9600 transitions. [2025-04-29 11:24:19,192 INFO L79 Accepts]: Start accepts. Automaton has 7367 states and 9600 transitions. Word has length 125 [2025-04-29 11:24:19,193 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:19,193 INFO L485 AbstractCegarLoop]: Abstraction has 7367 states and 9600 transitions. [2025-04-29 11:24:19,193 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:19,193 INFO L278 IsEmpty]: Start isEmpty. Operand 7367 states and 9600 transitions. [2025-04-29 11:24:19,196 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-04-29 11:24:19,196 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:19,197 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:19,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-29 11:24:19,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-29 11:24:19,401 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:19,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:19,401 INFO L85 PathProgramCache]: Analyzing trace with hash 706677679, now seen corresponding path program 1 times [2025-04-29 11:24:19,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:19,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428479619] [2025-04-29 11:24:19,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:19,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:19,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-29 11:24:19,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:24:19,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:19,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 0 proven. 279 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-29 11:24:19,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:19,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428479619] [2025-04-29 11:24:19,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428479619] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:19,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629172222] [2025-04-29 11:24:19,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:19,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:19,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:19,585 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:19,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-29 11:24:19,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-29 11:24:19,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:24:19,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:19,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:19,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:24:19,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:19,830 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:24:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 0 proven. 279 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-29 11:24:19,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:19,971 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_~x1~0.base_25 Int)) (or (not (= (select |c_#valid| v_~x1~0.base_25) 0)) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| v_~x1~0.base_25 0)))) is different from false [2025-04-29 11:24:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 110 trivial. 58 not checked. [2025-04-29 11:24:19,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629172222] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:19,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:19,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 8 [2025-04-29 11:24:19,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199643007] [2025-04-29 11:24:19,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:19,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:24:19,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:19,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:24:19,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2025-04-29 11:24:19,988 INFO L87 Difference]: Start difference. First operand 7367 states and 9600 transitions. Second operand has 9 states, 8 states have (on average 10.625) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:20,315 INFO L93 Difference]: Finished difference Result 14102 states and 18251 transitions. [2025-04-29 11:24:20,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:24:20,315 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-04-29 11:24:20,316 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:20,329 INFO L225 Difference]: With dead ends: 14102 [2025-04-29 11:24:20,329 INFO L226 Difference]: Without dead ends: 14100 [2025-04-29 11:24:20,330 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 253 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=201, Unknown=1, NotChecked=30, Total=306 [2025-04-29 11:24:20,330 INFO L437 NwaCegarLoop]: 133 mSDtfsCounter, 395 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 429 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:20,330 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 833 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 353 Invalid, 0 Unknown, 429 Unchecked, 0.2s Time] [2025-04-29 11:24:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14100 states. [2025-04-29 11:24:20,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14100 to 11046. [2025-04-29 11:24:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11046 states, 11037 states have (on average 1.3049741777656971) internal successors, (14403), 11045 states have internal predecessors, (14403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11046 states to 11046 states and 14403 transitions. [2025-04-29 11:24:20,431 INFO L79 Accepts]: Start accepts. Automaton has 11046 states and 14403 transitions. Word has length 128 [2025-04-29 11:24:20,431 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:20,431 INFO L485 AbstractCegarLoop]: Abstraction has 11046 states and 14403 transitions. [2025-04-29 11:24:20,431 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:20,431 INFO L278 IsEmpty]: Start isEmpty. Operand 11046 states and 14403 transitions. [2025-04-29 11:24:20,435 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-04-29 11:24:20,435 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:20,436 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:20,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:20,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-29 11:24:20,638 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:20,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:20,638 INFO L85 PathProgramCache]: Analyzing trace with hash 706677295, now seen corresponding path program 1 times [2025-04-29 11:24:20,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:20,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449614674] [2025-04-29 11:24:20,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:20,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:20,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-29 11:24:20,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:24:20,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:20,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 56 proven. 224 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-29 11:24:21,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:21,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449614674] [2025-04-29 11:24:21,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449614674] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:21,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534225468] [2025-04-29 11:24:21,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:21,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:21,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:21,291 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:21,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-29 11:24:21,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-29 11:24:21,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-29 11:24:21,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:21,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:21,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:24:21,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:21,625 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:24:21,627 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:24:21,710 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:24:21,711 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2025-04-29 11:24:21,722 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:24:21,722 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2025-04-29 11:24:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-04-29 11:24:21,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:21,866 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2025-04-29 11:24:21,870 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-04-29 11:24:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-04-29 11:24:22,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534225468] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:22,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:22,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2025-04-29 11:24:22,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472938761] [2025-04-29 11:24:22,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:22,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 11:24:22,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:22,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 11:24:22,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:24:22,117 INFO L87 Difference]: Start difference. First operand 11046 states and 14403 transitions. Second operand has 21 states, 21 states have (on average 6.285714285714286) internal successors, (132), 20 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:22,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:22,464 INFO L93 Difference]: Finished difference Result 20241 states and 26101 transitions. [2025-04-29 11:24:22,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:24:22,465 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.285714285714286) internal successors, (132), 20 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-04-29 11:24:22,465 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:22,480 INFO L225 Difference]: With dead ends: 20241 [2025-04-29 11:24:22,480 INFO L226 Difference]: Without dead ends: 20213 [2025-04-29 11:24:22,480 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2025-04-29 11:24:22,481 INFO L437 NwaCegarLoop]: 88 mSDtfsCounter, 421 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:22,481 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 741 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:22,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20213 states. [2025-04-29 11:24:22,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20213 to 14300. [2025-04-29 11:24:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14300 states, 14291 states have (on average 1.3084458750262402) internal successors, (18699), 14299 states have internal predecessors, (18699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14300 states to 14300 states and 18699 transitions. [2025-04-29 11:24:22,609 INFO L79 Accepts]: Start accepts. Automaton has 14300 states and 18699 transitions. Word has length 128 [2025-04-29 11:24:22,609 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:22,609 INFO L485 AbstractCegarLoop]: Abstraction has 14300 states and 18699 transitions. [2025-04-29 11:24:22,609 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.285714285714286) internal successors, (132), 20 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:22,609 INFO L278 IsEmpty]: Start isEmpty. Operand 14300 states and 18699 transitions. [2025-04-29 11:24:22,613 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-04-29 11:24:22,614 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:22,614 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 12, 8, 7, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:22,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:22,814 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:22,814 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:22,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:22,815 INFO L85 PathProgramCache]: Analyzing trace with hash 2135446093, now seen corresponding path program 1 times [2025-04-29 11:24:22,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:22,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972293859] [2025-04-29 11:24:22,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:22,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:22,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-04-29 11:24:22,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-04-29 11:24:22,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:22,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 109 proven. 363 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 11:24:23,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:23,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972293859] [2025-04-29 11:24:23,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972293859] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:23,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228783740] [2025-04-29 11:24:23,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:23,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:23,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:23,278 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:23,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-29 11:24:23,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-04-29 11:24:23,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-04-29 11:24:23,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:23,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:23,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-29 11:24:23,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:23,489 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:24:23,492 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:24:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 94 proven. 366 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-29 11:24:23,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 82 proven. 346 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-04-29 11:24:23,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228783740] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:23,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:23,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 18 [2025-04-29 11:24:23,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398316499] [2025-04-29 11:24:23,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:23,956 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-29 11:24:23,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:23,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-29 11:24:23,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:24:23,957 INFO L87 Difference]: Start difference. First operand 14300 states and 18699 transitions. Second operand has 19 states, 19 states have (on average 10.473684210526315) internal successors, (199), 18 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:28,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:28,131 INFO L93 Difference]: Finished difference Result 151811 states and 194361 transitions. [2025-04-29 11:24:28,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2025-04-29 11:24:28,131 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.473684210526315) internal successors, (199), 18 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2025-04-29 11:24:28,131 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:28,370 INFO L225 Difference]: With dead ends: 151811 [2025-04-29 11:24:28,370 INFO L226 Difference]: Without dead ends: 151811 [2025-04-29 11:24:28,376 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13018 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3224, Invalid=28282, Unknown=0, NotChecked=0, Total=31506 [2025-04-29 11:24:28,376 INFO L437 NwaCegarLoop]: 177 mSDtfsCounter, 2786 mSDsluCounter, 4440 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2786 SdHoareTripleChecker+Valid, 4617 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:28,376 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2786 Valid, 4617 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-29 11:24:28,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151811 states. [2025-04-29 11:24:29,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151811 to 66409. [2025-04-29 11:24:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66409 states, 66400 states have (on average 1.324909638554217) internal successors, (87974), 66408 states have internal predecessors, (87974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66409 states to 66409 states and 87974 transitions. [2025-04-29 11:24:29,780 INFO L79 Accepts]: Start accepts. Automaton has 66409 states and 87974 transitions. Word has length 130 [2025-04-29 11:24:29,780 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:29,780 INFO L485 AbstractCegarLoop]: Abstraction has 66409 states and 87974 transitions. [2025-04-29 11:24:29,780 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.473684210526315) internal successors, (199), 18 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:29,780 INFO L278 IsEmpty]: Start isEmpty. Operand 66409 states and 87974 transitions. [2025-04-29 11:24:29,794 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-04-29 11:24:29,794 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:29,794 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 11, 7, 7, 6, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:29,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-29 11:24:29,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:29,995 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:29,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:29,995 INFO L85 PathProgramCache]: Analyzing trace with hash 115622693, now seen corresponding path program 2 times [2025-04-29 11:24:29,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:29,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382865222] [2025-04-29 11:24:29,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:24:29,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:30,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 139 statements into 2 equivalence classes. [2025-04-29 11:24:30,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 139 of 139 statements. [2025-04-29 11:24:30,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:24:30,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 132 proven. 4 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2025-04-29 11:24:30,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:30,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382865222] [2025-04-29 11:24:30,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382865222] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:30,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019311] [2025-04-29 11:24:30,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:24:30,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:30,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:30,116 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:30,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-29 11:24:30,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 139 statements into 2 equivalence classes. [2025-04-29 11:24:30,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 139 of 139 statements. [2025-04-29 11:24:30,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:24:30,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:30,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-29 11:24:30,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 287 proven. 13 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-04-29 11:24:30,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 291 proven. 9 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-04-29 11:24:30,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019311] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:30,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:30,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2025-04-29 11:24:30,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098787998] [2025-04-29 11:24:30,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:30,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:24:30,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:30,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:24:30,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:24:30,426 INFO L87 Difference]: Start difference. First operand 66409 states and 87974 transitions. Second operand has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:30,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:30,569 INFO L93 Difference]: Finished difference Result 15480 states and 18034 transitions. [2025-04-29 11:24:30,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:24:30,569 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2025-04-29 11:24:30,569 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:30,580 INFO L225 Difference]: With dead ends: 15480 [2025-04-29 11:24:30,580 INFO L226 Difference]: Without dead ends: 15070 [2025-04-29 11:24:30,580 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 269 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:24:30,581 INFO L437 NwaCegarLoop]: 119 mSDtfsCounter, 192 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:30,581 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 813 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:30,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15070 states. [2025-04-29 11:24:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15070 to 11414. [2025-04-29 11:24:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11414 states, 11405 states have (on average 1.1811486190267426) internal successors, (13471), 11413 states have internal predecessors, (13471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:30,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11414 states to 11414 states and 13471 transitions. [2025-04-29 11:24:30,772 INFO L79 Accepts]: Start accepts. Automaton has 11414 states and 13471 transitions. Word has length 139 [2025-04-29 11:24:30,772 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:30,772 INFO L485 AbstractCegarLoop]: Abstraction has 11414 states and 13471 transitions. [2025-04-29 11:24:30,772 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:30,772 INFO L278 IsEmpty]: Start isEmpty. Operand 11414 states and 13471 transitions. [2025-04-29 11:24:30,776 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-04-29 11:24:30,776 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:30,776 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 14, 9, 9, 7, 6, 6, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:30,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-29 11:24:30,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-04-29 11:24:30,977 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:30,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:30,977 INFO L85 PathProgramCache]: Analyzing trace with hash 307783036, now seen corresponding path program 3 times [2025-04-29 11:24:30,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:30,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717706429] [2025-04-29 11:24:30,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:24:30,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:30,987 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 170 statements into 11 equivalence classes. [2025-04-29 11:24:31,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 136 of 170 statements. [2025-04-29 11:24:31,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-04-29 11:24:31,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 387 proven. 20 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2025-04-29 11:24:31,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:31,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717706429] [2025-04-29 11:24:31,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717706429] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:31,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412549193] [2025-04-29 11:24:31,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:24:31,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:31,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:31,220 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:31,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-29 11:24:31,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 170 statements into 11 equivalence classes. [2025-04-29 11:24:31,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 136 of 170 statements. [2025-04-29 11:24:31,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-04-29 11:24:31,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:31,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:24:31,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 395 proven. 3 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-04-29 11:24:31,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 395 proven. 3 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-04-29 11:24:31,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412549193] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:31,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:31,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2025-04-29 11:24:31,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327124260] [2025-04-29 11:24:31,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:31,415 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:24:31,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:31,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:24:31,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:24:31,415 INFO L87 Difference]: Start difference. First operand 11414 states and 13471 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:31,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:31,481 INFO L93 Difference]: Finished difference Result 12898 states and 14962 transitions. [2025-04-29 11:24:31,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:24:31,481 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2025-04-29 11:24:31,481 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:31,489 INFO L225 Difference]: With dead ends: 12898 [2025-04-29 11:24:31,489 INFO L226 Difference]: Without dead ends: 11628 [2025-04-29 11:24:31,489 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 342 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:24:31,490 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 124 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:31,490 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 327 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11628 states. [2025-04-29 11:24:31,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11628 to 11296. [2025-04-29 11:24:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11296 states, 11287 states have (on average 1.1638167803667936) internal successors, (13136), 11295 states have internal predecessors, (13136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11296 states to 11296 states and 13136 transitions. [2025-04-29 11:24:31,565 INFO L79 Accepts]: Start accepts. Automaton has 11296 states and 13136 transitions. Word has length 170 [2025-04-29 11:24:31,565 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:31,565 INFO L485 AbstractCegarLoop]: Abstraction has 11296 states and 13136 transitions. [2025-04-29 11:24:31,565 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:31,565 INFO L278 IsEmpty]: Start isEmpty. Operand 11296 states and 13136 transitions. [2025-04-29 11:24:31,569 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-04-29 11:24:31,569 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:31,569 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 17, 10, 10, 8, 8, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:31,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-29 11:24:31,769 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-04-29 11:24:31,769 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2025-04-29 11:24:31,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:31,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2108426156, now seen corresponding path program 1 times [2025-04-29 11:24:31,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:31,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484846980] [2025-04-29 11:24:31,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:31,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:31,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-04-29 11:24:31,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-04-29 11:24:31,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:31,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:32,813 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 124 proven. 805 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-04-29 11:24:32,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:32,815 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484846980] [2025-04-29 11:24:32,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484846980] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:32,815 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426427802] [2025-04-29 11:24:32,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:32,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:32,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:32,817 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:24:32,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-29 11:24:32,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-04-29 11:24:32,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-04-29 11:24:32,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:32,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:32,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-04-29 11:24:32,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:33,160 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:24:33,164 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:24:33,329 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:24:33,329 INFO L354 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-04-29 11:24:33,350 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:24:33,357 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:24:33,367 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:24:33,371 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:24:33,432 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:24:33,436 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:24:33,602 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:24:33,605 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-29 11:24:33,951 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 136 proven. 798 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-29 11:24:33,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:34,199 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~S~0.offset 4))) (and (= (select (select (store |c_#memory_$Pointer$#0.offset| c_~x1~0.base (store (select |c_#memory_$Pointer$#0.offset| c_~x1~0.base) (+ 4 c_~x1~0.offset) c_~S~0.offset)) c_~S~0.base) .cse0) 0) (forall ((v_ArrVal_1234 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| c_~x1~0.base v_ArrVal_1234) c_~S~0.base) .cse0) 0)))) is different from false [2025-04-29 11:24:34,236 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:24:34,236 INFO L354 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 11:24:34,710 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:24:34,710 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-04-29 11:24:34,712 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-04-29 11:24:34,718 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:24:34,718 INFO L354 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 18 treesize of output 20 [2025-04-29 11:24:34,738 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:24:34,739 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-04-29 11:24:34,741 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-04-29 11:24:34,744 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:24:35,229 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:24:35,229 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2025-04-29 11:24:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 107 proven. 704 refuted. 21 times theorem prover too weak. 40 trivial. 110 not checked. [2025-04-29 11:24:35,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426427802] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:35,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:35,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2025-04-29 11:24:35,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051766246] [2025-04-29 11:24:35,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:35,259 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 11:24:35,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:35,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 11:24:35,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=762, Unknown=18, NotChecked=56, Total=930 [2025-04-29 11:24:35,260 INFO L87 Difference]: Start difference. First operand 11296 states and 13136 transitions. Second operand has 31 states, 31 states have (on average 10.32258064516129) internal successors, (320), 30 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:47,018 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:24:54,856 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:24:58,724 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:25:05,223 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15