./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/scopes3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/scopes3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f8b4bb9a8f404cd020a4d6119f922da096d098a1547934faf4c16f394bfab92c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:40:57,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:40:57,683 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:40:57,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:40:57,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:40:57,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:40:57,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:40:57,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:40:57,714 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:40:57,715 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:40:57,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:40:57,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:40:57,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:40:57,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:40:57,716 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:40:57,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:40:57,717 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:40:57,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:40:57,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:40:57,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:40:57,717 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:40:57,717 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:40:57,717 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:40:57,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:40:57,717 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:40:57,717 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:40:57,717 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:40:57,717 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:40:57,718 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:40:57,718 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:40:57,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:40:57,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:40:57,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:40:57,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:40:57,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:40:57,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:40:57,719 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:40:57,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:40:57,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:40:57,719 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:40:57,719 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:40:57,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:40:57,720 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f8b4bb9a8f404cd020a4d6119f922da096d098a1547934faf4c16f394bfab92c [2025-03-04 07:40:57,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:40:57,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:40:57,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:40:57,944 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:40:57,944 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:40:57,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/scopes3.c [2025-03-04 07:40:59,038 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf221bfda/8823f4de8fb0402fb9557ff4d52f4314/FLAG5fcb7e3c0 [2025-03-04 07:40:59,262 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:40:59,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/scopes3.c [2025-03-04 07:40:59,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf221bfda/8823f4de8fb0402fb9557ff4d52f4314/FLAG5fcb7e3c0 [2025-03-04 07:40:59,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf221bfda/8823f4de8fb0402fb9557ff4d52f4314 [2025-03-04 07:40:59,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:40:59,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:40:59,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:40:59,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:40:59,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:40:59,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:40:59" (1/1) ... [2025-03-04 07:40:59,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b5fcf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:59, skipping insertion in model container [2025-03-04 07:40:59,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:40:59" (1/1) ... [2025-03-04 07:40:59,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:40:59,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:40:59,715 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:40:59,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:40:59,730 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:40:59,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:59 WrapperNode [2025-03-04 07:40:59,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:40:59,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:40:59,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:40:59,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:40:59,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:59" (1/1) ... [2025-03-04 07:40:59,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:59" (1/1) ... [2025-03-04 07:40:59,747 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2025-03-04 07:40:59,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:40:59,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:40:59,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:40:59,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:40:59,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:59" (1/1) ... [2025-03-04 07:40:59,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:59" (1/1) ... [2025-03-04 07:40:59,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:59" (1/1) ... [2025-03-04 07:40:59,763 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-03-04 07:40:59,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:59" (1/1) ... [2025-03-04 07:40:59,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:59" (1/1) ... [2025-03-04 07:40:59,767 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:59" (1/1) ... [2025-03-04 07:40:59,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:59" (1/1) ... [2025-03-04 07:40:59,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:59" (1/1) ... [2025-03-04 07:40:59,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:59" (1/1) ... [2025-03-04 07:40:59,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:40:59,770 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:40:59,770 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:40:59,770 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:40:59,771 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:59" (1/1) ... [2025-03-04 07:40:59,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:40:59,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:59,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:40:59,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:40:59,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:40:59,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:40:59,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:40:59,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:40:59,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:40:59,865 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:40:59,867 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:40:59,971 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-04 07:40:59,971 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:40:59,981 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:40:59,982 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:40:59,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:40:59 BoogieIcfgContainer [2025-03-04 07:40:59,983 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:40:59,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:40:59,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:40:59,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:40:59,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:40:59" (1/3) ... [2025-03-04 07:40:59,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aac8893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:40:59, skipping insertion in model container [2025-03-04 07:40:59,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:40:59" (2/3) ... [2025-03-04 07:40:59,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aac8893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:40:59, skipping insertion in model container [2025-03-04 07:40:59,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:40:59" (3/3) ... [2025-03-04 07:40:59,991 INFO L128 eAbstractionObserver]: Analyzing ICFG scopes3.c [2025-03-04 07:41:00,003 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:41:00,005 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG scopes3.c that has 1 procedures, 15 locations, 1 initial locations, 1 loop locations, and 5 error locations. [2025-03-04 07:41:00,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:41:00,050 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;@4f713a6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:41:00,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 07:41:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:00,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:41:00,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:00,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:41:00,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-04 07:41:00,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:00,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1353310, now seen corresponding path program 1 times [2025-03-04 07:41:00,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:00,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735437952] [2025-03-04 07:41:00,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:00,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:00,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:41:00,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:41:00,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:00,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:00,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:00,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735437952] [2025-03-04 07:41:00,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735437952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:00,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:00,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:00,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838640290] [2025-03-04 07:41:00,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:00,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:00,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:00,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:00,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:00,219 INFO L87 Difference]: Start difference. First operand has 15 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:00,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:00,244 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2025-03-04 07:41:00,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:00,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 07:41:00,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:00,252 INFO L225 Difference]: With dead ends: 20 [2025-03-04 07:41:00,252 INFO L226 Difference]: Without dead ends: 18 [2025-03-04 07:41:00,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:00,256 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:00,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 23 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-04 07:41:00,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2025-03-04 07:41:00,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:00,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-04 07:41:00,274 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 4 [2025-03-04 07:41:00,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:00,275 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-04 07:41:00,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:00,275 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-04 07:41:00,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:41:00,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:00,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:41:00,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:41:00,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-04 07:41:00,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:00,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1353470, now seen corresponding path program 1 times [2025-03-04 07:41:00,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:00,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522285434] [2025-03-04 07:41:00,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:00,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:00,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:41:00,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:41:00,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:00,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:00,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:00,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522285434] [2025-03-04 07:41:00,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522285434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:00,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:00,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:41:00,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375847081] [2025-03-04 07:41:00,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:00,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:00,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:00,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:00,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:00,330 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:00,345 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-03-04 07:41:00,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:00,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 07:41:00,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:00,346 INFO L225 Difference]: With dead ends: 13 [2025-03-04 07:41:00,346 INFO L226 Difference]: Without dead ends: 13 [2025-03-04 07:41:00,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:00,347 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:00,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 11 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:00,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-04 07:41:00,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-04 07:41:00,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 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-03-04 07:41:00,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-03-04 07:41:00,349 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 4 [2025-03-04 07:41:00,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:00,349 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-03-04 07:41:00,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:00,349 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2025-03-04 07:41:00,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:41:00,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:00,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:41:00,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:41:00,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-04 07:41:00,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:00,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1353471, now seen corresponding path program 1 times [2025-03-04 07:41:00,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:00,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71029099] [2025-03-04 07:41:00,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:00,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:00,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:41:00,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:41:00,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:00,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:00,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:00,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71029099] [2025-03-04 07:41:00,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71029099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:00,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:00,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:41:00,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140834594] [2025-03-04 07:41:00,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:00,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:00,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:00,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:00,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:00,440 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:00,450 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2025-03-04 07:41:00,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:00,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 07:41:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:00,452 INFO L225 Difference]: With dead ends: 11 [2025-03-04 07:41:00,452 INFO L226 Difference]: Without dead ends: 11 [2025-03-04 07:41:00,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:00,453 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:00,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 10 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:00,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-04 07:41:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-04 07:41:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-03-04 07:41:00,457 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 4 [2025-03-04 07:41:00,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:00,457 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-03-04 07:41:00,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:00,457 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-03-04 07:41:00,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:41:00,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:00,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:00,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:41:00,458 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-04 07:41:00,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:00,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1666497225, now seen corresponding path program 1 times [2025-03-04 07:41:00,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:00,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935814735] [2025-03-04 07:41:00,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:00,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:00,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:41:00,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:41:00,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:00,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:00,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:00,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935814735] [2025-03-04 07:41:00,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935814735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:00,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145115701] [2025-03-04 07:41:00,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:00,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:00,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:00,506 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:00,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:41:00,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:41:00,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:41:00,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:00,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:00,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:41:00,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:00,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:00,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145115701] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:00,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:00,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 07:41:00,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645695561] [2025-03-04 07:41:00,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:00,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:41:00,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:00,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:41:00,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:41:00,616 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:00,647 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2025-03-04 07:41:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:41:00,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:41:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:00,649 INFO L225 Difference]: With dead ends: 20 [2025-03-04 07:41:00,649 INFO L226 Difference]: Without dead ends: 20 [2025-03-04 07:41:00,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:41:00,650 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:00,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 27 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:00,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-04 07:41:00,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-04 07:41:00,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2025-03-04 07:41:00,653 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 7 [2025-03-04 07:41:00,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:00,656 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2025-03-04 07:41:00,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:00,656 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2025-03-04 07:41:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:41:00,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:00,657 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1] [2025-03-04 07:41:00,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:41:00,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:00,858 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-04 07:41:00,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:00,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1774278302, now seen corresponding path program 2 times [2025-03-04 07:41:00,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:00,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33945114] [2025-03-04 07:41:00,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:00,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:00,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 07:41:00,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:41:00,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:00,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:01,023 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:01,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:01,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33945114] [2025-03-04 07:41:01,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33945114] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:01,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610387161] [2025-03-04 07:41:01,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:01,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:01,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:01,025 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:01,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:41:01,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 07:41:01,089 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:41:01,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:01,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:01,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:41:01,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:01,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:01,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610387161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:01,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:01,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 07:41:01,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272384111] [2025-03-04 07:41:01,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:01,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:41:01,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:01,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:41:01,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:41:01,205 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:01,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:01,241 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2025-03-04 07:41:01,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:41:01,242 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 07:41:01,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:01,243 INFO L225 Difference]: With dead ends: 38 [2025-03-04 07:41:01,243 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 07:41:01,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:41:01,243 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:01,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 27 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:01,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 07:41:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 07:41:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2025-03-04 07:41:01,246 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 16 [2025-03-04 07:41:01,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:01,246 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2025-03-04 07:41:01,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:01,247 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2025-03-04 07:41:01,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 07:41:01,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:01,247 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1] [2025-03-04 07:41:01,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:41:01,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:01,449 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-04 07:41:01,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:01,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1597150466, now seen corresponding path program 3 times [2025-03-04 07:41:01,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:01,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320643391] [2025-03-04 07:41:01,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:41:01,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:01,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 11 equivalence classes. [2025-03-04 07:41:01,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:41:01,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 07:41:01,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:41:01,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:41:01,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:41:01,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:41:01,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:01,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:41:01,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:41:01,567 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:41:01,567 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 5 remaining) [2025-03-04 07:41:01,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-03-04 07:41:01,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2025-03-04 07:41:01,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2025-03-04 07:41:01,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2025-03-04 07:41:01,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:41:01,571 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-03-04 07:41:01,589 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:41:01,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:41:01 BoogieIcfgContainer [2025-03-04 07:41:01,593 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:41:01,593 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:41:01,593 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:41:01,593 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:41:01,594 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:40:59" (3/4) ... [2025-03-04 07:41:01,594 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 07:41:01,631 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-03-04 07:41:01,671 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 07:41:01,671 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 07:41:01,671 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:41:01,672 INFO L158 Benchmark]: Toolchain (without parser) took 2059.99ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 63.0MB in the end (delta: 42.2MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2025-03-04 07:41:01,672 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory was 125.4MB in the beginning and 125.1MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:41:01,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 117.91ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 94.9MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:41:01,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.58ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 93.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:41:01,672 INFO L158 Benchmark]: Boogie Preprocessor took 18.71ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 93.2MB in the end (delta: 512.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:41:01,672 INFO L158 Benchmark]: IcfgBuilder took 212.78ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 81.5MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:41:01,673 INFO L158 Benchmark]: TraceAbstraction took 1608.61ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 69.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2025-03-04 07:41:01,673 INFO L158 Benchmark]: Witness Printer took 77.74ms. Allocated memory is still 142.6MB. Free memory was 69.1MB in the beginning and 63.0MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:41:01,674 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.14ms. Allocated memory is still 201.3MB. Free memory was 125.4MB in the beginning and 125.1MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 117.91ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 94.9MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.58ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 93.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.71ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 93.2MB in the end (delta: 512.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 212.78ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 81.5MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1608.61ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 69.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Witness Printer took 77.74ms. Allocated memory is still 142.6MB. Free memory was 69.1MB in the beginning and 63.0MB in the end (delta: 6.1MB). 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 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L2] int* p; [L3] int i = 0; VAL [i=0] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=0, p={3:0}] [L6] p[0] = 1 [L3] i++ VAL [i=1, p={3:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=1, p={4:0}] [L6] p[0] = 1 [L3] i++ VAL [i=2, p={4:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=2, p={5:0}] [L6] p[0] = 1 [L3] i++ VAL [i=3, p={5:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=3, p={6:0}] [L6] p[0] = 1 [L3] i++ VAL [i=4, p={6:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=4, p={7:0}] [L6] p[0] = 1 [L3] i++ VAL [i=5, p={7:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=5, p={8:0}] [L6] p[0] = 1 [L3] i++ VAL [i=6, p={8:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=6, p={9:0}] [L6] p[0] = 1 [L3] i++ VAL [i=7, p={9:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=7, p={10:0}] [L6] p[0] = 1 [L3] i++ VAL [i=8, p={10:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=8, p={11:0}] [L6] p[0] = 1 [L3] i++ VAL [i=9, p={11:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=9, p={2:0}] [L6] p[0] = 1 [L3] i++ VAL [i=10, p={2:0}] [L3] COND FALSE !(i < 10) [L8] p[0] = 2 - UnprovableResult [Line: 1]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 45 mSDtfsCounter, 61 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 170 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 0/69 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-04 07:41:01,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)