./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/memsafety/lockfree-3.1.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.1.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 5c9912700b89e9c69b0acf6f37b917391ba49c044e3043d8d8a5c053eadddf17 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:24:01,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:24:01,704 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:24:01,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:24:01,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:24:01,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:24:01,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:24:01,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:24:01,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:24:01,735 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:24:01,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:24:01,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:24:01,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:24:01,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:24:01,737 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:24:01,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:24:01,737 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:24:01,737 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:24:01,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:24:01,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:24:01,738 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:24:01,738 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:24:01,738 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:24:01,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:24:01,738 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:24:01,738 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:24:01,738 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:24:01,738 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:24:01,738 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:24:01,738 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:24:01,738 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:24:01,738 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:24:01,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:24:01,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:24:01,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:24:01,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:24:01,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:24:01,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:24:01,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:24:01,739 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:24:01,739 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:24:01,739 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:24:01,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:24:01,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:24:01,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:24:01,740 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:24:01,740 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 -> 5c9912700b89e9c69b0acf6f37b917391ba49c044e3043d8d8a5c053eadddf17 [2025-04-29 11:24:01,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:24:01,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:24:01,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:24:01,965 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:24:01,965 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:24:01,967 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1.c [2025-04-29 11:24:03,246 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0128e544/c78ca6680a4c4a5d8f6fe7ad0dba91b1/FLAG743e3c238 [2025-04-29 11:24:03,431 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:24:03,432 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/lockfree-3.1.c [2025-04-29 11:24:03,434 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:03,434 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:03,440 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0128e544/c78ca6680a4c4a5d8f6fe7ad0dba91b1/FLAG743e3c238 [2025-04-29 11:24:04,296 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0128e544/c78ca6680a4c4a5d8f6fe7ad0dba91b1 [2025-04-29 11:24:04,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:24:04,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:24:04,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:24:04,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:24:04,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:24:04,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:24:04" (1/1) ... [2025-04-29 11:24:04,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44cc456c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:04, skipping insertion in model container [2025-04-29 11:24:04,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:24:04" (1/1) ... [2025-04-29 11:24:04,313 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:24:04,474 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:24:04,482 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:24:04,514 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:24:04,528 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:24:04,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:04 WrapperNode [2025-04-29 11:24:04,530 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:24:04,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:24:04,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:24:04,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:24:04,536 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:04" (1/1) ... [2025-04-29 11:24:04,548 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:04" (1/1) ... [2025-04-29 11:24:04,565 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 126 [2025-04-29 11:24:04,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:24:04,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:24:04,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:24:04,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:24:04,573 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:04" (1/1) ... [2025-04-29 11:24:04,573 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:04" (1/1) ... [2025-04-29 11:24:04,575 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:04" (1/1) ... [2025-04-29 11:24:04,591 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:04,594 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:04" (1/1) ... [2025-04-29 11:24:04,594 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:04" (1/1) ... [2025-04-29 11:24:04,598 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:04" (1/1) ... [2025-04-29 11:24:04,602 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:04" (1/1) ... [2025-04-29 11:24:04,604 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:04" (1/1) ... [2025-04-29 11:24:04,608 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:04" (1/1) ... [2025-04-29 11:24:04,609 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:04" (1/1) ... [2025-04-29 11:24:04,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:24:04,612 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:24:04,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:24:04,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:24:04,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:04" (1/1) ... [2025-04-29 11:24:04,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:24:04,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:04,643 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:04,649 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:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:24:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:24:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:24:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:24:04,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:24:04,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:24:04,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:24:04,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:24:04,729 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:24:04,730 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:24:04,958 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-04-29 11:24:04,958 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:24:04,966 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:24:04,967 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:24:04,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:24:04 BoogieIcfgContainer [2025-04-29 11:24:04,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:24:04,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:24:04,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:24:04,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:24:04,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:24:04" (1/3) ... [2025-04-29 11:24:04,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cc41b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:24:04, skipping insertion in model container [2025-04-29 11:24:04,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:04" (2/3) ... [2025-04-29 11:24:04,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cc41b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:24:04, skipping insertion in model container [2025-04-29 11:24:04,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:24:04" (3/3) ... [2025-04-29 11:24:04,974 INFO L128 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.c [2025-04-29 11:24:04,985 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:24:04,987 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lockfree-3.1.c that has 1 procedures, 64 locations, 82 edges, 1 initial locations, 2 loop locations, and 20 error locations. [2025-04-29 11:24:05,021 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:24:05,031 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;@46fe04f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:24:05,032 INFO L341 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-04-29 11:24:05,035 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:05,038 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:24:05,038 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:05,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:24:05,039 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:05,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:05,044 INFO L85 PathProgramCache]: Analyzing trace with hash 28820323, now seen corresponding path program 1 times [2025-04-29 11:24:05,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:05,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205393949] [2025-04-29 11:24:05,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:05,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:05,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:24:05,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:24:05,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:05,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:05,142 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:05,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:05,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205393949] [2025-04-29 11:24:05,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205393949] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:05,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:05,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:05,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105487552] [2025-04-29 11:24:05,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:05,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 11:24:05,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:05,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 11:24:05,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:24:05,169 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:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:05,185 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2025-04-29 11:24:05,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 11:24:05,186 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:05,188 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:05,193 INFO L225 Difference]: With dead ends: 64 [2025-04-29 11:24:05,193 INFO L226 Difference]: Without dead ends: 62 [2025-04-29 11:24:05,194 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:05,197 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:05,198 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:05,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-04-29 11:24:05,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-04-29 11:24:05,221 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:05,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2025-04-29 11:24:05,228 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2025-04-29 11:24:05,228 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:05,228 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-04-29 11:24:05,228 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:05,229 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2025-04-29 11:24:05,229 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:24:05,229 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:05,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:05,230 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:24:05,230 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:05,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:05,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1805898957, now seen corresponding path program 1 times [2025-04-29 11:24:05,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:05,231 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397543220] [2025-04-29 11:24:05,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:05,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:05,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:24:05,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:24:05,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:05,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:05,338 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:05,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:05,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397543220] [2025-04-29 11:24:05,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397543220] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:05,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:05,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:24:05,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094782868] [2025-04-29 11:24:05,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:05,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:24:05,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:05,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:24:05,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:24:05,341 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:05,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:05,392 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2025-04-29 11:24:05,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:24:05,393 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:05,394 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:05,394 INFO L225 Difference]: With dead ends: 80 [2025-04-29 11:24:05,394 INFO L226 Difference]: Without dead ends: 80 [2025-04-29 11:24:05,394 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:05,395 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 18 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:05,395 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 215 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-04-29 11:24:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 64. [2025-04-29 11:24:05,399 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:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2025-04-29 11:24:05,400 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 7 [2025-04-29 11:24:05,400 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:05,400 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2025-04-29 11:24:05,400 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:05,400 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2025-04-29 11:24:05,400 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:24:05,400 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:05,400 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:05,400 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:24:05,401 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:05,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:05,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1805958539, now seen corresponding path program 1 times [2025-04-29 11:24:05,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:05,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607359322] [2025-04-29 11:24:05,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:05,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:05,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:24:05,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:24:05,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:05,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:05,442 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:05,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:05,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607359322] [2025-04-29 11:24:05,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607359322] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:05,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:05,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:05,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828510722] [2025-04-29 11:24:05,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:05,442 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:05,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:05,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:05,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:05,443 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:05,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:05,517 INFO L93 Difference]: Finished difference Result 117 states and 151 transitions. [2025-04-29 11:24:05,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:05,517 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:05,519 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:05,519 INFO L225 Difference]: With dead ends: 117 [2025-04-29 11:24:05,519 INFO L226 Difference]: Without dead ends: 116 [2025-04-29 11:24:05,520 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:05,520 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.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:05,520 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.1s Time] [2025-04-29 11:24:05,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-29 11:24:05,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2025-04-29 11:24:05,526 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:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2025-04-29 11:24:05,528 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 7 [2025-04-29 11:24:05,528 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:05,528 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2025-04-29 11:24:05,528 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:05,528 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2025-04-29 11:24:05,528 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:24:05,528 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:05,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:05,529 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:24:05,529 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:05,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:05,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1805958155, now seen corresponding path program 1 times [2025-04-29 11:24:05,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:05,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150808474] [2025-04-29 11:24:05,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:05,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:05,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:24:05,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:24:05,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:05,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:05,574 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:05,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:05,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150808474] [2025-04-29 11:24:05,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150808474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:05,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:05,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:05,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593809603] [2025-04-29 11:24:05,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:05,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:05,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:05,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:05,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:05,577 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:05,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:05,621 INFO L93 Difference]: Finished difference Result 176 states and 263 transitions. [2025-04-29 11:24:05,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:05,622 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:05,622 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:05,623 INFO L225 Difference]: With dead ends: 176 [2025-04-29 11:24:05,623 INFO L226 Difference]: Without dead ends: 175 [2025-04-29 11:24:05,623 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:05,624 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:05,624 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:05,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-04-29 11:24:05,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 153. [2025-04-29 11:24:05,635 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:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 246 transitions. [2025-04-29 11:24:05,637 INFO L79 Accepts]: Start accepts. Automaton has 153 states and 246 transitions. Word has length 7 [2025-04-29 11:24:05,637 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:05,637 INFO L485 AbstractCegarLoop]: Abstraction has 153 states and 246 transitions. [2025-04-29 11:24:05,637 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:05,637 INFO L278 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2025-04-29 11:24:05,638 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:24:05,638 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:05,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:05,638 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:24:05,638 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:05,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:05,639 INFO L85 PathProgramCache]: Analyzing trace with hash 353556108, now seen corresponding path program 1 times [2025-04-29 11:24:05,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:05,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964821355] [2025-04-29 11:24:05,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:05,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:05,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:24:05,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:24:05,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:05,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:05,709 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:05,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:05,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964821355] [2025-04-29 11:24:05,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964821355] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:05,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:05,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:05,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54271064] [2025-04-29 11:24:05,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:05,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:05,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:05,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:05,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:05,710 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:05,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:05,786 INFO L93 Difference]: Finished difference Result 229 states and 354 transitions. [2025-04-29 11:24:05,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:05,787 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:05,787 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:05,788 INFO L225 Difference]: With dead ends: 229 [2025-04-29 11:24:05,788 INFO L226 Difference]: Without dead ends: 229 [2025-04-29 11:24:05,789 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:05,789 INFO L437 NwaCegarLoop]: 122 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 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:05,790 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 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:05,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-04-29 11:24:05,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 209. [2025-04-29 11:24:05,803 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:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 341 transitions. [2025-04-29 11:24:05,808 INFO L79 Accepts]: Start accepts. Automaton has 209 states and 341 transitions. Word has length 9 [2025-04-29 11:24:05,809 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:05,809 INFO L485 AbstractCegarLoop]: Abstraction has 209 states and 341 transitions. [2025-04-29 11:24:05,809 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:05,809 INFO L278 IsEmpty]: Start isEmpty. Operand 209 states and 341 transitions. [2025-04-29 11:24:05,809 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:24:05,809 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:05,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:05,809 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:24:05,810 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:05,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:05,810 INFO L85 PathProgramCache]: Analyzing trace with hash 353556109, now seen corresponding path program 1 times [2025-04-29 11:24:05,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:05,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903178246] [2025-04-29 11:24:05,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:05,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:05,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:24:05,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:24:05,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:05,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:05,894 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:05,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:05,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903178246] [2025-04-29 11:24:05,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903178246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:05,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:05,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:05,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136212880] [2025-04-29 11:24:05,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:05,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:05,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:05,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:05,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:05,896 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:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:05,940 INFO L93 Difference]: Finished difference Result 224 states and 345 transitions. [2025-04-29 11:24:05,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:05,941 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:05,941 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:05,942 INFO L225 Difference]: With dead ends: 224 [2025-04-29 11:24:05,942 INFO L226 Difference]: Without dead ends: 224 [2025-04-29 11:24:05,943 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:05,943 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:05,944 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 180 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:05,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-04-29 11:24:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 207. [2025-04-29 11:24:05,958 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:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 333 transitions. [2025-04-29 11:24:05,959 INFO L79 Accepts]: Start accepts. Automaton has 207 states and 333 transitions. Word has length 9 [2025-04-29 11:24:05,959 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:05,959 INFO L485 AbstractCegarLoop]: Abstraction has 207 states and 333 transitions. [2025-04-29 11:24:05,959 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:05,959 INFO L278 IsEmpty]: Start isEmpty. Operand 207 states and 333 transitions. [2025-04-29 11:24:05,959 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:24:05,959 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:05,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:05,959 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:24:05,960 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:05,960 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:05,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1924654535, now seen corresponding path program 1 times [2025-04-29 11:24:05,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:05,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801033953] [2025-04-29 11:24:05,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:05,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:05,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:24:05,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:24:05,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:05,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:05,999 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:05,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:05,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801033953] [2025-04-29 11:24:05,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801033953] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:05,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:05,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:24:05,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720467389] [2025-04-29 11:24:05,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:06,000 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:24:06,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:06,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:24:06,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:24:06,000 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:06,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:06,048 INFO L93 Difference]: Finished difference Result 384 states and 592 transitions. [2025-04-29 11:24:06,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:24:06,049 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:06,049 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:06,051 INFO L225 Difference]: With dead ends: 384 [2025-04-29 11:24:06,051 INFO L226 Difference]: Without dead ends: 384 [2025-04-29 11:24:06,051 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:06,052 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:06,052 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:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-04-29 11:24:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 357. [2025-04-29 11:24:06,064 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:06,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 571 transitions. [2025-04-29 11:24:06,066 INFO L79 Accepts]: Start accepts. Automaton has 357 states and 571 transitions. Word has length 10 [2025-04-29 11:24:06,066 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:06,066 INFO L485 AbstractCegarLoop]: Abstraction has 357 states and 571 transitions. [2025-04-29 11:24:06,066 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:06,066 INFO L278 IsEmpty]: Start isEmpty. Operand 357 states and 571 transitions. [2025-04-29 11:24:06,067 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:24:06,067 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:06,067 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:06,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:24:06,067 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:06,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:06,068 INFO L85 PathProgramCache]: Analyzing trace with hash 516607341, now seen corresponding path program 1 times [2025-04-29 11:24:06,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:06,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646585270] [2025-04-29 11:24:06,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:06,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:06,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:24:06,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:24:06,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:06,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:06,117 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:06,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:06,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646585270] [2025-04-29 11:24:06,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646585270] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:06,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:06,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:24:06,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588776055] [2025-04-29 11:24:06,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:06,117 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:24:06,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:06,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:24:06,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:24:06,118 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:06,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:06,160 INFO L93 Difference]: Finished difference Result 632 states and 946 transitions. [2025-04-29 11:24:06,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:24:06,162 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:06,162 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:06,164 INFO L225 Difference]: With dead ends: 632 [2025-04-29 11:24:06,165 INFO L226 Difference]: Without dead ends: 632 [2025-04-29 11:24:06,165 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:06,165 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:06,165 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:06,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-04-29 11:24:06,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 601. [2025-04-29 11:24:06,180 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:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 919 transitions. [2025-04-29 11:24:06,184 INFO L79 Accepts]: Start accepts. Automaton has 601 states and 919 transitions. Word has length 11 [2025-04-29 11:24:06,184 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:06,184 INFO L485 AbstractCegarLoop]: Abstraction has 601 states and 919 transitions. [2025-04-29 11:24:06,184 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:06,184 INFO L278 IsEmpty]: Start isEmpty. Operand 601 states and 919 transitions. [2025-04-29 11:24:06,184 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:24:06,184 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:06,184 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:06,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:24:06,185 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:06,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:06,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1842867688, now seen corresponding path program 1 times [2025-04-29 11:24:06,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:06,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117591365] [2025-04-29 11:24:06,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:06,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:06,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:24:06,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:24:06,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:06,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:06,237 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:06,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:06,237 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117591365] [2025-04-29 11:24:06,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117591365] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:06,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:06,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:24:06,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296220934] [2025-04-29 11:24:06,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:06,238 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:06,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:06,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:06,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:06,239 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:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:06,250 INFO L93 Difference]: Finished difference Result 625 states and 943 transitions. [2025-04-29 11:24:06,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:06,250 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:06,250 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:06,252 INFO L225 Difference]: With dead ends: 625 [2025-04-29 11:24:06,252 INFO L226 Difference]: Without dead ends: 625 [2025-04-29 11:24:06,253 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:06,253 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:06,253 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:06,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-04-29 11:24:06,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 617. [2025-04-29 11:24:06,261 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:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 935 transitions. [2025-04-29 11:24:06,263 INFO L79 Accepts]: Start accepts. Automaton has 617 states and 935 transitions. Word has length 16 [2025-04-29 11:24:06,263 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:06,263 INFO L485 AbstractCegarLoop]: Abstraction has 617 states and 935 transitions. [2025-04-29 11:24:06,264 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:06,264 INFO L278 IsEmpty]: Start isEmpty. Operand 617 states and 935 transitions. [2025-04-29 11:24:06,264 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:24:06,264 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:06,264 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:06,264 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:24:06,264 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:06,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:06,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1842808106, now seen corresponding path program 1 times [2025-04-29 11:24:06,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:06,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723291339] [2025-04-29 11:24:06,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:06,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:06,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:24:06,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:24:06,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:06,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:06,332 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:06,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:06,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723291339] [2025-04-29 11:24:06,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723291339] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:06,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:06,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:24:06,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802513144] [2025-04-29 11:24:06,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:06,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:24:06,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:06,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:24:06,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:24:06,333 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:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:06,375 INFO L93 Difference]: Finished difference Result 941 states and 1441 transitions. [2025-04-29 11:24:06,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:24:06,376 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:06,376 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:06,379 INFO L225 Difference]: With dead ends: 941 [2025-04-29 11:24:06,379 INFO L226 Difference]: Without dead ends: 941 [2025-04-29 11:24:06,379 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:06,380 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:06,380 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:06,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-04-29 11:24:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 923. [2025-04-29 11:24:06,393 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:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1433 transitions. [2025-04-29 11:24:06,396 INFO L79 Accepts]: Start accepts. Automaton has 923 states and 1433 transitions. Word has length 16 [2025-04-29 11:24:06,396 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:06,396 INFO L485 AbstractCegarLoop]: Abstraction has 923 states and 1433 transitions. [2025-04-29 11:24:06,396 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:06,396 INFO L278 IsEmpty]: Start isEmpty. Operand 923 states and 1433 transitions. [2025-04-29 11:24:06,397 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:24:06,397 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:06,397 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:06,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:24:06,397 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:06,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:06,397 INFO L85 PathProgramCache]: Analyzing trace with hash 933583904, now seen corresponding path program 1 times [2025-04-29 11:24:06,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:06,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557084185] [2025-04-29 11:24:06,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:06,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:06,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:24:06,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:24:06,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:06,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:06,459 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:06,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:06,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557084185] [2025-04-29 11:24:06,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557084185] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:06,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028971457] [2025-04-29 11:24:06,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:06,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:06,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:06,462 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:06,463 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:06,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:24:06,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:24:06,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:06,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:06,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:24:06,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:06,552 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:06,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:06,606 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:06,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028971457] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:06,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:06,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2025-04-29 11:24:06,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968312727] [2025-04-29 11:24:06,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:06,607 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:24:06,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:06,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:24:06,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:24:06,608 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:06,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:06,702 INFO L93 Difference]: Finished difference Result 1435 states and 2143 transitions. [2025-04-29 11:24:06,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:24:06,702 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:06,703 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:06,720 INFO L225 Difference]: With dead ends: 1435 [2025-04-29 11:24:06,720 INFO L226 Difference]: Without dead ends: 1435 [2025-04-29 11:24:06,721 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:06,721 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 226 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:06,722 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 287 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:06,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2025-04-29 11:24:06,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1325. [2025-04-29 11:24:06,738 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:06,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 2023 transitions. [2025-04-29 11:24:06,742 INFO L79 Accepts]: Start accepts. Automaton has 1325 states and 2023 transitions. Word has length 18 [2025-04-29 11:24:06,742 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:06,742 INFO L485 AbstractCegarLoop]: Abstraction has 1325 states and 2023 transitions. [2025-04-29 11:24:06,742 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:06,742 INFO L278 IsEmpty]: Start isEmpty. Operand 1325 states and 2023 transitions. [2025-04-29 11:24:06,743 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:24:06,743 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:06,743 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:06,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:24:06,948 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:06,948 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:06,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:06,948 INFO L85 PathProgramCache]: Analyzing trace with hash -644832843, now seen corresponding path program 1 times [2025-04-29 11:24:06,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:06,948 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718468127] [2025-04-29 11:24:06,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:06,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:06,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:24:06,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:24:06,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:06,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:06,984 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:06,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:06,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718468127] [2025-04-29 11:24:06,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718468127] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:06,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:06,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:24:06,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457141563] [2025-04-29 11:24:06,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:06,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:24:06,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:06,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:24:06,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:24:06,989 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:07,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:07,010 INFO L93 Difference]: Finished difference Result 382 states and 535 transitions. [2025-04-29 11:24:07,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:24:07,011 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:07,011 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:07,012 INFO L225 Difference]: With dead ends: 382 [2025-04-29 11:24:07,012 INFO L226 Difference]: Without dead ends: 382 [2025-04-29 11:24:07,012 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:07,012 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:07,013 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:07,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-04-29 11:24:07,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 370. [2025-04-29 11:24:07,017 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:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 529 transitions. [2025-04-29 11:24:07,018 INFO L79 Accepts]: Start accepts. Automaton has 370 states and 529 transitions. Word has length 23 [2025-04-29 11:24:07,018 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:07,018 INFO L485 AbstractCegarLoop]: Abstraction has 370 states and 529 transitions. [2025-04-29 11:24:07,018 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:07,018 INFO L278 IsEmpty]: Start isEmpty. Operand 370 states and 529 transitions. [2025-04-29 11:24:07,018 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:24:07,018 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:07,019 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:07,019 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:24:07,019 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:07,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:07,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1395065772, now seen corresponding path program 1 times [2025-04-29 11:24:07,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:07,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268291038] [2025-04-29 11:24:07,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:07,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:07,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:24:07,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:24:07,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:07,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:07,098 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:07,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:07,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268291038] [2025-04-29 11:24:07,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268291038] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:07,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756172574] [2025-04-29 11:24:07,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:07,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:07,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:07,101 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:07,102 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:07,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:24:07,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:24:07,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:07,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:07,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 11:24:07,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:07,208 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:07,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:07,263 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:07,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756172574] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:07,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:07,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-29 11:24:07,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268153406] [2025-04-29 11:24:07,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:07,264 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:24:07,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:07,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:24:07,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:24:07,265 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:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:07,328 INFO L93 Difference]: Finished difference Result 1098 states and 1559 transitions. [2025-04-29 11:24:07,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:24:07,331 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:07,331 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:07,334 INFO L225 Difference]: With dead ends: 1098 [2025-04-29 11:24:07,334 INFO L226 Difference]: Without dead ends: 1098 [2025-04-29 11:24:07,334 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:07,336 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 173 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:07,337 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 159 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:07,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2025-04-29 11:24:07,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1060. [2025-04-29 11:24:07,350 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:07,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1531 transitions. [2025-04-29 11:24:07,353 INFO L79 Accepts]: Start accepts. Automaton has 1060 states and 1531 transitions. Word has length 27 [2025-04-29 11:24:07,353 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:07,353 INFO L485 AbstractCegarLoop]: Abstraction has 1060 states and 1531 transitions. [2025-04-29 11:24:07,353 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:07,354 INFO L278 IsEmpty]: Start isEmpty. Operand 1060 states and 1531 transitions. [2025-04-29 11:24:07,354 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:24:07,354 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:07,354 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:07,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:07,555 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:07,555 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:07,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:07,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1359367982, now seen corresponding path program 1 times [2025-04-29 11:24:07,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:07,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363472174] [2025-04-29 11:24:07,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:07,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:07,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:24:07,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:24:07,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:07,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:07,625 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:07,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:07,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363472174] [2025-04-29 11:24:07,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363472174] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:07,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780800248] [2025-04-29 11:24:07,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:07,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:07,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:07,627 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:07,628 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:07,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:24:07,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:24:07,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:07,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:07,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:24:07,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:07,718 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:07,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:07,758 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:07,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780800248] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:07,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:07,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-04-29 11:24:07,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848258957] [2025-04-29 11:24:07,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:07,760 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:24:07,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:07,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:24:07,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:24:07,760 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:07,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:07,903 INFO L93 Difference]: Finished difference Result 2542 states and 3529 transitions. [2025-04-29 11:24:07,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:24:07,904 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:07,904 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:07,911 INFO L225 Difference]: With dead ends: 2542 [2025-04-29 11:24:07,911 INFO L226 Difference]: Without dead ends: 2542 [2025-04-29 11:24:07,911 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:07,912 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 333 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:07,912 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 436 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:07,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2025-04-29 11:24:07,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2284. [2025-04-29 11:24:07,950 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:07,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3277 transitions. [2025-04-29 11:24:07,956 INFO L79 Accepts]: Start accepts. Automaton has 2284 states and 3277 transitions. Word has length 28 [2025-04-29 11:24:07,956 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:07,956 INFO L485 AbstractCegarLoop]: Abstraction has 2284 states and 3277 transitions. [2025-04-29 11:24:07,956 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:07,956 INFO L278 IsEmpty]: Start isEmpty. Operand 2284 states and 3277 transitions. [2025-04-29 11:24:07,957 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:24:07,957 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:07,957 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:07,963 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:08,161 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:08,161 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:08,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:08,161 INFO L85 PathProgramCache]: Analyzing trace with hash 716480828, now seen corresponding path program 1 times [2025-04-29 11:24:08,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:08,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502302860] [2025-04-29 11:24:08,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:08,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:08,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:24:08,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:24:08,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:08,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:08,236 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:08,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:08,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502302860] [2025-04-29 11:24:08,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502302860] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:08,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841907675] [2025-04-29 11:24:08,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:08,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:08,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:08,238 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:08,239 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:08,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:24:08,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:24:08,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:08,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:08,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-29 11:24:08,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:08,310 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:08,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:08,328 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:08,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841907675] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:08,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:08,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2025-04-29 11:24:08,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716297071] [2025-04-29 11:24:08,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:08,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:24:08,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:08,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:24:08,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:24:08,329 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:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:08,396 INFO L93 Difference]: Finished difference Result 1107 states and 1543 transitions. [2025-04-29 11:24:08,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:24:08,397 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:08,397 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:08,400 INFO L225 Difference]: With dead ends: 1107 [2025-04-29 11:24:08,400 INFO L226 Difference]: Without dead ends: 1107 [2025-04-29 11:24:08,401 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:08,401 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:08,402 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:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-04-29 11:24:08,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 877. [2025-04-29 11:24:08,413 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:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1249 transitions. [2025-04-29 11:24:08,415 INFO L79 Accepts]: Start accepts. Automaton has 877 states and 1249 transitions. Word has length 30 [2025-04-29 11:24:08,415 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:08,415 INFO L485 AbstractCegarLoop]: Abstraction has 877 states and 1249 transitions. [2025-04-29 11:24:08,415 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:08,415 INFO L278 IsEmpty]: Start isEmpty. Operand 877 states and 1249 transitions. [2025-04-29 11:24:08,417 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-29 11:24:08,417 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:08,417 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:08,423 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:08,618 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:08,618 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:08,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:08,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1293143655, now seen corresponding path program 1 times [2025-04-29 11:24:08,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:08,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894699571] [2025-04-29 11:24:08,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:08,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:08,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:24:08,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:24:08,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:08,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:08,772 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:08,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:08,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894699571] [2025-04-29 11:24:08,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894699571] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:08,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226605670] [2025-04-29 11:24:08,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:08,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:08,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:08,774 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:08,775 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:08,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:24:08,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:24:08,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:08,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:08,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:24:08,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:08,912 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:08,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:08,982 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:08,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226605670] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:08,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:08,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 12 [2025-04-29 11:24:08,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276280668] [2025-04-29 11:24:08,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:08,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:24:08,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:08,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:24:08,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:24:08,984 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:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:09,167 INFO L93 Difference]: Finished difference Result 2056 states and 2854 transitions. [2025-04-29 11:24:09,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:24:09,168 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:09,169 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:09,174 INFO L225 Difference]: With dead ends: 2056 [2025-04-29 11:24:09,174 INFO L226 Difference]: Without dead ends: 2056 [2025-04-29 11:24:09,175 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 102 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2025-04-29 11:24:09,176 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 345 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:09,176 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 573 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2025-04-29 11:24:09,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 985. [2025-04-29 11:24:09,193 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:09,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1419 transitions. [2025-04-29 11:24:09,195 INFO L79 Accepts]: Start accepts. Automaton has 985 states and 1419 transitions. Word has length 55 [2025-04-29 11:24:09,196 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:09,196 INFO L485 AbstractCegarLoop]: Abstraction has 985 states and 1419 transitions. [2025-04-29 11:24:09,196 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:09,196 INFO L278 IsEmpty]: Start isEmpty. Operand 985 states and 1419 transitions. [2025-04-29 11:24:09,196 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-04-29 11:24:09,196 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:09,197 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:09,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:24:09,397 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:09,397 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:09,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:09,408 INFO L85 PathProgramCache]: Analyzing trace with hash 270158360, now seen corresponding path program 1 times [2025-04-29 11:24:09,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:09,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333051368] [2025-04-29 11:24:09,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:09,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:09,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:24:09,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:24:09,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:09,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:09,513 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:09,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:24:09,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333051368] [2025-04-29 11:24:09,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333051368] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:09,513 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853358313] [2025-04-29 11:24:09,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:09,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:09,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:09,515 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:09,517 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:09,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-29 11:24:09,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-29 11:24:09,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:09,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:09,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 11:24:09,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:09,675 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:09,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:09,734 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:09,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853358313] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:09,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:24:09,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2025-04-29 11:24:09,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422576675] [2025-04-29 11:24:09,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:09,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:24:09,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:24:09,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:24:09,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:24:09,736 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:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:10,060 INFO L93 Difference]: Finished difference Result 2445 states and 3245 transitions. [2025-04-29 11:24:10,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-29 11:24:10,060 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:10,061 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:10,067 INFO L225 Difference]: With dead ends: 2445 [2025-04-29 11:24:10,067 INFO L226 Difference]: Without dead ends: 2445 [2025-04-29 11:24:10,067 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:10,067 INFO L437 NwaCegarLoop]: 243 mSDtfsCounter, 340 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:10,068 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 2169 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:10,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2025-04-29 11:24:10,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 1818. [2025-04-29 11:24:10,090 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:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2517 transitions. [2025-04-29 11:24:10,093 INFO L79 Accepts]: Start accepts. Automaton has 1818 states and 2517 transitions. Word has length 59 [2025-04-29 11:24:10,093 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:10,093 INFO L485 AbstractCegarLoop]: Abstraction has 1818 states and 2517 transitions. [2025-04-29 11:24:10,093 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:10,093 INFO L278 IsEmpty]: Start isEmpty. Operand 1818 states and 2517 transitions. [2025-04-29 11:24:10,094 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-29 11:24:10,094 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:10,094 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:10,100 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:10,295 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:10,295 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:10,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:10,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1825876446, now seen corresponding path program 1 times [2025-04-29 11:24:10,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:24:10,297 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287533988] [2025-04-29 11:24:10,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:10,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:24:10,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-29 11:24:10,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-29 11:24:10,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:10,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:24:10,319 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:24:10,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-29 11:24:10,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-29 11:24:10,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:10,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:24:10,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:24:10,353 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:24:10,353 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2025-04-29 11:24:10,354 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2025-04-29 11:24:10,355 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2025-04-29 11:24:10,355 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2025-04-29 11:24:10,355 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2025-04-29 11:24:10,355 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2025-04-29 11:24:10,355 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2025-04-29 11:24:10,355 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2025-04-29 11:24:10,355 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2025-04-29 11:24:10,355 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2025-04-29 11:24:10,355 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2025-04-29 11:24:10,355 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2025-04-29 11:24:10,355 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2025-04-29 11:24:10,355 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2025-04-29 11:24:10,355 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2025-04-29 11:24:10,355 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2025-04-29 11:24:10,355 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2025-04-29 11:24:10,355 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2025-04-29 11:24:10,355 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2025-04-29 11:24:10,355 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2025-04-29 11:24:10,355 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:24:10,357 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:10,435 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:24:10,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:24:10 BoogieIcfgContainer [2025-04-29 11:24:10,437 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:24:10,438 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:24:10,438 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:24:10,438 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:24:10,440 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:24:04" (3/4) ... [2025-04-29 11:24:10,442 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-29 11:24:10,442 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:24:10,443 INFO L158 Benchmark]: Toolchain (without parser) took 6143.70ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.6MB in the beginning and 100.4MB in the end (delta: 11.2MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2025-04-29 11:24:10,443 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:24:10,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.26ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 96.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:24:10,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.91ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:24:10,444 INFO L158 Benchmark]: Boogie Preprocessor took 44.74ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 93.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:24:10,444 INFO L158 Benchmark]: RCFGBuilder took 355.63ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 74.8MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:24:10,445 INFO L158 Benchmark]: TraceAbstraction took 5467.81ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 74.4MB in the beginning and 100.4MB in the end (delta: -26.1MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2025-04-29 11:24:10,445 INFO L158 Benchmark]: Witness Printer took 4.82ms. Allocated memory is still 176.2MB. Free memory was 100.4MB in the beginning and 100.4MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:24:10,446 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.26ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 96.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.91ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.74ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 93.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 355.63ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 74.8MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5467.81ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 74.4MB in the beginning and 100.4MB in the end (delta: -26.1MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Witness Printer took 4.82ms. Allocated memory is still 176.2MB. Free memory was 100.4MB in the beginning and 100.4MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 95]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 95. Possible FailurePath: [L14] struct cell *S; [L16] int pc1 = 1; [L17] int pc4 = 1; [L19] static struct cell *t1 = NULL; [L20] static struct cell *x1 = NULL; [L56] struct cell* garbage; [L58] static struct cell *t4 = NULL; [L59] static struct cell *x4 = NULL; [L63] static int res4; VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L97] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L97] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L97] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L98] COND TRUE __VERIFIER_nondet_int() [L99] CALL push() [L24] pc1++ [L25] case 1: VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L25] case 1: [L26] x1 = malloc(sizeof(*x1)) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L27] x1->data = 0 VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L28] x1->next = NULL VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L99] RET push() [L97] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L97] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L98] COND TRUE __VERIFIER_nondet_int() [L99] CALL push() [L24] pc1++ [L25] case 1: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L25] case 1: [L31] case 2: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L31] case 2: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L32] x1->data = 4 VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L99] RET push() [L97] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L97] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L98] COND TRUE __VERIFIER_nondet_int() [L99] CALL push() [L24] pc1++ [L25] case 1: VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L25] case 1: [L31] case 2: VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L31] case 2: [L35] case 3: [L36] t1 = S VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L99] RET push() [L97] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L97] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L98] COND TRUE __VERIFIER_nondet_int() [L99] CALL push() [L24] pc1++ [L25] case 1: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L25] case 1: [L31] case 2: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L31] case 2: [L35] case 3: [L39] case 4: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L39] case 4: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L40] x1->next = t1 VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L99] RET push() [L97] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L97] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L98] COND TRUE __VERIFIER_nondet_int() [L99] CALL push() [L24] pc1++ [L25] case 1: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L25] case 1: [L31] case 2: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L31] case 2: [L35] case 3: [L39] case 4: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L39] case 4: [L43] case 5: [L45] S = x1 VAL [S={-1:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L99] RET push() [L97] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={-1:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L97] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L98] COND TRUE __VERIFIER_nondet_int() [L99] CALL push() [L24] pc1++ [L25] case 1: VAL [S={-1:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L25] case 1: [L31] case 2: VAL [S={-1:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L31] case 2: [L35] case 3: [L39] case 4: VAL [S={-1:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L39] case 4: [L43] case 5: [L50] case 6: [L51] pc1 = 1 VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L99] RET push() [L97] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L97] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={-1:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={-1:0}, x4={0:0}] [L97] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L104] COND FALSE !(\read(*garbage)) [L110] S = NULL [L111] t1 = NULL [L112] x1 = NULL [L113] t4 = NULL [L114] x4 = NULL [L116] return !!garbage; VAL [S={0:0}, \result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 82 edges, 20 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2016 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2016 mSDsluCounter, 6137 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4570 mSDsCounter, 170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 968 IncrementalHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 170 mSolverCounterUnsat, 1567 mSDtfsCounter, 968 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 559 GetRequests, 431 SyntacticMatches, 5 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2284occurred in iteration=14, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 2525 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 623 NumberOfCodeBlocks, 623 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 742 ConstructedInterpolants, 0 QuantifiedInterpolants, 1850 SizeOfPredicates, 21 NumberOfNonLiveVariables, 898 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 487/775 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-29 11:24:10,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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.1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 5c9912700b89e9c69b0acf6f37b917391ba49c044e3043d8d8a5c053eadddf17 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:24:12,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:24:12,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-04-29 11:24:12,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:24:12,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:24:12,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:24:12,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:24:12,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:24:12,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:24:12,406 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:24:12,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:24:12,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:24:12,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:24:12,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:24:12,408 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:24:12,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:24:12,408 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:24:12,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:24:12,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:24:12,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:24:12,409 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:24:12,409 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:24:12,409 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:24:12,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:24:12,409 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:24:12,409 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-29 11:24:12,409 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-29 11:24:12,409 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:24:12,409 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:24:12,409 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:24:12,410 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:24:12,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:24:12,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:24:12,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:24:12,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:24:12,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:24:12,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:24:12,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:24:12,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:24:12,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:24:12,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:24:12,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:24:12,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:24:12,411 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-29 11:24:12,411 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-29 11:24:12,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:24:12,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:24:12,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:24:12,411 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 -> 5c9912700b89e9c69b0acf6f37b917391ba49c044e3043d8d8a5c053eadddf17 [2025-04-29 11:24:12,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:24:12,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:24:12,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:24:12,641 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:24:12,641 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:24:12,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1.c [2025-04-29 11:24:13,949 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2864a4a00/9ad82bd269f04cc8b516d611e31f8938/FLAGf4f812fde [2025-04-29 11:24:14,113 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:24:14,113 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/lockfree-3.1.c [2025-04-29 11:24:14,114 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:14,114 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:14,119 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2864a4a00/9ad82bd269f04cc8b516d611e31f8938/FLAGf4f812fde [2025-04-29 11:24:14,949 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2864a4a00/9ad82bd269f04cc8b516d611e31f8938 [2025-04-29 11:24:14,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:24:14,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:24:14,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:24:14,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:24:14,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:24:14,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:24:14" (1/1) ... [2025-04-29 11:24:14,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4579666b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:14, skipping insertion in model container [2025-04-29 11:24:14,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:24:14" (1/1) ... [2025-04-29 11:24:14,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:24:15,092 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:24:15,100 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:24:15,125 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:24:15,136 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:24:15,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:15 WrapperNode [2025-04-29 11:24:15,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:24:15,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:24:15,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:24:15,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:24:15,142 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:15" (1/1) ... [2025-04-29 11:24:15,150 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:15" (1/1) ... [2025-04-29 11:24:15,171 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 124 [2025-04-29 11:24:15,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:24:15,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:24:15,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:24:15,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:24:15,177 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:15" (1/1) ... [2025-04-29 11:24:15,177 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:15" (1/1) ... [2025-04-29 11:24:15,185 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:15" (1/1) ... [2025-04-29 11:24:15,201 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:15,202 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:15" (1/1) ... [2025-04-29 11:24:15,202 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:15" (1/1) ... [2025-04-29 11:24:15,208 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:15" (1/1) ... [2025-04-29 11:24:15,209 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:15" (1/1) ... [2025-04-29 11:24:15,214 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:15" (1/1) ... [2025-04-29 11:24:15,215 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:15" (1/1) ... [2025-04-29 11:24:15,216 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:15" (1/1) ... [2025-04-29 11:24:15,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:24:15,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:24:15,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:24:15,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:24:15,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:15" (1/1) ... [2025-04-29 11:24:15,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:24:15,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:15,251 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:15,254 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:15,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:24:15,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:24:15,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:24:15,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-04-29 11:24:15,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:24:15,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:24:15,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:24:15,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-04-29 11:24:15,341 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:24:15,343 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:24:15,591 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-04-29 11:24:15,592 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:24:15,599 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:24:15,600 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:24:15,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:24:15 BoogieIcfgContainer [2025-04-29 11:24:15,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:24:15,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:24:15,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:24:15,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:24:15,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:24:14" (1/3) ... [2025-04-29 11:24:15,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7952398b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:24:15, skipping insertion in model container [2025-04-29 11:24:15,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:24:15" (2/3) ... [2025-04-29 11:24:15,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7952398b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:24:15, skipping insertion in model container [2025-04-29 11:24:15,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:24:15" (3/3) ... [2025-04-29 11:24:15,610 INFO L128 eAbstractionObserver]: Analyzing ICFG lockfree-3.1.c [2025-04-29 11:24:15,619 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:24:15,620 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lockfree-3.1.c that has 1 procedures, 64 locations, 82 edges, 1 initial locations, 2 loop locations, and 20 error locations. [2025-04-29 11:24:15,649 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:24:15,659 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;@4effbfbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:24:15,660 INFO L341 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-04-29 11:24:15,662 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:15,665 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:24:15,665 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:15,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:24:15,666 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:15,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:15,670 INFO L85 PathProgramCache]: Analyzing trace with hash 28820323, now seen corresponding path program 1 times [2025-04-29 11:24:15,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:15,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [962466981] [2025-04-29 11:24:15,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:15,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:15,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:15,680 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:15,681 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:15,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:24:15,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:24:15,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:15,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:15,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-04-29 11:24:15,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:15,755 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:15,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:24:15,756 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:15,756 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962466981] [2025-04-29 11:24:15,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962466981] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:15,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:15,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:15,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80594125] [2025-04-29 11:24:15,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:15,764 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 11:24:15,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:15,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 11:24:15,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 11:24:15,783 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:15,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:15,797 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2025-04-29 11:24:15,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 11:24:15,799 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:15,800 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:15,805 INFO L225 Difference]: With dead ends: 64 [2025-04-29 11:24:15,805 INFO L226 Difference]: Without dead ends: 62 [2025-04-29 11:24:15,806 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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:15,809 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:15,809 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:15,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-04-29 11:24:15,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-04-29 11:24:15,832 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:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2025-04-29 11:24:15,837 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 5 [2025-04-29 11:24:15,838 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:15,838 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-04-29 11:24:15,838 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:15,838 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2025-04-29 11:24:15,839 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:24:15,839 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:15,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:15,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:24:16,043 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 [2025-04-29 11:24:16,043 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:16,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:16,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1805898957, now seen corresponding path program 1 times [2025-04-29 11:24:16,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:16,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754974160] [2025-04-29 11:24:16,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:16,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:16,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:16,047 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:16,062 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:16,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:24:16,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:24:16,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:16,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:16,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-29 11:24:16,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:16,118 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:16,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:24:16,119 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:16,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754974160] [2025-04-29 11:24:16,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754974160] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:16,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:16,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:24:16,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165393500] [2025-04-29 11:24:16,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:16,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:16,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:16,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:16,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:16,121 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:16,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:16,139 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2025-04-29 11:24:16,139 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:16,139 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-29 11:24:16,139 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:16,140 INFO L225 Difference]: With dead ends: 63 [2025-04-29 11:24:16,140 INFO L226 Difference]: Without dead ends: 63 [2025-04-29 11:24:16,140 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:16,141 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:16,141 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:16,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-29 11:24:16,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-04-29 11:24:16,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 62 states have internal predecessors, (80), 0 states have call successors, (0), 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,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2025-04-29 11:24:16,148 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 7 [2025-04-29 11:24:16,148 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:16,148 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2025-04-29 11:24:16,148 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:16,148 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2025-04-29 11:24:16,148 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:24:16,148 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:16,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:16,154 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:16,350 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 [2025-04-29 11:24:16,350 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:16,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:16,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1805958539, now seen corresponding path program 1 times [2025-04-29 11:24:16,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:16,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [17300431] [2025-04-29 11:24:16,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:16,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:16,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:16,353 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:16,354 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:16,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:24:16,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:24:16,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:16,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:16,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-29 11:24:16,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:16,399 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:16,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:24:16,399 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:16,399 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17300431] [2025-04-29 11:24:16,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17300431] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:16,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:16,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:16,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636065480] [2025-04-29 11:24:16,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:16,400 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:16,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:16,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:16,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:16,400 INFO L87 Difference]: Start difference. First operand 63 states and 80 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:16,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:16,486 INFO L93 Difference]: Finished difference Result 117 states and 151 transitions. [2025-04-29 11:24:16,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:16,486 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:16,486 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:16,487 INFO L225 Difference]: With dead ends: 117 [2025-04-29 11:24:16,487 INFO L226 Difference]: Without dead ends: 116 [2025-04-29 11:24:16,487 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:16,487 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:16,488 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.1s Time] [2025-04-29 11:24:16,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-29 11:24:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2025-04-29 11:24:16,495 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:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2025-04-29 11:24:16,498 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 7 [2025-04-29 11:24:16,498 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:16,498 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2025-04-29 11:24:16,498 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:16,499 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2025-04-29 11:24:16,499 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:24:16,499 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:16,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:16,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:24:16,699 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:16,699 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:16,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:16,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1805958155, now seen corresponding path program 1 times [2025-04-29 11:24:16,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:16,700 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1636255640] [2025-04-29 11:24:16,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:16,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:16,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:16,702 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:16,703 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:16,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:24:16,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:24:16,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:16,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:16,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:24:16,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:16,781 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:16,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:24:16,781 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:16,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636255640] [2025-04-29 11:24:16,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636255640] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:16,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:16,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:16,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416212423] [2025-04-29 11:24:16,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:16,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:16,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:16,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:16,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:16,782 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:16,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:16,811 INFO L93 Difference]: Finished difference Result 178 states and 265 transitions. [2025-04-29 11:24:16,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:16,812 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:16,812 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:16,813 INFO L225 Difference]: With dead ends: 178 [2025-04-29 11:24:16,813 INFO L226 Difference]: Without dead ends: 177 [2025-04-29 11:24:16,813 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:16,813 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:16,813 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:16,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-04-29 11:24:16,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 154. [2025-04-29 11:24:16,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 134 states have (on average 1.8432835820895523) internal successors, (247), 153 states have internal predecessors, (247), 0 states have call successors, (0), 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,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 247 transitions. [2025-04-29 11:24:16,821 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 247 transitions. Word has length 7 [2025-04-29 11:24:16,821 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:16,821 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 247 transitions. [2025-04-29 11:24:16,821 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:16,821 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 247 transitions. [2025-04-29 11:24:16,821 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:24:16,821 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:16,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:16,827 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:17,022 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 [2025-04-29 11:24:17,022 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:17,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:17,022 INFO L85 PathProgramCache]: Analyzing trace with hash 296297806, now seen corresponding path program 1 times [2025-04-29 11:24:17,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:17,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [42719747] [2025-04-29 11:24:17,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:17,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:17,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:17,025 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:17,026 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:17,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:24:17,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:24:17,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:17,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:17,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:24:17,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:17,100 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:17,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:24:17,101 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:17,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42719747] [2025-04-29 11:24:17,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42719747] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:17,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:17,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:24:17,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548223558] [2025-04-29 11:24:17,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:17,102 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:24:17,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:17,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:24:17,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:24:17,103 INFO L87 Difference]: Start difference. First operand 154 states and 247 transitions. Second operand has 4 states, 4 states have (on average 2.25) 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:17,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:17,137 INFO L93 Difference]: Finished difference Result 159 states and 253 transitions. [2025-04-29 11:24:17,139 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:24:17,140 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) 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:17,140 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:17,141 INFO L225 Difference]: With dead ends: 159 [2025-04-29 11:24:17,141 INFO L226 Difference]: Without dead ends: 159 [2025-04-29 11:24:17,141 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:17,141 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:17,141 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 215 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:17,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-04-29 11:24:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2025-04-29 11:24:17,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 136 states have (on average 1.8308823529411764) internal successors, (249), 155 states have internal predecessors, (249), 0 states have call successors, (0), 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:17,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 249 transitions. [2025-04-29 11:24:17,153 INFO L79 Accepts]: Start accepts. Automaton has 156 states and 249 transitions. Word has length 9 [2025-04-29 11:24:17,153 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:17,154 INFO L485 AbstractCegarLoop]: Abstraction has 156 states and 249 transitions. [2025-04-29 11:24:17,154 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) 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:17,154 INFO L278 IsEmpty]: Start isEmpty. Operand 156 states and 249 transitions. [2025-04-29 11:24:17,154 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:24:17,154 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:17,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:17,160 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:17,354 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 [2025-04-29 11:24:17,355 INFO L403 AbstractCegarLoop]: === Iteration 6 === 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:17,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:17,355 INFO L85 PathProgramCache]: Analyzing trace with hash 353556108, now seen corresponding path program 1 times [2025-04-29 11:24:17,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:17,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2138310192] [2025-04-29 11:24:17,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:17,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:17,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:17,357 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:17,358 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:17,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:24:17,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:24:17,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:17,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:17,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:24:17,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:17,418 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 6 treesize of output 7 [2025-04-29 11:24:17,425 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:17,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:24:17,425 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:17,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138310192] [2025-04-29 11:24:17,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138310192] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:17,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:17,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:17,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170070866] [2025-04-29 11:24:17,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:17,426 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:17,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:17,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:17,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:17,426 INFO L87 Difference]: Start difference. First operand 156 states and 249 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:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:17,508 INFO L93 Difference]: Finished difference Result 233 states and 358 transitions. [2025-04-29 11:24:17,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:17,509 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:17,509 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:17,510 INFO L225 Difference]: With dead ends: 233 [2025-04-29 11:24:17,510 INFO L226 Difference]: Without dead ends: 233 [2025-04-29 11:24:17,510 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:17,511 INFO L437 NwaCegarLoop]: 122 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 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:17,511 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 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:17,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-04-29 11:24:17,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 213. [2025-04-29 11:24:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 195 states have (on average 1.7692307692307692) internal successors, (345), 212 states have internal predecessors, (345), 0 states have call successors, (0), 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:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 345 transitions. [2025-04-29 11:24:17,521 INFO L79 Accepts]: Start accepts. Automaton has 213 states and 345 transitions. Word has length 9 [2025-04-29 11:24:17,521 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:17,521 INFO L485 AbstractCegarLoop]: Abstraction has 213 states and 345 transitions. [2025-04-29 11:24:17,521 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:17,521 INFO L278 IsEmpty]: Start isEmpty. Operand 213 states and 345 transitions. [2025-04-29 11:24:17,521 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:24:17,521 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:17,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:17,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:24:17,721 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 [2025-04-29 11:24:17,722 INFO L403 AbstractCegarLoop]: === Iteration 7 === 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:17,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:17,722 INFO L85 PathProgramCache]: Analyzing trace with hash 353556109, now seen corresponding path program 1 times [2025-04-29 11:24:17,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:17,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1955243096] [2025-04-29 11:24:17,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:17,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:17,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:17,724 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:17,725 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:17,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:24:17,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:24:17,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:17,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:17,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:24:17,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:17,778 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 6 treesize of output 5 [2025-04-29 11:24:17,786 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:17,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:24:17,787 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:17,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955243096] [2025-04-29 11:24:17,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955243096] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:17,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:17,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:24:17,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466916438] [2025-04-29 11:24:17,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:17,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:24:17,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:17,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:24:17,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:24:17,788 INFO L87 Difference]: Start difference. First operand 213 states and 345 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:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:17,868 INFO L93 Difference]: Finished difference Result 228 states and 349 transitions. [2025-04-29 11:24:17,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:24:17,869 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:17,869 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:17,870 INFO L225 Difference]: With dead ends: 228 [2025-04-29 11:24:17,870 INFO L226 Difference]: Without dead ends: 228 [2025-04-29 11:24:17,870 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:17,870 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:17,870 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 180 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-04-29 11:24:17,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 211. [2025-04-29 11:24:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 195 states have (on average 1.7282051282051283) internal successors, (337), 210 states have internal predecessors, (337), 0 states have call successors, (0), 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:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 337 transitions. [2025-04-29 11:24:17,881 INFO L79 Accepts]: Start accepts. Automaton has 211 states and 337 transitions. Word has length 9 [2025-04-29 11:24:17,881 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:17,881 INFO L485 AbstractCegarLoop]: Abstraction has 211 states and 337 transitions. [2025-04-29 11:24:17,881 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:17,881 INFO L278 IsEmpty]: Start isEmpty. Operand 211 states and 337 transitions. [2025-04-29 11:24:17,881 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:24:17,881 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:17,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:17,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:24:18,082 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:18,082 INFO L403 AbstractCegarLoop]: === Iteration 8 === 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:18,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1924654535, now seen corresponding path program 1 times [2025-04-29 11:24:18,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:18,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1215047884] [2025-04-29 11:24:18,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:18,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:18,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:18,084 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:18,085 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:18,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:24:18,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:24:18,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:18,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:18,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:24:18,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:18,146 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:18,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:24:18,147 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:18,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215047884] [2025-04-29 11:24:18,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215047884] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:18,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:18,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:24:18,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81639582] [2025-04-29 11:24:18,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:18,147 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:24:18,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:18,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:24:18,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:24:18,148 INFO L87 Difference]: Start difference. First operand 211 states and 337 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:18,173 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2025-04-29 11:24:18,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:24:18,174 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 11:24:18,174 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:18,175 INFO L225 Difference]: With dead ends: 190 [2025-04-29 11:24:18,175 INFO L226 Difference]: Without dead ends: 190 [2025-04-29 11:24:18,175 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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:18,175 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 45 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 194 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:18,175 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 194 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:18,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-04-29 11:24:18,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 168. [2025-04-29 11:24:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 156 states have (on average 1.6602564102564104) internal successors, (259), 167 states have internal predecessors, (259), 0 states have call successors, (0), 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,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 259 transitions. [2025-04-29 11:24:18,180 INFO L79 Accepts]: Start accepts. Automaton has 168 states and 259 transitions. Word has length 10 [2025-04-29 11:24:18,180 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:18,180 INFO L485 AbstractCegarLoop]: Abstraction has 168 states and 259 transitions. [2025-04-29 11:24:18,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:18,180 INFO L278 IsEmpty]: Start isEmpty. Operand 168 states and 259 transitions. [2025-04-29 11:24:18,180 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:24:18,181 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:18,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:18,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 11:24:18,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:18,381 INFO L403 AbstractCegarLoop]: === Iteration 9 === 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:18,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:18,382 INFO L85 PathProgramCache]: Analyzing trace with hash 516607341, now seen corresponding path program 1 times [2025-04-29 11:24:18,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:18,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1452778856] [2025-04-29 11:24:18,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:18,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:18,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:18,385 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:18,385 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:18,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:24:18,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:24:18,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:18,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:18,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:24:18,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:18,444 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:18,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:24:18,444 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:18,444 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452778856] [2025-04-29 11:24:18,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452778856] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:24:18,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:24:18,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:24:18,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848872827] [2025-04-29 11:24:18,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:18,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:24:18,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:18,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:24:18,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:24:18,446 INFO L87 Difference]: Start difference. First operand 168 states and 259 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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:18,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:18,468 INFO L93 Difference]: Finished difference Result 260 states and 382 transitions. [2025-04-29 11:24:18,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:24:18,471 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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:18,471 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:18,472 INFO L225 Difference]: With dead ends: 260 [2025-04-29 11:24:18,472 INFO L226 Difference]: Without dead ends: 260 [2025-04-29 11:24:18,472 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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:18,473 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 37 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:18,473 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 191 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:18,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-04-29 11:24:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 245. [2025-04-29 11:24:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 233 states have (on average 1.5751072961373391) internal successors, (367), 244 states have internal predecessors, (367), 0 states have call successors, (0), 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,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 367 transitions. [2025-04-29 11:24:18,484 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 367 transitions. Word has length 11 [2025-04-29 11:24:18,484 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:18,484 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 367 transitions. [2025-04-29 11:24:18,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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:18,484 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 367 transitions. [2025-04-29 11:24:18,484 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:24:18,485 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:18,485 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:18,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-29 11:24:18,685 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:18,685 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:18,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:18,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1842808106, now seen corresponding path program 1 times [2025-04-29 11:24:18,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:18,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1978565044] [2025-04-29 11:24:18,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:18,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:18,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:18,688 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:18,689 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:18,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:24:18,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:24:18,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:18,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:18,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:24:18,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:18,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:18,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:18,799 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:18,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978565044] [2025-04-29 11:24:18,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978565044] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:18,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:24:18,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-04-29 11:24:18,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897684055] [2025-04-29 11:24:18,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:18,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:24:18,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:18,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:24:18,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:24:18,801 INFO L87 Difference]: Start difference. First operand 245 states and 367 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:18,870 INFO L93 Difference]: Finished difference Result 551 states and 783 transitions. [2025-04-29 11:24:18,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:24:18,871 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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:18,871 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:18,874 INFO L225 Difference]: With dead ends: 551 [2025-04-29 11:24:18,874 INFO L226 Difference]: Without dead ends: 551 [2025-04-29 11:24:18,874 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:24:18,875 INFO L437 NwaCegarLoop]: 100 mSDtfsCounter, 256 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:18,875 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 435 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:18,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-04-29 11:24:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 511. [2025-04-29 11:24:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 499 states have (on average 1.5370741482965933) internal successors, (767), 510 states have internal predecessors, (767), 0 states have call successors, (0), 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,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 767 transitions. [2025-04-29 11:24:18,884 INFO L79 Accepts]: Start accepts. Automaton has 511 states and 767 transitions. Word has length 16 [2025-04-29 11:24:18,884 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:18,884 INFO L485 AbstractCegarLoop]: Abstraction has 511 states and 767 transitions. [2025-04-29 11:24:18,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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,884 INFO L278 IsEmpty]: Start isEmpty. Operand 511 states and 767 transitions. [2025-04-29 11:24:18,885 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:24:18,885 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:18,885 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:18,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:24:19,088 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 [2025-04-29 11:24:19,088 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:19,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:19,088 INFO L85 PathProgramCache]: Analyzing trace with hash 933583904, now seen corresponding path program 1 times [2025-04-29 11:24:19,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:19,088 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [562943657] [2025-04-29 11:24:19,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:19,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:19,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:19,090 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:19,091 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:19,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:24:19,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:24:19,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:19,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:19,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:24:19,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:19,168 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:19,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:19,214 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:19,214 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:19,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562943657] [2025-04-29 11:24:19,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562943657] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:19,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:24:19,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-04-29 11:24:19,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053447566] [2025-04-29 11:24:19,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:19,215 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:24:19,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:19,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:24:19,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:24:19,216 INFO L87 Difference]: Start difference. First operand 511 states and 767 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:19,333 INFO L93 Difference]: Finished difference Result 1420 states and 2081 transitions. [2025-04-29 11:24:19,333 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:24:19,333 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 11:24:19,333 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:19,337 INFO L225 Difference]: With dead ends: 1420 [2025-04-29 11:24:19,337 INFO L226 Difference]: Without dead ends: 1420 [2025-04-29 11:24:19,337 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:24:19,338 INFO L437 NwaCegarLoop]: 116 mSDtfsCounter, 271 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:19,338 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 523 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:19,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2025-04-29 11:24:19,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1246. [2025-04-29 11:24:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1234 states have (on average 1.5016207455429498) internal successors, (1853), 1245 states have internal predecessors, (1853), 0 states have call successors, (0), 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,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1853 transitions. [2025-04-29 11:24:19,359 INFO L79 Accepts]: Start accepts. Automaton has 1246 states and 1853 transitions. Word has length 18 [2025-04-29 11:24:19,359 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:19,359 INFO L485 AbstractCegarLoop]: Abstraction has 1246 states and 1853 transitions. [2025-04-29 11:24:19,359 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:24:19,359 INFO L278 IsEmpty]: Start isEmpty. Operand 1246 states and 1853 transitions. [2025-04-29 11:24:19,360 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 11:24:19,360 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:19,360 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:19,367 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:19,561 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 [2025-04-29 11:24:19,561 INFO L403 AbstractCegarLoop]: === Iteration 12 === 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:19,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:19,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1395065772, now seen corresponding path program 1 times [2025-04-29 11:24:19,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:19,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [729542005] [2025-04-29 11:24:19,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:19,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:19,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:19,563 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:19,565 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:19,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:24:19,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:24:19,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:19,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:19,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:24:19,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:19,680 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:19,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:19,743 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:19,743 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:19,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729542005] [2025-04-29 11:24:19,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729542005] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:19,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:24:19,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2025-04-29 11:24:19,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770525956] [2025-04-29 11:24:19,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:19,744 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:24:19,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:19,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:24:19,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:24:19,744 INFO L87 Difference]: Start difference. First operand 1246 states and 1853 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:19,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:19,845 INFO L93 Difference]: Finished difference Result 3656 states and 5355 transitions. [2025-04-29 11:24:19,845 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:24:19,845 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:19,845 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:19,855 INFO L225 Difference]: With dead ends: 3656 [2025-04-29 11:24:19,855 INFO L226 Difference]: Without dead ends: 3656 [2025-04-29 11:24:19,855 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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:19,855 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 173 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:19,855 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 170 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:19,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2025-04-29 11:24:19,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3373. [2025-04-29 11:24:19,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3373 states, 3361 states have (on average 1.4855697709015174) internal successors, (4993), 3372 states have internal predecessors, (4993), 0 states have call successors, (0), 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,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 4993 transitions. [2025-04-29 11:24:19,904 INFO L79 Accepts]: Start accepts. Automaton has 3373 states and 4993 transitions. Word has length 27 [2025-04-29 11:24:19,904 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:19,904 INFO L485 AbstractCegarLoop]: Abstraction has 3373 states and 4993 transitions. [2025-04-29 11:24:19,904 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:19,904 INFO L278 IsEmpty]: Start isEmpty. Operand 3373 states and 4993 transitions. [2025-04-29 11:24:19,904 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 11:24:19,904 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:19,905 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:19,910 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:20,105 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 [2025-04-29 11:24:20,105 INFO L403 AbstractCegarLoop]: === Iteration 13 === 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:20,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:20,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1359367982, now seen corresponding path program 1 times [2025-04-29 11:24:20,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:20,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [852447406] [2025-04-29 11:24:20,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:20,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:20,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:20,108 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:20,108 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:20,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:24:20,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:24:20,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:20,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:20,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 11:24:20,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:20,200 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:20,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:20,241 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:20,241 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:20,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852447406] [2025-04-29 11:24:20,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852447406] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:20,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:24:20,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-04-29 11:24:20,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424151608] [2025-04-29 11:24:20,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:20,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:24:20,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:20,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:24:20,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:24:20,242 INFO L87 Difference]: Start difference. First operand 3373 states and 4993 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:20,388 INFO L93 Difference]: Finished difference Result 3719 states and 5287 transitions. [2025-04-29 11:24:20,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:24:20,389 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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:20,389 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:20,398 INFO L225 Difference]: With dead ends: 3719 [2025-04-29 11:24:20,398 INFO L226 Difference]: Without dead ends: 3719 [2025-04-29 11:24:20,398 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:24:20,399 INFO L437 NwaCegarLoop]: 100 mSDtfsCounter, 293 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:20,399 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 523 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:20,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2025-04-29 11:24:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3429. [2025-04-29 11:24:20,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3429 states, 3417 states have (on average 1.4612232952882647) internal successors, (4993), 3428 states have internal predecessors, (4993), 0 states have call successors, (0), 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,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 3429 states and 4993 transitions. [2025-04-29 11:24:20,448 INFO L79 Accepts]: Start accepts. Automaton has 3429 states and 4993 transitions. Word has length 28 [2025-04-29 11:24:20,449 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:20,449 INFO L485 AbstractCegarLoop]: Abstraction has 3429 states and 4993 transitions. [2025-04-29 11:24:20,449 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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,449 INFO L278 IsEmpty]: Start isEmpty. Operand 3429 states and 4993 transitions. [2025-04-29 11:24:20,449 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:24:20,449 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:20,449 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:20,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:20,650 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 [2025-04-29 11:24:20,650 INFO L403 AbstractCegarLoop]: === Iteration 14 === 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:20,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash 716480828, now seen corresponding path program 1 times [2025-04-29 11:24:20,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:20,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1121075419] [2025-04-29 11:24:20,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:20,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:20,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:20,653 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:20,654 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:20,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:24:20,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:24:20,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:20,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:20,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:24:20,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:20,728 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:20,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:20,747 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:20,747 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:20,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121075419] [2025-04-29 11:24:20,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121075419] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:20,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:24:20,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2025-04-29 11:24:20,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199844036] [2025-04-29 11:24:20,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:20,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:24:20,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:20,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:24:20,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:24:20,748 INFO L87 Difference]: Start difference. First operand 3429 states and 4993 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:20,803 INFO L93 Difference]: Finished difference Result 1412 states and 2004 transitions. [2025-04-29 11:24:20,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:24:20,803 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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:20,803 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:20,818 INFO L225 Difference]: With dead ends: 1412 [2025-04-29 11:24:20,818 INFO L226 Difference]: Without dead ends: 1412 [2025-04-29 11:24:20,818 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:24:20,819 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 78 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:20,819 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 428 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:20,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2025-04-29 11:24:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1374. [2025-04-29 11:24:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1362 states have (on average 1.4434654919236416) internal successors, (1966), 1373 states have internal predecessors, (1966), 0 states have call successors, (0), 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,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1966 transitions. [2025-04-29 11:24:20,837 INFO L79 Accepts]: Start accepts. Automaton has 1374 states and 1966 transitions. Word has length 30 [2025-04-29 11:24:20,837 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:20,837 INFO L485 AbstractCegarLoop]: Abstraction has 1374 states and 1966 transitions. [2025-04-29 11:24:20,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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,837 INFO L278 IsEmpty]: Start isEmpty. Operand 1374 states and 1966 transitions. [2025-04-29 11:24:20,838 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:24:20,838 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:20,838 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:20,845 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:21,042 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:21,042 INFO L403 AbstractCegarLoop]: === Iteration 15 === 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:21,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:21,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1457047439, now seen corresponding path program 1 times [2025-04-29 11:24:21,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:21,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [681454732] [2025-04-29 11:24:21,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:21,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:21,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:21,046 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:21,047 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:21,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:24:21,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:24:21,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:21,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:21,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:24:21,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:24:21,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:24:21,218 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:21,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681454732] [2025-04-29 11:24:21,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681454732] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:21,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:24:21,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2025-04-29 11:24:21,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885458865] [2025-04-29 11:24:21,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:21,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:24:21,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:21,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:24:21,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:24:21,220 INFO L87 Difference]: Start difference. First operand 1374 states and 1966 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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:21,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:21,297 INFO L93 Difference]: Finished difference Result 2236 states and 3207 transitions. [2025-04-29 11:24:21,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:24:21,297 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 43 [2025-04-29 11:24:21,297 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:21,303 INFO L225 Difference]: With dead ends: 2236 [2025-04-29 11:24:21,303 INFO L226 Difference]: Without dead ends: 2236 [2025-04-29 11:24:21,304 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:24:21,305 INFO L437 NwaCegarLoop]: 99 mSDtfsCounter, 78 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:21,305 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 367 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2025-04-29 11:24:21,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 1930. [2025-04-29 11:24:21,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1918 states have (on average 1.4410844629822732) internal successors, (2764), 1929 states have internal predecessors, (2764), 0 states have call successors, (0), 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:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2764 transitions. [2025-04-29 11:24:21,341 INFO L79 Accepts]: Start accepts. Automaton has 1930 states and 2764 transitions. Word has length 43 [2025-04-29 11:24:21,341 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:21,341 INFO L485 AbstractCegarLoop]: Abstraction has 1930 states and 2764 transitions. [2025-04-29 11:24:21,341 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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:21,341 INFO L278 IsEmpty]: Start isEmpty. Operand 1930 states and 2764 transitions. [2025-04-29 11:24:21,341 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:24:21,342 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:21,342 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:21,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-29 11:24:21,546 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 [2025-04-29 11:24:21,546 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:21,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:21,547 INFO L85 PathProgramCache]: Analyzing trace with hash 354889389, now seen corresponding path program 1 times [2025-04-29 11:24:21,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:21,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1893225647] [2025-04-29 11:24:21,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:21,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:21,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:21,549 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:21,551 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:21,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:24:21,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:24:21,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:21,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:21,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-29 11:24:21,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:21,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:21,774 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-29 11:24:21,774 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:21,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893225647] [2025-04-29 11:24:21,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893225647] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:21,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:24:21,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2025-04-29 11:24:21,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859755121] [2025-04-29 11:24:21,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:21,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:24:21,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:21,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:24:21,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:24:21,776 INFO L87 Difference]: Start difference. First operand 1930 states and 2764 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 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:22,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:22,023 INFO L93 Difference]: Finished difference Result 2066 states and 2805 transitions. [2025-04-29 11:24:22,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:24:22,024 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 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 43 [2025-04-29 11:24:22,024 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:22,028 INFO L225 Difference]: With dead ends: 2066 [2025-04-29 11:24:22,028 INFO L226 Difference]: Without dead ends: 2066 [2025-04-29 11:24:22,029 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:24:22,029 INFO L437 NwaCegarLoop]: 239 mSDtfsCounter, 315 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:22,029 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1722 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:22,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2025-04-29 11:24:22,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1477. [2025-04-29 11:24:22,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1465 states have (on average 1.3904436860068259) internal successors, (2037), 1476 states have internal predecessors, (2037), 0 states have call successors, (0), 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,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 2037 transitions. [2025-04-29 11:24:22,050 INFO L79 Accepts]: Start accepts. Automaton has 1477 states and 2037 transitions. Word has length 43 [2025-04-29 11:24:22,050 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:22,050 INFO L485 AbstractCegarLoop]: Abstraction has 1477 states and 2037 transitions. [2025-04-29 11:24:22,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 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:22,051 INFO L278 IsEmpty]: Start isEmpty. Operand 1477 states and 2037 transitions. [2025-04-29 11:24:22,051 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:24:22,051 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:22,051 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:22,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-29 11:24:22,255 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 [2025-04-29 11:24:22,255 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:22,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:22,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1054325134, now seen corresponding path program 1 times [2025-04-29 11:24:22,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:22,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326362103] [2025-04-29 11:24:22,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:22,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:22,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:22,258 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:22,259 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:22,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:24:22,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:24:22,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:22,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:22,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-29 11:24:22,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:22,415 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:22,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:22,460 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-04-29 11:24:22,460 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:22,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326362103] [2025-04-29 11:24:22,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326362103] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 11:24:22,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:24:22,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-04-29 11:24:22,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205793626] [2025-04-29 11:24:22,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:24:22,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:24:22,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:22,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:24:22,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:24:22,461 INFO L87 Difference]: Start difference. First operand 1477 states and 2037 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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:22,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:22,521 INFO L93 Difference]: Finished difference Result 1987 states and 2718 transitions. [2025-04-29 11:24:22,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:24:22,522 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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 45 [2025-04-29 11:24:22,522 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:22,526 INFO L225 Difference]: With dead ends: 1987 [2025-04-29 11:24:22,526 INFO L226 Difference]: Without dead ends: 1987 [2025-04-29 11:24:22,526 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:24:22,527 INFO L437 NwaCegarLoop]: 94 mSDtfsCounter, 42 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:22,527 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 337 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:24:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2025-04-29 11:24:22,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1787. [2025-04-29 11:24:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1775 states have (on average 1.388732394366197) internal successors, (2465), 1786 states have internal predecessors, (2465), 0 states have call successors, (0), 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,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2465 transitions. [2025-04-29 11:24:22,546 INFO L79 Accepts]: Start accepts. Automaton has 1787 states and 2465 transitions. Word has length 45 [2025-04-29 11:24:22,547 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:22,547 INFO L485 AbstractCegarLoop]: Abstraction has 1787 states and 2465 transitions. [2025-04-29 11:24:22,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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:22,547 INFO L278 IsEmpty]: Start isEmpty. Operand 1787 states and 2465 transitions. [2025-04-29 11:24:22,547 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 11:24:22,547 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:22,547 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:22,553 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:22,752 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 [2025-04-29 11:24:22,752 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:22,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:22,752 INFO L85 PathProgramCache]: Analyzing trace with hash -65085218, now seen corresponding path program 1 times [2025-04-29 11:24:22,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:22,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1292483152] [2025-04-29 11:24:22,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:22,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:22,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:22,755 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:22,756 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:22,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:24:22,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:24:22,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:22,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:22,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-29 11:24:22,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:22,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:22,983 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-29 11:24:22,983 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:22,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292483152] [2025-04-29 11:24:22,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292483152] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:22,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:24:22,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2025-04-29 11:24:22,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020650880] [2025-04-29 11:24:22,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:22,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:24:22,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:22,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:24:22,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:24:22,984 INFO L87 Difference]: Start difference. First operand 1787 states and 2465 transitions. Second operand has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 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:23,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:23,250 INFO L93 Difference]: Finished difference Result 3594 states and 4963 transitions. [2025-04-29 11:24:23,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-29 11:24:23,251 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 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) Word has length 47 [2025-04-29 11:24:23,251 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:23,259 INFO L225 Difference]: With dead ends: 3594 [2025-04-29 11:24:23,259 INFO L226 Difference]: Without dead ends: 3594 [2025-04-29 11:24:23,259 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2025-04-29 11:24:23,260 INFO L437 NwaCegarLoop]: 222 mSDtfsCounter, 622 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:23,260 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1678 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:24:23,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2025-04-29 11:24:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 2680. [2025-04-29 11:24:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2680 states, 2668 states have (on average 1.4250374812593702) internal successors, (3802), 2679 states have internal predecessors, (3802), 0 states have call successors, (0), 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:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 3802 transitions. [2025-04-29 11:24:23,302 INFO L79 Accepts]: Start accepts. Automaton has 2680 states and 3802 transitions. Word has length 47 [2025-04-29 11:24:23,303 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:23,303 INFO L485 AbstractCegarLoop]: Abstraction has 2680 states and 3802 transitions. [2025-04-29 11:24:23,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 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:23,303 INFO L278 IsEmpty]: Start isEmpty. Operand 2680 states and 3802 transitions. [2025-04-29 11:24:23,303 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-29 11:24:23,304 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:23,304 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:24:23,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-29 11:24:23,507 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:23,507 INFO L403 AbstractCegarLoop]: === Iteration 19 === 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:23,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:23,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1270542134, now seen corresponding path program 1 times [2025-04-29 11:24:23,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:23,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [843647611] [2025-04-29 11:24:23,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:23,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:23,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:23,510 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,511 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,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 11:24:23,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 11:24:23,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:23,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:24:23,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-29 11:24:23,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:24:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 19 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:23,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:24:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 19 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:24:23,785 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:24:23,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843647611] [2025-04-29 11:24:23,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843647611] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:24:23,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:24:23,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-04-29 11:24:23,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805226783] [2025-04-29 11:24:23,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:24:23,786 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:24:23,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:24:23,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:24:23,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:24:23,786 INFO L87 Difference]: Start difference. First operand 2680 states and 3802 transitions. Second operand has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 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:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:24:24,223 INFO L93 Difference]: Finished difference Result 8571 states and 12168 transitions. [2025-04-29 11:24:24,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-29 11:24:24,225 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 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 57 [2025-04-29 11:24:24,225 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:24:24,254 INFO L225 Difference]: With dead ends: 8571 [2025-04-29 11:24:24,254 INFO L226 Difference]: Without dead ends: 8571 [2025-04-29 11:24:24,254 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=285, Invalid=1121, Unknown=0, NotChecked=0, Total=1406 [2025-04-29 11:24:24,254 INFO L437 NwaCegarLoop]: 266 mSDtfsCounter, 1015 mSDsluCounter, 1819 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:24:24,255 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 2085 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:24:24,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8571 states. [2025-04-29 11:24:24,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8571 to 8153. [2025-04-29 11:24:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8153 states, 8141 states have (on average 1.4474880235843262) internal successors, (11784), 8152 states have internal predecessors, (11784), 0 states have call successors, (0), 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:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8153 states to 8153 states and 11784 transitions. [2025-04-29 11:24:24,383 INFO L79 Accepts]: Start accepts. Automaton has 8153 states and 11784 transitions. Word has length 57 [2025-04-29 11:24:24,383 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:24:24,383 INFO L485 AbstractCegarLoop]: Abstraction has 8153 states and 11784 transitions. [2025-04-29 11:24:24,383 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 14 states have internal predecessors, (107), 0 states have call successors, (0), 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:24,386 INFO L278 IsEmpty]: Start isEmpty. Operand 8153 states and 11784 transitions. [2025-04-29 11:24:24,386 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-29 11:24:24,386 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:24:24,386 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:24,394 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:24,587 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:24,587 INFO L403 AbstractCegarLoop]: === Iteration 20 === 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:24,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:24:24,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1825876446, now seen corresponding path program 1 times [2025-04-29 11:24:24,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:24:24,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1194577149] [2025-04-29 11:24:24,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:24:24,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:24:24,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:24:24,589 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:24,590 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:24,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-29 11:24:24,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-29 11:24:24,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:24,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:24:24,705 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:24:24,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-29 11:24:24,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-29 11:24:24,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:24:24,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:24:24,820 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-04-29 11:24:24,820 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:24:24,820 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2025-04-29 11:24:24,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2025-04-29 11:24:24,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2025-04-29 11:24:24,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2025-04-29 11:24:24,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2025-04-29 11:24:24,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2025-04-29 11:24:24,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2025-04-29 11:24:24,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2025-04-29 11:24:24,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2025-04-29 11:24:24,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2025-04-29 11:24:24,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2025-04-29 11:24:24,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2025-04-29 11:24:24,822 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2025-04-29 11:24:24,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2025-04-29 11:24:24,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2025-04-29 11:24:24,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2025-04-29 11:24:24,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2025-04-29 11:24:24,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2025-04-29 11:24:24,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2025-04-29 11:24:24,823 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2025-04-29 11:24:24,831 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:25,023 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 [2025-04-29 11:24:25,026 INFO L422 BasicCegarLoop]: Path program histogram: [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:25,076 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:24:25,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:24:25 BoogieIcfgContainer [2025-04-29 11:24:25,078 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:24:25,079 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:24:25,079 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:24:25,079 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:24:25,079 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:24:15" (3/4) ... [2025-04-29 11:24:25,081 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-29 11:24:25,082 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:24:25,083 INFO L158 Benchmark]: Toolchain (without parser) took 10130.85ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 93.1MB in the beginning and 59.7MB in the end (delta: 33.5MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. [2025-04-29 11:24:25,083 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 46.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:24:25,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.43ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 78.4MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:24:25,083 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.65ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 76.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:24:25,083 INFO L158 Benchmark]: Boogie Preprocessor took 47.52ms. Allocated memory is still 117.4MB. Free memory was 76.6MB in the beginning and 74.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:24:25,084 INFO L158 Benchmark]: RCFGBuilder took 381.57ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 54.1MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-29 11:24:25,084 INFO L158 Benchmark]: TraceAbstraction took 9475.35ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 53.6MB in the beginning and 59.7MB in the end (delta: -6.1MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2025-04-29 11:24:25,084 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 142.6MB. Free memory was 59.7MB in the beginning and 59.7MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:24:25,084 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 46.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.43ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 78.4MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.65ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 76.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.52ms. Allocated memory is still 117.4MB. Free memory was 76.6MB in the beginning and 74.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 381.57ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 54.1MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9475.35ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 53.6MB in the beginning and 59.7MB in the end (delta: -6.1MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 142.6MB. Free memory was 59.7MB in the beginning and 59.7MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 95]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 95. Possible FailurePath: [L14] struct cell *S; [L16] int pc1 = 1; [L17] int pc4 = 1; [L19] static struct cell *t1 = NULL; [L20] static struct cell *x1 = NULL; [L56] struct cell* garbage; [L58] static struct cell *t4 = NULL; [L59] static struct cell *x4 = NULL; [L63] static int res4; VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L97] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L97] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L97] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L98] COND TRUE __VERIFIER_nondet_int() [L99] CALL push() [L24] pc1++ [L25] case 1: VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L25] case 1: [L26] x1 = malloc(sizeof(*x1)) VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L27] x1->data = 0 VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L28] x1->next = NULL VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L99] RET push() [L97] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=2, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L97] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L98] COND TRUE __VERIFIER_nondet_int() [L99] CALL push() [L24] pc1++ [L25] case 1: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L25] case 1: [L31] case 2: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L31] case 2: VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L32] x1->data = 4 VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L99] RET push() [L97] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=3, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L97] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L98] COND TRUE __VERIFIER_nondet_int() [L99] CALL push() [L24] pc1++ [L25] case 1: VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L25] case 1: [L31] case 2: VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L31] case 2: [L35] case 3: [L36] t1 = S VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L99] RET push() [L97] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=4, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L97] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L98] COND TRUE __VERIFIER_nondet_int() [L99] CALL push() [L24] pc1++ [L25] case 1: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L25] case 1: [L31] case 2: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L31] case 2: [L35] case 3: [L39] case 4: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L39] case 4: VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L40] x1->next = t1 VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L99] RET push() [L97] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={0:0}, garbage={0:0}, pc1=5, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L97] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L98] COND TRUE __VERIFIER_nondet_int() [L99] CALL push() [L24] pc1++ [L25] case 1: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L25] case 1: [L31] case 2: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L31] case 2: [L35] case 3: [L39] case 4: VAL [S={0:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L39] case 4: [L43] case 5: [L45] S = x1 VAL [S={1:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L99] RET push() [L97] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={1:0}, garbage={0:0}, pc1=6, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L97] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L98] COND TRUE __VERIFIER_nondet_int() [L99] CALL push() [L24] pc1++ [L25] case 1: VAL [S={1:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L25] case 1: [L31] case 2: VAL [S={1:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L31] case 2: [L35] case 3: [L39] case 4: VAL [S={1:0}, garbage={0:0}, pc1=7, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L39] case 4: [L43] case 5: [L50] case 6: [L51] pc1 = 1 VAL [S={1:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L99] RET push() [L97] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L97] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [S={1:0}, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={1:0}, x4={0:0}] [L97] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L104] COND FALSE !(\read(*garbage)) [L110] S = NULL [L111] t1 = NULL [L112] x1 = NULL [L113] t4 = NULL [L114] x4 = NULL [L116] return !!garbage; VAL [S={0:0}, \result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 106]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 82 edges, 20 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3488 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3488 mSDsluCounter, 9714 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7554 mSDsCounter, 171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1317 IncrementalHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 171 mSolverCounterUnsat, 2160 mSDtfsCounter, 1317 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 839 GetRequests, 667 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8153occurred in iteration=19, InterpolantAutomatonStates: 176, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 3372 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 497 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 753 ConstructedInterpolants, 0 QuantifiedInterpolants, 2062 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1479 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 420/784 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-29 11:24:25,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample