./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash e028c51cfa02b345902e1292d1a644c7ee4a15183825ee6e2ec2fc316df147e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:31:13,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:31:13,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 07:31:13,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:31:13,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:31:13,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:31:13,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:31:13,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:31:13,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:31:13,347 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:31:13,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:31:13,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:31:13,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:31:13,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:31:13,347 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:31:13,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:31:13,347 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:31:13,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:31:13,348 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:31:13,348 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:31:13,348 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:31:13,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:31:13,348 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:31:13,348 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:31:13,348 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:31:13,348 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:31:13,348 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:31:13,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:31:13,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:31:13,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:31:13,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:31:13,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:31:13,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:31:13,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:31:13,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:31:13,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:31:13,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:31:13,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:31:13,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:31:13,349 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e028c51cfa02b345902e1292d1a644c7ee4a15183825ee6e2ec2fc316df147e6 [2025-03-04 07:31:13,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:31:13,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:31:13,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:31:13,573 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:31:13,573 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:31:13,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i [2025-03-04 07:31:14,749 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3e71d82/b8a4bc07c0444c46b76aea2fbf5effce/FLAGa2522c43e [2025-03-04 07:31:15,037 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:31:15,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i [2025-03-04 07:31:15,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3e71d82/b8a4bc07c0444c46b76aea2fbf5effce/FLAGa2522c43e [2025-03-04 07:31:15,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3e71d82/b8a4bc07c0444c46b76aea2fbf5effce [2025-03-04 07:31:15,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:31:15,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:31:15,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:31:15,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:31:15,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:31:15,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:31:15" (1/1) ... [2025-03-04 07:31:15,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32bf0180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:15, skipping insertion in model container [2025-03-04 07:31:15,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:31:15" (1/1) ... [2025-03-04 07:31:15,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:31:15,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:31:15,508 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:31:15,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:31:15,548 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:31:15,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:15 WrapperNode [2025-03-04 07:31:15,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:31:15,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:31:15,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:31:15,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:31:15,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:15" (1/1) ... [2025-03-04 07:31:15,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:15" (1/1) ... [2025-03-04 07:31:15,574 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2025-03-04 07:31:15,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:31:15,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:31:15,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:31:15,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:31:15,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:15" (1/1) ... [2025-03-04 07:31:15,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:15" (1/1) ... [2025-03-04 07:31:15,586 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:15" (1/1) ... [2025-03-04 07:31:15,594 INFO L175 MemorySlicer]: Split 15 memory accesses to 4 slices as follows [5, 1, 7, 2]. 47 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 6 writes are split as follows [2, 1, 2, 1]. [2025-03-04 07:31:15,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:15" (1/1) ... [2025-03-04 07:31:15,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:15" (1/1) ... [2025-03-04 07:31:15,598 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:15" (1/1) ... [2025-03-04 07:31:15,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:15" (1/1) ... [2025-03-04 07:31:15,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:15" (1/1) ... [2025-03-04 07:31:15,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:15" (1/1) ... [2025-03-04 07:31:15,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:31:15,603 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:31:15,603 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:31:15,603 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:31:15,604 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:15" (1/1) ... [2025-03-04 07:31:15,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:31:15,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:31:15,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:31:15,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:31:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:31:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:31:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 07:31:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 07:31:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:31:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:31:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 07:31:15,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 07:31:15,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:31:15,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:31:15,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:31:15,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:31:15,738 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:31:15,740 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:31:15,946 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L574: havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;havoc main_#t~ret19#1; [2025-03-04 07:31:15,946 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L571: havoc f_#t~mem15#1;havoc f_#t~mem16#1;call ULTIMATE.dealloc(f_#t~malloc2#1.base, f_#t~malloc2#1.offset);havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call ULTIMATE.dealloc(f_#t~malloc3#1.base, f_#t~malloc3#1.offset);havoc f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call ULTIMATE.dealloc(f_#t~malloc4#1.base, f_#t~malloc4#1.offset);havoc f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call ULTIMATE.dealloc(f_#t~malloc5#1.base, f_#t~malloc5#1.offset);havoc f_#t~malloc5#1.base, f_#t~malloc5#1.offset; [2025-03-04 07:31:15,965 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2025-03-04 07:31:15,965 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:31:15,974 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:31:15,974 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:31:15,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:31:15 BoogieIcfgContainer [2025-03-04 07:31:15,975 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:31:15,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:31:15,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:31:15,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:31:15,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:31:15" (1/3) ... [2025-03-04 07:31:15,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc21135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:31:15, skipping insertion in model container [2025-03-04 07:31:15,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:31:15" (2/3) ... [2025-03-04 07:31:15,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc21135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:31:15, skipping insertion in model container [2025-03-04 07:31:15,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:31:15" (3/3) ... [2025-03-04 07:31:15,984 INFO L128 eAbstractionObserver]: Analyzing ICFG twisted-alloca.i [2025-03-04 07:31:15,997 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:31:15,998 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG twisted-alloca.i that has 1 procedures, 65 locations, 1 initial locations, 2 loop locations, and 31 error locations. [2025-03-04 07:31:16,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:31:16,034 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@60e8bd8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:31:16,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-04 07:31:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 33 states have (on average 2.121212121212121) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:16,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:31:16,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:16,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:31:16,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 07:31:16,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:16,045 INFO L85 PathProgramCache]: Analyzing trace with hash 105225, now seen corresponding path program 1 times [2025-03-04 07:31:16,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:16,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095054445] [2025-03-04 07:31:16,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:16,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:16,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:31:16,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:31:16,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:16,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:16,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:16,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095054445] [2025-03-04 07:31:16,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095054445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:16,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:16,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:31:16,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677342057] [2025-03-04 07:31:16,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:16,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:31:16,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:16,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:31:16,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:16,379 INFO L87 Difference]: Start difference. First operand has 65 states, 33 states have (on average 2.121212121212121) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:16,446 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2025-03-04 07:31:16,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:31:16,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-04 07:31:16,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:16,453 INFO L225 Difference]: With dead ends: 63 [2025-03-04 07:31:16,453 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 07:31:16,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:16,457 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 57 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:16,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 36 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:31:16,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 07:31:16,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-04 07:31:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 32 states have (on average 2.0) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2025-03-04 07:31:16,488 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 3 [2025-03-04 07:31:16,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:16,488 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2025-03-04 07:31:16,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:16,490 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2025-03-04 07:31:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:31:16,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:16,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:31:16,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:31:16,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 07:31:16,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:16,492 INFO L85 PathProgramCache]: Analyzing trace with hash 105226, now seen corresponding path program 1 times [2025-03-04 07:31:16,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:16,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025656077] [2025-03-04 07:31:16,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:16,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:16,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:31:16,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:31:16,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:16,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:16,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:16,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025656077] [2025-03-04 07:31:16,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025656077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:16,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:16,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:31:16,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066794409] [2025-03-04 07:31:16,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:16,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:31:16,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:16,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:31:16,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:16,670 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:16,727 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2025-03-04 07:31:16,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:31:16,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-04 07:31:16,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:16,728 INFO L225 Difference]: With dead ends: 59 [2025-03-04 07:31:16,728 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 07:31:16,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:16,729 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 58 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:16,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 36 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:16,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 07:31:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-04 07:31:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.9375) internal successors, (62), 58 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2025-03-04 07:31:16,732 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 3 [2025-03-04 07:31:16,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:16,732 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2025-03-04 07:31:16,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2025-03-04 07:31:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:31:16,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:16,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:31:16,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:31:16,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 07:31:16,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:16,734 INFO L85 PathProgramCache]: Analyzing trace with hash 3262014, now seen corresponding path program 1 times [2025-03-04 07:31:16,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:16,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001457163] [2025-03-04 07:31:16,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:16,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:16,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:31:16,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:31:16,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:16,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:16,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:16,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001457163] [2025-03-04 07:31:16,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001457163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:16,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:16,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:31:16,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567201268] [2025-03-04 07:31:16,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:16,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:31:16,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:16,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:31:16,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:16,800 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:16,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:16,842 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2025-03-04 07:31:16,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:31:16,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-03-04 07:31:16,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:16,844 INFO L225 Difference]: With dead ends: 58 [2025-03-04 07:31:16,844 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 07:31:16,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:16,844 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:16,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 07:31:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-04 07:31:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.90625) internal successors, (61), 57 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:16,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2025-03-04 07:31:16,847 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 4 [2025-03-04 07:31:16,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:16,848 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2025-03-04 07:31:16,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:16,848 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2025-03-04 07:31:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:31:16,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:16,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:31:16,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:31:16,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 07:31:16,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:16,849 INFO L85 PathProgramCache]: Analyzing trace with hash 3262015, now seen corresponding path program 1 times [2025-03-04 07:31:16,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:16,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396495492] [2025-03-04 07:31:16,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:16,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:16,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:31:16,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:31:16,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:16,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:16,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:16,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396495492] [2025-03-04 07:31:16,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396495492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:16,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:16,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:31:16,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734956375] [2025-03-04 07:31:16,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:16,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:31:16,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:16,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:31:16,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:16,948 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:16,995 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2025-03-04 07:31:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:31:16,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-03-04 07:31:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:16,996 INFO L225 Difference]: With dead ends: 57 [2025-03-04 07:31:16,997 INFO L226 Difference]: Without dead ends: 57 [2025-03-04 07:31:16,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:16,998 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:16,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-04 07:31:17,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-04 07:31:17,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.875) internal successors, (60), 56 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2025-03-04 07:31:17,000 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 4 [2025-03-04 07:31:17,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:17,002 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2025-03-04 07:31:17,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:17,003 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2025-03-04 07:31:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:31:17,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:17,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:31:17,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:31:17,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 07:31:17,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:17,004 INFO L85 PathProgramCache]: Analyzing trace with hash 101122470, now seen corresponding path program 1 times [2025-03-04 07:31:17,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:17,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279769946] [2025-03-04 07:31:17,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:17,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:17,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:31:17,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:31:17,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:17,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:17,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:17,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279769946] [2025-03-04 07:31:17,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279769946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:17,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:17,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:31:17,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582547907] [2025-03-04 07:31:17,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:17,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:31:17,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:17,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:31:17,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:17,063 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:17,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:17,111 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2025-03-04 07:31:17,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:31:17,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:31:17,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:17,112 INFO L225 Difference]: With dead ends: 50 [2025-03-04 07:31:17,112 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 07:31:17,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:17,113 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 35 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:17,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 29 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:17,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 07:31:17,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-04 07:31:17,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.65625) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2025-03-04 07:31:17,117 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 5 [2025-03-04 07:31:17,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:17,118 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2025-03-04 07:31:17,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:17,119 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2025-03-04 07:31:17,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:31:17,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:17,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:31:17,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:31:17,119 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 07:31:17,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:17,120 INFO L85 PathProgramCache]: Analyzing trace with hash 101122471, now seen corresponding path program 1 times [2025-03-04 07:31:17,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:17,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709085636] [2025-03-04 07:31:17,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:17,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:17,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:31:17,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:31:17,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:17,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:17,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:17,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709085636] [2025-03-04 07:31:17,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709085636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:17,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:17,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:31:17,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281978546] [2025-03-04 07:31:17,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:17,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:31:17,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:17,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:31:17,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:17,194 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:17,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:17,227 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2025-03-04 07:31:17,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:31:17,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:31:17,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:17,228 INFO L225 Difference]: With dead ends: 43 [2025-03-04 07:31:17,228 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 07:31:17,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:17,229 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 35 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:17,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 32 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 07:31:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-04 07:31:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.4375) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2025-03-04 07:31:17,234 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 5 [2025-03-04 07:31:17,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:17,234 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2025-03-04 07:31:17,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:17,234 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2025-03-04 07:31:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:31:17,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:17,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:31:17,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:31:17,234 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 07:31:17,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:17,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1160170693, now seen corresponding path program 1 times [2025-03-04 07:31:17,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:17,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322785498] [2025-03-04 07:31:17,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:17,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:17,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:31:17,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:31:17,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:17,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:17,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:17,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322785498] [2025-03-04 07:31:17,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322785498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:17,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:17,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:31:17,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430464841] [2025-03-04 07:31:17,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:17,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:31:17,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:17,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:31:17,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:17,261 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:17,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:17,295 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2025-03-04 07:31:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:31:17,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:31:17,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:17,296 INFO L225 Difference]: With dead ends: 38 [2025-03-04 07:31:17,297 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 07:31:17,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:17,297 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:17,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 21 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:17,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 07:31:17,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 07:31:17,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.28125) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:17,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2025-03-04 07:31:17,302 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 6 [2025-03-04 07:31:17,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:17,302 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2025-03-04 07:31:17,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:17,302 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2025-03-04 07:31:17,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:31:17,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:17,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:31:17,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:31:17,303 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 07:31:17,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:17,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1160170692, now seen corresponding path program 1 times [2025-03-04 07:31:17,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:17,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300229484] [2025-03-04 07:31:17,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:17,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:17,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:31:17,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:31:17,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:17,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:17,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:17,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300229484] [2025-03-04 07:31:17,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300229484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:17,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:17,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:31:17,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880743395] [2025-03-04 07:31:17,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:17,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:31:17,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:17,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:31:17,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:17,375 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:17,404 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2025-03-04 07:31:17,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:31:17,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:31:17,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:17,405 INFO L225 Difference]: With dead ends: 33 [2025-03-04 07:31:17,405 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 07:31:17,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:31:17,406 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:17,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 24 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:17,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 07:31:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-04 07:31:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-03-04 07:31:17,411 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 6 [2025-03-04 07:31:17,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:17,411 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-03-04 07:31:17,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-03-04 07:31:17,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:31:17,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:17,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:17,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:31:17,413 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 07:31:17,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:17,413 INFO L85 PathProgramCache]: Analyzing trace with hash -358665142, now seen corresponding path program 1 times [2025-03-04 07:31:17,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:17,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385689830] [2025-03-04 07:31:17,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:17,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:17,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:31:17,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:31:17,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:17,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:31:17,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:17,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385689830] [2025-03-04 07:31:17,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385689830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:17,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:17,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:31:17,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382365127] [2025-03-04 07:31:17,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:17,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:31:17,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:17,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:31:17,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:31:17,490 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:17,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:17,516 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-03-04 07:31:17,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:31:17,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-03-04 07:31:17,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:17,517 INFO L225 Difference]: With dead ends: 51 [2025-03-04 07:31:17,517 INFO L226 Difference]: Without dead ends: 51 [2025-03-04 07:31:17,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:31:17,517 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:17,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 90 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:17,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-04 07:31:17,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-03-04 07:31:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-03-04 07:31:17,520 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 20 [2025-03-04 07:31:17,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:17,520 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-03-04 07:31:17,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:17,520 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-03-04 07:31:17,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:31:17,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:31:17,521 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:17,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:31:17,521 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 07:31:17,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:31:17,522 INFO L85 PathProgramCache]: Analyzing trace with hash 488986288, now seen corresponding path program 1 times [2025-03-04 07:31:17,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:31:17,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096878361] [2025-03-04 07:31:17,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:31:17,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:31:17,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:31:17,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:31:17,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:31:17,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:31:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:31:18,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:31:18,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096878361] [2025-03-04 07:31:18,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096878361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:31:18,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:31:18,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:31:18,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420385838] [2025-03-04 07:31:18,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:31:18,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:31:18,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:31:18,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:31:18,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:31:18,067 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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-03-04 07:31:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:31:18,103 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2025-03-04 07:31:18,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:31:18,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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 28 [2025-03-04 07:31:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:31:18,104 INFO L225 Difference]: With dead ends: 47 [2025-03-04 07:31:18,104 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 07:31:18,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:31:18,105 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:31:18,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 35 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:31:18,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 07:31:18,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 07:31:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:31:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 07:31:18,105 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2025-03-04 07:31:18,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:31:18,105 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 07:31:18,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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-03-04 07:31:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 07:31:18,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 07:31:18,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (30 of 31 remaining) [2025-03-04 07:31:18,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2025-03-04 07:31:18,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2025-03-04 07:31:18,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2025-03-04 07:31:18,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2025-03-04 07:31:18,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2025-03-04 07:31:18,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2025-03-04 07:31:18,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2025-03-04 07:31:18,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2025-03-04 07:31:18,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2025-03-04 07:31:18,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2025-03-04 07:31:18,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2025-03-04 07:31:18,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2025-03-04 07:31:18,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2025-03-04 07:31:18,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2025-03-04 07:31:18,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2025-03-04 07:31:18,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2025-03-04 07:31:18,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2025-03-04 07:31:18,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2025-03-04 07:31:18,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2025-03-04 07:31:18,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2025-03-04 07:31:18,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2025-03-04 07:31:18,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2025-03-04 07:31:18,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2025-03-04 07:31:18,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2025-03-04 07:31:18,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2025-03-04 07:31:18,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2025-03-04 07:31:18,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2025-03-04 07:31:18,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2025-03-04 07:31:18,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2025-03-04 07:31:18,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 31 remaining) [2025-03-04 07:31:18,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:31:18,113 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:31:18,114 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:31:18,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:31:18 BoogieIcfgContainer [2025-03-04 07:31:18,117 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:31:18,117 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:31:18,117 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:31:18,117 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:31:18,118 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:31:15" (3/4) ... [2025-03-04 07:31:18,119 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 07:31:18,138 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 07:31:18,139 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 07:31:18,140 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 07:31:18,140 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 07:31:18,199 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 07:31:18,200 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 07:31:18,200 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:31:18,201 INFO L158 Benchmark]: Toolchain (without parser) took 2879.27ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 103.1MB in the beginning and 286.5MB in the end (delta: -183.4MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2025-03-04 07:31:18,202 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:31:18,202 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.59ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 86.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:31:18,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.19ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 85.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:31:18,203 INFO L158 Benchmark]: Boogie Preprocessor took 27.09ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 83.5MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:31:18,203 INFO L158 Benchmark]: IcfgBuilder took 372.24ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 65.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:31:18,203 INFO L158 Benchmark]: TraceAbstraction took 2139.94ms. Allocated memory is still 142.6MB. Free memory was 64.7MB in the beginning and 32.2MB in the end (delta: 32.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2025-03-04 07:31:18,203 INFO L158 Benchmark]: Witness Printer took 82.77ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 32.2MB in the beginning and 286.5MB in the end (delta: -254.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:31:18,204 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.35ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.59ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 86.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.19ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 85.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.09ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 83.5MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 372.24ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 65.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2139.94ms. Allocated memory is still 142.6MB. Free memory was 64.7MB in the beginning and 32.2MB in the end (delta: 32.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Witness Printer took 82.77ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 32.2MB in the beginning and 286.5MB in the end (delta: -254.3MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 573]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 65 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 269 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 478 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 334 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 1219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 2/2 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 - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 07:31:18,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE