./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 93cff60adb183fef3af5f3af7541e684acb33c49f5e09dc255d0e19d271c8517 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:16:16,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:16:16,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-08 06:16:16,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:16:16,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:16:16,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:16:16,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:16:16,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:16:16,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:16:16,807 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:16:16,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:16:16,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:16:16,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:16:16,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:16:16,809 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:16:16,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:16:16,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:16:16,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:16:16,810 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:16:16,810 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:16:16,810 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:16:16,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:16:16,810 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:16:16,810 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:16:16,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:16:16,811 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:16:16,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:16:16,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:16:16,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:16:16,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:16:16,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:16:16,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:16:16,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:16:16,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:16:16,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:16:16,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:16:16,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:16:16,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:16:16,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:16:16,813 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-jdk21/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 -> 93cff60adb183fef3af5f3af7541e684acb33c49f5e09dc255d0e19d271c8517 [2025-02-08 06:16:17,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:16:17,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:16:17,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:16:17,091 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:16:17,091 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:16:17,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i [2025-02-08 06:16:18,400 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a9a4e190/80cd1d49d5e145d8967bcdafce58604b/FLAG97f7e8433 [2025-02-08 06:16:18,760 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:16:18,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i [2025-02-08 06:16:18,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a9a4e190/80cd1d49d5e145d8967bcdafce58604b/FLAG97f7e8433 [2025-02-08 06:16:18,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a9a4e190/80cd1d49d5e145d8967bcdafce58604b [2025-02-08 06:16:18,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:16:18,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:16:18,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:16:18,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:16:18,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:16:18,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:16:18" (1/1) ... [2025-02-08 06:16:18,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@598b5085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:16:18, skipping insertion in model container [2025-02-08 06:16:18,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:16:18" (1/1) ... [2025-02-08 06:16:18,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:16:19,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:16:19,112 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:16:19,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:16:19,181 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:16:19,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:16:19 WrapperNode [2025-02-08 06:16:19,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:16:19,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:16:19,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:16:19,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:16:19,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:16:19" (1/1) ... [2025-02-08 06:16:19,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:16:19" (1/1) ... [2025-02-08 06:16:19,222 INFO L138 Inliner]: procedures = 111, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2025-02-08 06:16:19,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:16:19,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:16:19,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:16:19,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:16:19,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:16:19" (1/1) ... [2025-02-08 06:16:19,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:16:19" (1/1) ... [2025-02-08 06:16:19,234 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:16:19" (1/1) ... [2025-02-08 06:16:19,251 INFO L175 MemorySlicer]: Split 13 memory accesses to 4 slices as follows [2, 3, 4, 4]. 31 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 [1, 1, 2, 2]. [2025-02-08 06:16:19,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:16:19" (1/1) ... [2025-02-08 06:16:19,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:16:19" (1/1) ... [2025-02-08 06:16:19,261 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:16:19" (1/1) ... [2025-02-08 06:16:19,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:16:19" (1/1) ... [2025-02-08 06:16:19,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:16:19" (1/1) ... [2025-02-08 06:16:19,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:16:19" (1/1) ... [2025-02-08 06:16:19,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:16:19,265 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:16:19,265 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:16:19,265 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:16:19,270 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:16:19" (1/1) ... [2025-02-08 06:16:19,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:16:19,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:16:19,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:16:19,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:16:19,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:16:19,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:16:19,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:16:19,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 06:16:19,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:16:19,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:16:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:16:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 06:16:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:16:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:16:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:16:19,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:16:19,435 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:16:19,436 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:16:19,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L566: havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;havoc main_#t~ret16#1; [2025-02-08 06:16:19,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L563: havoc test_fun_#t~mem12#1;call ULTIMATE.dealloc(test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset);havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset);havoc test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset);havoc test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset);havoc test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset; [2025-02-08 06:16:19,650 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2025-02-08 06:16:19,650 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:16:19,663 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:16:19,665 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:16:19,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:16:19 BoogieIcfgContainer [2025-02-08 06:16:19,666 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:16:19,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:16:19,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:16:19,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:16:19,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:16:18" (1/3) ... [2025-02-08 06:16:19,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592282fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:16:19, skipping insertion in model container [2025-02-08 06:16:19,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:16:19" (2/3) ... [2025-02-08 06:16:19,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592282fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:16:19, skipping insertion in model container [2025-02-08 06:16:19,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:16:19" (3/3) ... [2025-02-08 06:16:19,677 INFO L128 eAbstractionObserver]: Analyzing ICFG b.17-alloca.i [2025-02-08 06:16:19,687 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:16:19,689 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG b.17-alloca.i that has 1 procedures, 52 locations, 1 initial locations, 2 loop locations, and 27 error locations. [2025-02-08 06:16:19,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:16:19,724 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;@3c5d05eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:16:19,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-02-08 06:16:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 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-02-08 06:16:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:16:19,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:16:19,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:16:19,735 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 06:16:19,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:16:19,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2783, now seen corresponding path program 1 times [2025-02-08 06:16:19,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:16:19,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748762944] [2025-02-08 06:16:19,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:16:19,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:16:19,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:16:19,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:16:19,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:16:19,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:16:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:16:20,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:16:20,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748762944] [2025-02-08 06:16:20,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748762944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:16:20,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:16:20,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:16:20,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625998406] [2025-02-08 06:16:20,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:16:20,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:16:20,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:16:20,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:16:20,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:16:20,198 INFO L87 Difference]: Start difference. First operand has 52 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-02-08 06:16:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:16:20,270 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2025-02-08 06:16:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:16:20,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2025-02-08 06:16:20,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:16:20,277 INFO L225 Difference]: With dead ends: 48 [2025-02-08 06:16:20,277 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 06:16:20,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:16:20,282 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:16:20,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 23 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:16:20,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 06:16:20,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-08 06:16:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 45 states have internal predecessors, (47), 0 states have call successors, (0), 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-02-08 06:16:20,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2025-02-08 06:16:20,335 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 2 [2025-02-08 06:16:20,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:16:20,335 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2025-02-08 06:16:20,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-02-08 06:16:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2025-02-08 06:16:20,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:16:20,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:16:20,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:16:20,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:16:20,337 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 06:16:20,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:16:20,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2784, now seen corresponding path program 1 times [2025-02-08 06:16:20,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:16:20,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513909152] [2025-02-08 06:16:20,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:16:20,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:16:20,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:16:20,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:16:20,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:16:20,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:16:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:16:20,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:16:20,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513909152] [2025-02-08 06:16:20,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513909152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:16:20,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:16:20,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:16:20,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814221544] [2025-02-08 06:16:20,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:16:20,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:16:20,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:16:20,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:16:20,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:16:20,526 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-02-08 06:16:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:16:20,585 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2025-02-08 06:16:20,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:16:20,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2025-02-08 06:16:20,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:16:20,586 INFO L225 Difference]: With dead ends: 42 [2025-02-08 06:16:20,586 INFO L226 Difference]: Without dead ends: 42 [2025-02-08 06:16:20,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:16:20,587 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:16:20,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 22 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:16:20,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-08 06:16:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-08 06:16:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 41 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:16:20,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2025-02-08 06:16:20,594 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 2 [2025-02-08 06:16:20,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:16:20,595 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2025-02-08 06:16:20,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-02-08 06:16:20,595 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2025-02-08 06:16:20,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:16:20,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:16:20,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:16:20,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:16:20,596 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 06:16:20,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:16:20,597 INFO L85 PathProgramCache]: Analyzing trace with hash 86294, now seen corresponding path program 1 times [2025-02-08 06:16:20,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:16:20,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42228353] [2025-02-08 06:16:20,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:16:20,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:16:20,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:16:20,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:16:20,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:16:20,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:16:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:16:20,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:16:20,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42228353] [2025-02-08 06:16:20,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42228353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:16:20,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:16:20,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:16:20,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930264828] [2025-02-08 06:16:20,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:16:20,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:16:20,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:16:20,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:16:20,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:16:20,703 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-02-08 06:16:20,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:16:20,756 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2025-02-08 06:16:20,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:16:20,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-02-08 06:16:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:16:20,757 INFO L225 Difference]: With dead ends: 38 [2025-02-08 06:16:20,757 INFO L226 Difference]: Without dead ends: 38 [2025-02-08 06:16:20,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:16:20,758 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:16:20,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 16 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:16:20,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-08 06:16:20,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-02-08 06:16:20,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 37 states have internal predecessors, (39), 0 states have call successors, (0), 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-02-08 06:16:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2025-02-08 06:16:20,762 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 3 [2025-02-08 06:16:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:16:20,763 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-02-08 06:16:20,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-02-08 06:16:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2025-02-08 06:16:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:16:20,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:16:20,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:16:20,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:16:20,763 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 06:16:20,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:16:20,767 INFO L85 PathProgramCache]: Analyzing trace with hash 86295, now seen corresponding path program 1 times [2025-02-08 06:16:20,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:16:20,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338247856] [2025-02-08 06:16:20,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:16:20,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:16:20,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:16:20,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:16:20,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:16:20,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:16:20,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:16:20,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:16:20,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338247856] [2025-02-08 06:16:20,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338247856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:16:20,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:16:20,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:16:20,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072511102] [2025-02-08 06:16:20,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:16:20,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:16:20,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:16:20,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:16:20,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:16:20,885 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-02-08 06:16:20,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:16:20,932 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2025-02-08 06:16:20,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:16:20,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-02-08 06:16:20,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:16:20,933 INFO L225 Difference]: With dead ends: 34 [2025-02-08 06:16:20,933 INFO L226 Difference]: Without dead ends: 34 [2025-02-08 06:16:20,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:16:20,934 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:16:20,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 18 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:16:20,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-08 06:16:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-08 06:16:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 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-02-08 06:16:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2025-02-08 06:16:20,937 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 3 [2025-02-08 06:16:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:16:20,937 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2025-02-08 06:16:20,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-02-08 06:16:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2025-02-08 06:16:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:16:20,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:16:20,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:16:20,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:16:20,938 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 06:16:20,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:16:20,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2675132, now seen corresponding path program 1 times [2025-02-08 06:16:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:16:20,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998299499] [2025-02-08 06:16:20,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:16:20,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:16:20,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:16:20,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:16:20,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:16:20,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:16:21,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:16:21,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:16:21,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998299499] [2025-02-08 06:16:21,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998299499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:16:21,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:16:21,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:16:21,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700120134] [2025-02-08 06:16:21,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:16:21,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:16:21,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:16:21,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:16:21,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:16:21,020 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-02-08 06:16:21,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:16:21,060 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2025-02-08 06:16:21,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:16:21,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-02-08 06:16:21,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:16:21,061 INFO L225 Difference]: With dead ends: 31 [2025-02-08 06:16:21,061 INFO L226 Difference]: Without dead ends: 31 [2025-02-08 06:16:21,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:16:21,062 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:16:21,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 13 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:16:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-08 06:16:21,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-08 06:16:21,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.391304347826087) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 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-02-08 06:16:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2025-02-08 06:16:21,064 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 4 [2025-02-08 06:16:21,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:16:21,067 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2025-02-08 06:16:21,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-02-08 06:16:21,067 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2025-02-08 06:16:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:16:21,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:16:21,067 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:16:21,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:16:21,069 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 06:16:21,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:16:21,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2675133, now seen corresponding path program 1 times [2025-02-08 06:16:21,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:16:21,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997786245] [2025-02-08 06:16:21,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:16:21,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:16:21,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:16:21,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:16:21,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:16:21,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:16:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:16:21,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:16:21,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997786245] [2025-02-08 06:16:21,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997786245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:16:21,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:16:21,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:16:21,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718340238] [2025-02-08 06:16:21,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:16:21,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:16:21,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:16:21,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:16:21,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:16:21,159 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-02-08 06:16:21,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:16:21,189 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2025-02-08 06:16:21,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:16:21,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-02-08 06:16:21,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:16:21,190 INFO L225 Difference]: With dead ends: 28 [2025-02-08 06:16:21,190 INFO L226 Difference]: Without dead ends: 28 [2025-02-08 06:16:21,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:16:21,191 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:16:21,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 15 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:16:21,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-08 06:16:21,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-08 06:16:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:16:21,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2025-02-08 06:16:21,196 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 4 [2025-02-08 06:16:21,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:16:21,197 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2025-02-08 06:16:21,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-02-08 06:16:21,197 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2025-02-08 06:16:21,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:16:21,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:16:21,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:16:21,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:16:21,198 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 06:16:21,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:16:21,198 INFO L85 PathProgramCache]: Analyzing trace with hash 82929107, now seen corresponding path program 1 times [2025-02-08 06:16:21,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:16:21,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074465977] [2025-02-08 06:16:21,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:16:21,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:16:21,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:16:21,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:16:21,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:16:21,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:16:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:16:21,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:16:21,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074465977] [2025-02-08 06:16:21,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074465977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:16:21,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:16:21,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:16:21,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116322386] [2025-02-08 06:16:21,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:16:21,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:16:21,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:16:21,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:16:21,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:16:21,239 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:16:21,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:16:21,270 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2025-02-08 06:16:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:16:21,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:16:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:16:21,270 INFO L225 Difference]: With dead ends: 26 [2025-02-08 06:16:21,270 INFO L226 Difference]: Without dead ends: 26 [2025-02-08 06:16:21,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:16:21,271 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:16:21,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 12 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:16:21,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-08 06:16:21,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-08 06:16:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 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-02-08 06:16:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2025-02-08 06:16:21,276 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 5 [2025-02-08 06:16:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:16:21,276 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-02-08 06:16:21,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:16:21,276 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2025-02-08 06:16:21,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:16:21,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:16:21,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:16:21,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:16:21,276 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 06:16:21,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:16:21,277 INFO L85 PathProgramCache]: Analyzing trace with hash 82929108, now seen corresponding path program 1 times [2025-02-08 06:16:21,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:16:21,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705166946] [2025-02-08 06:16:21,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:16:21,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:16:21,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:16:21,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:16:21,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:16:21,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:16:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:16:21,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:16:21,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705166946] [2025-02-08 06:16:21,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705166946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:16:21,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:16:21,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:16:21,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216641892] [2025-02-08 06:16:21,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:16:21,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:16:21,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:16:21,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:16:21,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:16:21,349 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:16:21,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:16:21,374 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2025-02-08 06:16:21,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:16:21,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:16:21,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:16:21,375 INFO L225 Difference]: With dead ends: 24 [2025-02-08 06:16:21,375 INFO L226 Difference]: Without dead ends: 24 [2025-02-08 06:16:21,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:16:21,376 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:16:21,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 14 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:16:21,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-08 06:16:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-08 06:16:21,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 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-02-08 06:16:21,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2025-02-08 06:16:21,378 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 5 [2025-02-08 06:16:21,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:16:21,378 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2025-02-08 06:16:21,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:16:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2025-02-08 06:16:21,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:16:21,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:16:21,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:16:21,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:16:21,380 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-08 06:16:21,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:16:21,380 INFO L85 PathProgramCache]: Analyzing trace with hash 466459210, now seen corresponding path program 1 times [2025-02-08 06:16:21,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:16:21,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909956544] [2025-02-08 06:16:21,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:16:21,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:16:21,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:16:21,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:16:21,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:16:21,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:16:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:16:22,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:16:22,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909956544] [2025-02-08 06:16:22,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909956544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:16:22,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:16:22,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:16:22,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987257009] [2025-02-08 06:16:22,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:16:22,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:16:22,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:16:22,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:16:22,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:16:22,014 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-02-08 06:16:22,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:16:22,061 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-02-08 06:16:22,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:16:22,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-02-08 06:16:22,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:16:22,061 INFO L225 Difference]: With dead ends: 23 [2025-02-08 06:16:22,061 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 06:16:22,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:16:22,062 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 46 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:16:22,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 18 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:16:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 06:16:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 06:16:22,063 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-02-08 06:16:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 06:16:22,063 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2025-02-08 06:16:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:16:22,063 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 06:16:22,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-02-08 06:16:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 06:16:22,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 06:16:22,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (26 of 27 remaining) [2025-02-08 06:16:22,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 27 remaining) [2025-02-08 06:16:22,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 27 remaining) [2025-02-08 06:16:22,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 27 remaining) [2025-02-08 06:16:22,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 27 remaining) [2025-02-08 06:16:22,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 27 remaining) [2025-02-08 06:16:22,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 27 remaining) [2025-02-08 06:16:22,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 27 remaining) [2025-02-08 06:16:22,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 27 remaining) [2025-02-08 06:16:22,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 27 remaining) [2025-02-08 06:16:22,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 27 remaining) [2025-02-08 06:16:22,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 27 remaining) [2025-02-08 06:16:22,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 27 remaining) [2025-02-08 06:16:22,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 27 remaining) [2025-02-08 06:16:22,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 27 remaining) [2025-02-08 06:16:22,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 27 remaining) [2025-02-08 06:16:22,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 27 remaining) [2025-02-08 06:16:22,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 27 remaining) [2025-02-08 06:16:22,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 27 remaining) [2025-02-08 06:16:22,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 27 remaining) [2025-02-08 06:16:22,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 27 remaining) [2025-02-08 06:16:22,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 27 remaining) [2025-02-08 06:16:22,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 27 remaining) [2025-02-08 06:16:22,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 27 remaining) [2025-02-08 06:16:22,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 27 remaining) [2025-02-08 06:16:22,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 27 remaining) [2025-02-08 06:16:22,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 27 remaining) [2025-02-08 06:16:22,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:16:22,070 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:16:22,073 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:16:22,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:16:22 BoogieIcfgContainer [2025-02-08 06:16:22,078 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:16:22,078 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:16:22,078 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:16:22,079 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:16:22,079 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:16:19" (3/4) ... [2025-02-08 06:16:22,081 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 06:16:22,089 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-08 06:16:22,090 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 06:16:22,090 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 06:16:22,090 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 06:16:22,167 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:16:22,167 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:16:22,167 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:16:22,168 INFO L158 Benchmark]: Toolchain (without parser) took 3367.34ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 90.7MB in the end (delta: 13.8MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2025-02-08 06:16:22,168 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:16:22,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.77ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 88.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:16:22,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.82ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 86.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:16:22,169 INFO L158 Benchmark]: Boogie Preprocessor took 40.44ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 85.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:16:22,169 INFO L158 Benchmark]: IcfgBuilder took 400.91ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 67.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:16:22,169 INFO L158 Benchmark]: TraceAbstraction took 2409.34ms. Allocated memory is still 142.6MB. Free memory was 67.8MB in the beginning and 97.6MB in the end (delta: -29.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:16:22,169 INFO L158 Benchmark]: Witness Printer took 88.63ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 90.7MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:16:22,171 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.34ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.77ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 88.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.82ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 86.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.44ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 85.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 400.91ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 67.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2409.34ms. Allocated memory is still 142.6MB. Free memory was 67.8MB in the beginning and 97.6MB in the end (delta: -29.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 88.63ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 90.7MB in the end (delta: 7.0MB). 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: 565]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 27 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 267 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 267 mSDsluCounter, 151 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 216 IncrementalHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 137 mSDtfsCounter, 216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 627 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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 27 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 06:16:22,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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