./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-ext3-properties/sll_shallow_copy-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_shallow_copy-2.i -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 6b0035e4df062aac8021cee981905a3c98f2d4e312e33b913ded157af60b9640 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:38:30,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:38:30,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:38:30,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:38:30,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:38:30,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:38:30,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:38:30,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:38:30,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:38:30,977 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:38:30,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:38:30,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:38:30,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:38:30,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:38:30,979 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:38:30,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:38:30,980 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:38:30,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:38:30,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:38:30,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:38:30,981 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:38:30,981 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:38:30,981 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:38:30,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:38:30,981 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:38:30,981 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:38:30,981 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:38:30,981 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:38:30,981 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:38:30,981 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:38:30,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:38:30,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:38:30,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:38:30,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:38:30,982 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:38:30,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:38:30,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:38:30,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:38:30,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:38:30,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:38:30,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:38:30,982 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:38:30,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:38:30,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:38:30,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:38:30,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:38:30,982 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 -> 6b0035e4df062aac8021cee981905a3c98f2d4e312e33b913ded157af60b9640 [2025-04-30 10:38:31,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:38:31,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:38:31,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:38:31,191 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:38:31,191 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:38:31,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_shallow_copy-2.i [2025-04-30 10:38:32,480 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875817a1d/b9a79d6ee2f541a3977e190a0320da44/FLAG3fa4fa55c [2025-04-30 10:38:32,753 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:38:32,753 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_shallow_copy-2.i [2025-04-30 10:38:32,767 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875817a1d/b9a79d6ee2f541a3977e190a0320da44/FLAG3fa4fa55c [2025-04-30 10:38:33,481 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875817a1d/b9a79d6ee2f541a3977e190a0320da44 [2025-04-30 10:38:33,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:38:33,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:38:33,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:38:33,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:38:33,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:38:33,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:38:33" (1/1) ... [2025-04-30 10:38:33,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bec9814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:33, skipping insertion in model container [2025-04-30 10:38:33,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:38:33" (1/1) ... [2025-04-30 10:38:33,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:38:33,767 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-30 10:38:33,779 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:38:33,785 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:38:33,833 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:38:33,854 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:38:33,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:33 WrapperNode [2025-04-30 10:38:33,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:38:33,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:38:33,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:38:33,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:38:33,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:33" (1/1) ... [2025-04-30 10:38:33,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:33" (1/1) ... [2025-04-30 10:38:33,885 INFO L138 Inliner]: procedures = 114, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2025-04-30 10:38:33,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:38:33,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:38:33,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:38:33,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:38:33,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:33" (1/1) ... [2025-04-30 10:38:33,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:33" (1/1) ... [2025-04-30 10:38:33,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:33" (1/1) ... [2025-04-30 10:38:33,904 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 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-04-30 10:38:33,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:33" (1/1) ... [2025-04-30 10:38:33,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:33" (1/1) ... [2025-04-30 10:38:33,909 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:33" (1/1) ... [2025-04-30 10:38:33,909 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:33" (1/1) ... [2025-04-30 10:38:33,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:33" (1/1) ... [2025-04-30 10:38:33,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:33" (1/1) ... [2025-04-30 10:38:33,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:33" (1/1) ... [2025-04-30 10:38:33,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:38:33,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:38:33,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:38:33,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:38:33,918 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:33" (1/1) ... [2025-04-30 10:38:33,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:38:33,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:33,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:38:33,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:38:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_node [2025-04-30 10:38:33,966 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_node [2025-04-30 10:38:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:38:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:38:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:38:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:38:33,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:38:33,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:38:34,046 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:38:34,048 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:38:34,153 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-04-30 10:38:34,153 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:38:34,163 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:38:34,163 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:38:34,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:38:34 BoogieIcfgContainer [2025-04-30 10:38:34,164 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:38:34,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:38:34,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:38:34,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:38:34,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:38:33" (1/3) ... [2025-04-30 10:38:34,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:38:34, skipping insertion in model container [2025-04-30 10:38:34,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:33" (2/3) ... [2025-04-30 10:38:34,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:38:34, skipping insertion in model container [2025-04-30 10:38:34,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:38:34" (3/3) ... [2025-04-30 10:38:34,171 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_shallow_copy-2.i [2025-04-30 10:38:34,183 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:38:34,185 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_shallow_copy-2.i that has 2 procedures, 35 locations, 38 edges, 1 initial locations, 0 loop locations, and 12 error locations. [2025-04-30 10:38:34,217 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:38:34,227 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4b17df12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:38:34,228 INFO L341 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-04-30 10:38:34,232 INFO L278 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:34,236 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:38:34,236 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:34,237 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:34,237 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-04-30 10:38:34,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:34,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1794625018, now seen corresponding path program 1 times [2025-04-30 10:38:34,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:34,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012488442] [2025-04-30 10:38:34,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:34,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:34,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:38:34,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:38:34,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:34,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:34,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:34,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012488442] [2025-04-30 10:38:34,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012488442] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:34,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967589203] [2025-04-30 10:38:34,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:34,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:34,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:34,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:34,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:38:34,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:38:34,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:38:34,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:34,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:34,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-30 10:38:34,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:34,784 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:38:34,825 WARN L871 $PredicateComparison]: unable to prove that (exists ((|alloc_node_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |alloc_node_~temp~0#1.base| (select |c_#valid| |alloc_node_~temp~0#1.base|))) (= (select |c_old(#valid)| |alloc_node_~temp~0#1.base|) 0))) is different from true [2025-04-30 10:38:34,897 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:38:34,897 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-30 10:38:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-04-30 10:38:34,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:34,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967589203] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:34,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:38:34,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2025-04-30 10:38:34,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358491233] [2025-04-30 10:38:34,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:34,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:38:34,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:34,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:38:34,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=71, Unknown=1, NotChecked=16, Total=110 [2025-04-30 10:38:34,988 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:38:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:35,205 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2025-04-30 10:38:35,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:38:35,206 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 16 [2025-04-30 10:38:35,207 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:35,210 INFO L225 Difference]: With dead ends: 31 [2025-04-30 10:38:35,210 INFO L226 Difference]: Without dead ends: 28 [2025-04-30 10:38:35,211 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2025-04-30 10:38:35,213 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:35,213 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 61 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 28 Unchecked, 0.1s Time] [2025-04-30 10:38:35,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-30 10:38:35,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-04-30 10:38:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 24 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2025-04-30 10:38:35,239 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 16 [2025-04-30 10:38:35,240 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:35,240 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2025-04-30 10:38:35,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:38:35,240 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2025-04-30 10:38:35,240 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:38:35,241 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:35,241 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:35,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:38:35,442 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-04-30 10:38:35,443 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-04-30 10:38:35,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:35,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1794625017, now seen corresponding path program 1 times [2025-04-30 10:38:35,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:35,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709765760] [2025-04-30 10:38:35,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:35,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:35,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:38:35,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:38:35,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:35,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:35,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:35,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:35,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709765760] [2025-04-30 10:38:35,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709765760] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:35,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366772175] [2025-04-30 10:38:35,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:35,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:35,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:35,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:35,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:38:35,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:38:35,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:38:35,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:35,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:35,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-30 10:38:35,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:35,822 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-30 10:38:35,978 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-30 10:38:35,979 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-30 10:38:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:36,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:40,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366772175] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:40,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:40,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2025-04-30 10:38:40,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354446589] [2025-04-30 10:38:40,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:40,238 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:38:40,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:40,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:38:40,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:38:40,239 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:38:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:40,408 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2025-04-30 10:38:40,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:38:40,408 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 16 [2025-04-30 10:38:40,408 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:40,409 INFO L225 Difference]: With dead ends: 25 [2025-04-30 10:38:40,409 INFO L226 Difference]: Without dead ends: 25 [2025-04-30 10:38:40,410 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:38:40,410 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:40,411 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 81 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:38:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-04-30 10:38:40,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-04-30 10:38:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2025-04-30 10:38:40,415 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 16 [2025-04-30 10:38:40,415 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:40,415 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2025-04-30 10:38:40,415 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-04-30 10:38:40,415 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2025-04-30 10:38:40,416 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:38:40,416 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:40,416 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:40,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:38:40,616 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-04-30 10:38:40,616 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-04-30 10:38:40,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:40,617 INFO L85 PathProgramCache]: Analyzing trace with hash 78968552, now seen corresponding path program 1 times [2025-04-30 10:38:40,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:40,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832478573] [2025-04-30 10:38:40,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:40,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:40,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:38:40,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:38:40,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:40,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:38:40,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:40,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832478573] [2025-04-30 10:38:40,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832478573] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:40,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:40,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:38:40,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661995294] [2025-04-30 10:38:40,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:40,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:38:40,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:40,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:38:40,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:38:40,719 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:38:40,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:40,777 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2025-04-30 10:38:40,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:38:40,777 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-04-30 10:38:40,778 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:40,778 INFO L225 Difference]: With dead ends: 23 [2025-04-30 10:38:40,778 INFO L226 Difference]: Without dead ends: 23 [2025-04-30 10:38:40,778 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:38:40,778 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:40,779 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:40,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-04-30 10:38:40,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-04-30 10:38:40,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:40,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2025-04-30 10:38:40,781 INFO L79 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2025-04-30 10:38:40,781 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:40,781 INFO L485 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2025-04-30 10:38:40,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:38:40,781 INFO L278 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2025-04-30 10:38:40,781 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:38:40,782 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:40,782 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:40,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:38:40,782 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-04-30 10:38:40,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:40,782 INFO L85 PathProgramCache]: Analyzing trace with hash 78968553, now seen corresponding path program 1 times [2025-04-30 10:38:40,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:40,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284052302] [2025-04-30 10:38:40,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:40,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:40,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:38:40,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:38:40,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:40,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:40,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:38:40,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:40,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284052302] [2025-04-30 10:38:40,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284052302] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:38:40,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:38:40,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:38:40,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386614970] [2025-04-30 10:38:40,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:38:40,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:38:40,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:40,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:38:40,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:38:40,930 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:38:40,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:40,984 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2025-04-30 10:38:40,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:38:40,985 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-04-30 10:38:40,985 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:40,985 INFO L225 Difference]: With dead ends: 22 [2025-04-30 10:38:40,985 INFO L226 Difference]: Without dead ends: 22 [2025-04-30 10:38:40,985 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:38:40,986 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:40,986 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:40,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-04-30 10:38:40,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-04-30 10:38:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2025-04-30 10:38:40,988 INFO L79 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2025-04-30 10:38:40,988 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:40,988 INFO L485 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2025-04-30 10:38:40,988 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:38:40,988 INFO L278 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2025-04-30 10:38:40,990 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:38:40,991 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:40,991 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:40,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:38:40,991 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-04-30 10:38:40,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:40,992 INFO L85 PathProgramCache]: Analyzing trace with hash 570997579, now seen corresponding path program 1 times [2025-04-30 10:38:40,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:40,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122598373] [2025-04-30 10:38:40,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:40,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:40,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:38:41,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:38:41,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:41,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:41,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:38:41,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:38:41,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122598373] [2025-04-30 10:38:41,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122598373] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:41,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766923832] [2025-04-30 10:38:41,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:41,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:41,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:41,080 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:41,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:38:41,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:38:41,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:38:41,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:41,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:41,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:38:41,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:38:41,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:38:41,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766923832] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:41,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:38:41,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-30 10:38:41,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094856535] [2025-04-30 10:38:41,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:41,234 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:38:41,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:38:41,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:38:41,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:38:41,235 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:41,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:41,268 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2025-04-30 10:38:41,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:38:41,268 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-04-30 10:38:41,268 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:41,269 INFO L225 Difference]: With dead ends: 21 [2025-04-30 10:38:41,269 INFO L226 Difference]: Without dead ends: 21 [2025-04-30 10:38:41,269 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:38:41,269 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:41,270 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:38:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-04-30 10:38:41,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-04-30 10:38:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2025-04-30 10:38:41,272 INFO L79 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 23 [2025-04-30 10:38:41,272 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:41,272 INFO L485 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2025-04-30 10:38:41,272 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:41,272 INFO L278 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2025-04-30 10:38:41,272 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:38:41,272 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:41,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:41,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:38:41,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:41,473 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-04-30 10:38:41,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1027138706, now seen corresponding path program 1 times [2025-04-30 10:38:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:38:41,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326194646] [2025-04-30 10:38:41,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:38:41,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:38:41,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:38:41,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:41,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:38:41,485 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:38:41,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:38:41,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:38:41,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:41,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:38:41,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:38:41,505 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:38:41,505 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (11 of 12 remaining) [2025-04-30 10:38:41,506 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2025-04-30 10:38:41,506 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2025-04-30 10:38:41,506 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2025-04-30 10:38:41,507 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2025-04-30 10:38:41,507 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2025-04-30 10:38:41,507 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2025-04-30 10:38:41,507 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2025-04-30 10:38:41,507 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 12 remaining) [2025-04-30 10:38:41,507 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (2 of 12 remaining) [2025-04-30 10:38:41,507 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (1 of 12 remaining) [2025-04-30 10:38:41,507 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (0 of 12 remaining) [2025-04-30 10:38:41,507 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:38:41,509 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-30 10:38:41,528 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:38:41,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:38:41 BoogieIcfgContainer [2025-04-30 10:38:41,532 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:38:41,532 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:38:41,532 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:38:41,533 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:38:41,533 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:38:34" (3/4) ... [2025-04-30 10:38:41,535 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-30 10:38:41,535 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:38:41,536 INFO L158 Benchmark]: Toolchain (without parser) took 8051.21ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 100.1MB in the end (delta: 23.9MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2025-04-30 10:38:41,536 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:38:41,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.00ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 104.5MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:38:41,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.26ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 102.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:38:41,537 INFO L158 Benchmark]: Boogie Preprocessor took 30.43ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 101.3MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:38:41,537 INFO L158 Benchmark]: RCFGBuilder took 246.97ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 88.3MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:38:41,537 INFO L158 Benchmark]: TraceAbstraction took 7366.45ms. Allocated memory is still 167.8MB. Free memory was 87.7MB in the beginning and 100.2MB in the end (delta: -12.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:38:41,538 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 100.1MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:38:41,539 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.23ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.00ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 104.5MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.26ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 102.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.43ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 101.3MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 246.97ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 88.3MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7366.45ms. Allocated memory is still 167.8MB. Free memory was 87.7MB in the beginning and 100.2MB in the end (delta: -12.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 100.1MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 568]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 568. Possible FailurePath: [L569] CALL, EXPR alloc_node() [L562] struct node* temp = (struct node*) malloc(sizeof(struct node)); [L563] COND FALSE !(((void *)0) == temp) VAL [temp={-2:0}] [L566] return temp; VAL [\result={-2:0}] [L569] RET, EXPR alloc_node() [L569] struct node* s = alloc_node(); [L570] CALL, EXPR alloc_node() [L562] struct node* temp = (struct node*) malloc(sizeof(struct node)); [L563] COND FALSE !(((void *)0) == temp) VAL [temp={-1:0}] [L566] return temp; VAL [\result={-1:0}] [L570] RET, EXPR alloc_node() VAL [s={-2:0}] [L570] s->next = alloc_node() [L571] EXPR s->next [L571] *s = *(s->next) [L571] *s = *(s->next) [L572] free(s) [L572] free(s) [L572] free(s) [L573] return 0; VAL [\result=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 38 edges, 12 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 301 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 28 IncrementalHoareTripleChecker+Unchecked, 230 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 458 IncrementalHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 71 mSDtfsCounter, 458 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 80 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 37, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 177 ConstructedInterpolants, 13 QuantifiedInterpolants, 1050 SizeOfPredicates, 2 NumberOfNonLiveVariables, 239 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 18/50 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-30 10:38:41,559 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_shallow_copy-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b0035e4df062aac8021cee981905a3c98f2d4e312e33b913ded157af60b9640 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:38:43,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:38:43,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-04-30 10:38:43,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:38:43,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:38:43,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:38:43,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:38:43,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:38:43,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:38:43,515 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:38:43,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:38:43,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:38:43,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:38:43,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:38:43,515 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:38:43,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:38:43,515 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:38:43,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:38:43,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:38:43,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:38:43,515 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:38:43,515 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:38:43,515 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:38:43,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:38:43,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:38:43,516 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-30 10:38:43,516 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-30 10:38:43,516 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:38:43,516 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:38:43,516 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:38:43,516 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:38:43,516 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:38:43,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:38:43,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:38:43,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:38:43,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:38:43,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:38:43,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:38:43,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:38:43,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:38:43,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:38:43,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:38:43,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:38:43,516 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-30 10:38:43,517 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-30 10:38:43,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:38:43,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:38:43,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:38:43,517 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 -> 6b0035e4df062aac8021cee981905a3c98f2d4e312e33b913ded157af60b9640 [2025-04-30 10:38:43,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:38:43,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:38:43,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:38:43,749 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:38:43,749 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:38:43,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_shallow_copy-2.i [2025-04-30 10:38:45,062 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdaab38e0/78f2e1f0ce7c432fa693fd4ca1e68d4d/FLAGaaf03877c [2025-04-30 10:38:45,262 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:38:45,262 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_shallow_copy-2.i [2025-04-30 10:38:45,276 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdaab38e0/78f2e1f0ce7c432fa693fd4ca1e68d4d/FLAGaaf03877c [2025-04-30 10:38:46,112 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdaab38e0/78f2e1f0ce7c432fa693fd4ca1e68d4d [2025-04-30 10:38:46,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:38:46,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:38:46,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:38:46,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:38:46,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:38:46,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:38:46" (1/1) ... [2025-04-30 10:38:46,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ad1b1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:46, skipping insertion in model container [2025-04-30 10:38:46,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:38:46" (1/1) ... [2025-04-30 10:38:46,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:38:46,345 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-30 10:38:46,354 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:38:46,365 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:38:46,427 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:38:46,450 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:38:46,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:46 WrapperNode [2025-04-30 10:38:46,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:38:46,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:38:46,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:38:46,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:38:46,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:46" (1/1) ... [2025-04-30 10:38:46,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:46" (1/1) ... [2025-04-30 10:38:46,486 INFO L138 Inliner]: procedures = 115, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2025-04-30 10:38:46,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:38:46,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:38:46,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:38:46,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:38:46,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:46" (1/1) ... [2025-04-30 10:38:46,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:46" (1/1) ... [2025-04-30 10:38:46,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:46" (1/1) ... [2025-04-30 10:38:46,513 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 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-04-30 10:38:46,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:46" (1/1) ... [2025-04-30 10:38:46,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:46" (1/1) ... [2025-04-30 10:38:46,518 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:46" (1/1) ... [2025-04-30 10:38:46,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:46" (1/1) ... [2025-04-30 10:38:46,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:46" (1/1) ... [2025-04-30 10:38:46,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:46" (1/1) ... [2025-04-30 10:38:46,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:46" (1/1) ... [2025-04-30 10:38:46,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:38:46,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:38:46,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:38:46,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:38:46,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:46" (1/1) ... [2025-04-30 10:38:46,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:38:46,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:46,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:38:46,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:38:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_node [2025-04-30 10:38:46,569 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_node [2025-04-30 10:38:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:38:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:38:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:38:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:38:46,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:38:46,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:38:46,648 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:38:46,649 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:38:46,767 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-04-30 10:38:46,768 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:38:46,774 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:38:46,774 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:38:46,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:38:46 BoogieIcfgContainer [2025-04-30 10:38:46,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:38:46,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:38:46,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:38:46,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:38:46,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:38:46" (1/3) ... [2025-04-30 10:38:46,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea5f861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:38:46, skipping insertion in model container [2025-04-30 10:38:46,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:38:46" (2/3) ... [2025-04-30 10:38:46,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea5f861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:38:46, skipping insertion in model container [2025-04-30 10:38:46,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:38:46" (3/3) ... [2025-04-30 10:38:46,782 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_shallow_copy-2.i [2025-04-30 10:38:46,791 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:38:46,792 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_shallow_copy-2.i that has 2 procedures, 35 locations, 38 edges, 1 initial locations, 0 loop locations, and 12 error locations. [2025-04-30 10:38:46,818 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:38:46,826 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@56ffb333, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:38:46,826 INFO L341 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-04-30 10:38:46,828 INFO L278 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:46,832 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:38:46,832 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:46,833 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:46,833 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-04-30 10:38:46,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:46,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1794625018, now seen corresponding path program 1 times [2025-04-30 10:38:46,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:38:46,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [235265225] [2025-04-30 10:38:46,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:46,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:46,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:46,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:46,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:38:46,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:38:46,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:38:46,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:46,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:46,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-30 10:38:46,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:46,972 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-30 10:38:47,173 INFO L325 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-04-30 10:38:47,173 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-04-30 10:38:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:47,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:55,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:38:55,442 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:38:55,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235265225] [2025-04-30 10:38:55,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235265225] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:38:55,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:38:55,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2025-04-30 10:38:55,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248262520] [2025-04-30 10:38:55,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:38:55,448 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:38:55,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:38:55,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:38:55,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=54, Unknown=1, NotChecked=0, Total=72 [2025-04-30 10:38:55,464 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 31 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:38:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:38:55,696 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2025-04-30 10:38:55,697 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:38:55,698 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 16 [2025-04-30 10:38:55,698 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:38:55,701 INFO L225 Difference]: With dead ends: 31 [2025-04-30 10:38:55,702 INFO L226 Difference]: Without dead ends: 28 [2025-04-30 10:38:55,702 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=27, Invalid=82, Unknown=1, NotChecked=0, Total=110 [2025-04-30 10:38:55,704 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:38:55,708 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 65 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:38:55,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-30 10:38:55,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-04-30 10:38:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 24 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:38:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2025-04-30 10:38:55,730 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 16 [2025-04-30 10:38:55,731 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:38:55,731 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2025-04-30 10:38:55,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:38:55,732 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2025-04-30 10:38:55,732 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:38:55,732 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:38:55,732 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:38:55,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:38:55,937 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:55,937 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-04-30 10:38:55,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:38:55,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1794625017, now seen corresponding path program 1 times [2025-04-30 10:38:55,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:38:55,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1955565307] [2025-04-30 10:38:55,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:55,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:38:55,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:38:55,941 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:38:55,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:38:55,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:38:55,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:38:55,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:55,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:55,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-30 10:38:55,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:55,995 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-30 10:38:56,001 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:38:56,141 WARN L871 $PredicateComparison]: unable to prove that (exists ((|alloc_node_~temp~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |alloc_node_~temp~0#1.base|)) (= (store |c_old(#length)| |alloc_node_~temp~0#1.base| (select |c_#length| |alloc_node_~temp~0#1.base|)) |c_#length|))) is different from true [2025-04-30 10:38:56,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:38:56,190 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:38:56,203 INFO L325 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-04-30 10:38:56,204 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-04-30 10:38:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-04-30 10:38:56,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:38:56,382 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:38:56,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955565307] [2025-04-30 10:38:56,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955565307] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:38:56,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1391669630] [2025-04-30 10:38:56,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:38:56,383 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-04-30 10:38:56,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-04-30 10:38:56,404 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-04-30 10:38:56,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-04-30 10:38:56,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:38:56,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:38:56,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:38:56,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:38:56,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-30 10:38:56,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:38:56,479 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-30 10:38:56,487 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:38:56,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-30 10:38:56,587 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-04-30 10:38:56,600 INFO L325 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-04-30 10:38:56,600 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-04-30 10:38:56,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-04-30 10:38:56,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:00,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1391669630] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:39:00,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:00,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-04-30 10:39:00,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816187014] [2025-04-30 10:39:00,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:00,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:39:00,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:39:00,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:39:00,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2025-04-30 10:39:00,729 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:39:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:00,939 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2025-04-30 10:39:00,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:39:00,939 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2025-04-30 10:39:00,939 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:00,940 INFO L225 Difference]: With dead ends: 24 [2025-04-30 10:39:00,940 INFO L226 Difference]: Without dead ends: 24 [2025-04-30 10:39:00,940 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=29, Invalid=106, Unknown=1, NotChecked=20, Total=156 [2025-04-30 10:39:00,940 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:00,941 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 20 Unchecked, 0.1s Time] [2025-04-30 10:39:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-04-30 10:39:00,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-04-30 10:39:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:39:00,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2025-04-30 10:39:00,943 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 16 [2025-04-30 10:39:00,943 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:00,943 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2025-04-30 10:39:00,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:39:00,943 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2025-04-30 10:39:00,944 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:39:00,944 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:00,944 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:00,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:39:01,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-04-30 10:39:01,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-04-30 10:39:01,348 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-04-30 10:39:01,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:01,349 INFO L85 PathProgramCache]: Analyzing trace with hash 78968552, now seen corresponding path program 1 times [2025-04-30 10:39:01,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:39:01,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [109051038] [2025-04-30 10:39:01,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:01,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:01,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:01,354 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:01,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:39:01,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:39:01,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:39:01,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:01,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:01,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:39:01,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:01,409 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-30 10:39:01,452 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:39:01,475 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-30 10:39:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:01,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:39:01,488 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:39:01,488 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109051038] [2025-04-30 10:39:01,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109051038] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:01,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:01,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:39:01,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772331911] [2025-04-30 10:39:01,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:01,491 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:39:01,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:39:01,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:39:01,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:39:01,492 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:39:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:01,608 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2025-04-30 10:39:01,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:39:01,608 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-04-30 10:39:01,608 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:01,609 INFO L225 Difference]: With dead ends: 23 [2025-04-30 10:39:01,609 INFO L226 Difference]: Without dead ends: 23 [2025-04-30 10:39:01,609 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:39:01,610 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:01,611 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-04-30 10:39:01,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-04-30 10:39:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:39:01,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2025-04-30 10:39:01,614 INFO L79 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2025-04-30 10:39:01,614 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:01,614 INFO L485 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2025-04-30 10:39:01,614 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:39:01,614 INFO L278 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2025-04-30 10:39:01,615 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:39:01,615 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:01,615 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:01,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:39:01,815 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:01,816 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-04-30 10:39:01,816 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:01,816 INFO L85 PathProgramCache]: Analyzing trace with hash 78968553, now seen corresponding path program 1 times [2025-04-30 10:39:01,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:39:01,816 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1679057682] [2025-04-30 10:39:01,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:01,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:01,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:01,818 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:01,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:39:01,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:39:01,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:39:01,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:01,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:01,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-30 10:39:01,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:01,874 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-30 10:39:01,927 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:39:01,930 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-30 10:39:01,960 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-04-30 10:39:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:01,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:39:01,977 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:39:01,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679057682] [2025-04-30 10:39:01,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679057682] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:39:01,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:39:01,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:39:01,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677429716] [2025-04-30 10:39:01,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:39:01,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:39:01,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:39:01,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:39:01,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:39:01,978 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:39:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:02,072 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2025-04-30 10:39:02,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:39:02,073 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-04-30 10:39:02,073 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:02,073 INFO L225 Difference]: With dead ends: 22 [2025-04-30 10:39:02,073 INFO L226 Difference]: Without dead ends: 22 [2025-04-30 10:39:02,073 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:39:02,074 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:02,074 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-04-30 10:39:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-04-30 10:39:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:39:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2025-04-30 10:39:02,076 INFO L79 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2025-04-30 10:39:02,076 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:02,076 INFO L485 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2025-04-30 10:39:02,076 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-04-30 10:39:02,076 INFO L278 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2025-04-30 10:39:02,077 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:39:02,077 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:02,077 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:02,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:39:02,281 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:02,281 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-04-30 10:39:02,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:02,281 INFO L85 PathProgramCache]: Analyzing trace with hash 570997579, now seen corresponding path program 1 times [2025-04-30 10:39:02,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:39:02,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1205246072] [2025-04-30 10:39:02,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:02,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:02,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:02,283 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:02,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:39:02,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-30 10:39:02,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:39:02,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:02,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:39:02,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:39:02,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:39:02,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:39:02,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:39:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:39:02,463 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:39:02,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205246072] [2025-04-30 10:39:02,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205246072] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:39:02,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:39:02,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2025-04-30 10:39:02,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594759243] [2025-04-30 10:39:02,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:39:02,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:39:02,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:39:02,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:39:02,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:39:02,465 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:39:02,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:39:02,554 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2025-04-30 10:39:02,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:39:02,555 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2025-04-30 10:39:02,555 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:39:02,555 INFO L225 Difference]: With dead ends: 21 [2025-04-30 10:39:02,555 INFO L226 Difference]: Without dead ends: 21 [2025-04-30 10:39:02,555 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:39:02,556 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:39:02,556 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 32 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:39:02,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-04-30 10:39:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-04-30 10:39:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:39:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2025-04-30 10:39:02,557 INFO L79 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 23 [2025-04-30 10:39:02,557 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:39:02,557 INFO L485 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2025-04-30 10:39:02,557 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-04-30 10:39:02,557 INFO L278 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2025-04-30 10:39:02,558 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:39:02,558 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:39:02,558 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:39:02,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:39:02,761 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:02,762 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2025-04-30 10:39:02,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:39:02,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1027138706, now seen corresponding path program 1 times [2025-04-30 10:39:02,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:39:02,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [73981131] [2025-04-30 10:39:02,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:39:02,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:02,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:39:02,765 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:39:02,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:39:02,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:39:02,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:39:02,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:02,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:39:02,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:39:02,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-30 10:39:02,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-30 10:39:02,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:39:02,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:39:02,850 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-04-30 10:39:02,850 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:39:02,850 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (11 of 12 remaining) [2025-04-30 10:39:02,853 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2025-04-30 10:39:02,853 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2025-04-30 10:39:02,853 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2025-04-30 10:39:02,853 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2025-04-30 10:39:02,853 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2025-04-30 10:39:02,853 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2025-04-30 10:39:02,853 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2025-04-30 10:39:02,853 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 12 remaining) [2025-04-30 10:39:02,853 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (2 of 12 remaining) [2025-04-30 10:39:02,853 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (1 of 12 remaining) [2025-04-30 10:39:02,853 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (0 of 12 remaining) [2025-04-30 10:39:02,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:39:03,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:39:03,056 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-30 10:39:03,078 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:39:03,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:39:03 BoogieIcfgContainer [2025-04-30 10:39:03,080 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:39:03,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:39:03,081 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:39:03,081 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:39:03,081 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:38:46" (3/4) ... [2025-04-30 10:39:03,083 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-30 10:39:03,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:39:03,084 INFO L158 Benchmark]: Toolchain (without parser) took 16969.03ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 34.5MB in the end (delta: 57.0MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2025-04-30 10:39:03,084 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:39:03,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.86ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 71.8MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:39:03,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.32ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 69.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:39:03,085 INFO L158 Benchmark]: Boogie Preprocessor took 35.94ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 68.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:39:03,085 INFO L158 Benchmark]: RCFGBuilder took 250.22ms. Allocated memory is still 117.4MB. Free memory was 68.1MB in the beginning and 55.2MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:39:03,085 INFO L158 Benchmark]: TraceAbstraction took 16304.48ms. Allocated memory is still 117.4MB. Free memory was 54.7MB in the beginning and 34.5MB in the end (delta: 20.2MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2025-04-30 10:39:03,085 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 117.4MB. Free memory was 34.5MB in the beginning and 34.5MB in the end (delta: 15.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:39:03,086 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.24ms. Allocated memory is still 83.9MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.86ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 71.8MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.32ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 69.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.94ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 68.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 250.22ms. Allocated memory is still 117.4MB. Free memory was 68.1MB in the beginning and 55.2MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16304.48ms. Allocated memory is still 117.4MB. Free memory was 54.7MB in the beginning and 34.5MB in the end (delta: 20.2MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 117.4MB. Free memory was 34.5MB in the beginning and 34.5MB in the end (delta: 15.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 568]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 568. Possible FailurePath: [L569] CALL, EXPR alloc_node() [L562] struct node* temp = (struct node*) malloc(sizeof(struct node)); [L563] COND FALSE !(((void *)0) == temp) VAL [temp={2:0}] [L566] return temp; VAL [\result={2:0}] [L569] RET, EXPR alloc_node() [L569] struct node* s = alloc_node(); [L570] CALL, EXPR alloc_node() [L562] struct node* temp = (struct node*) malloc(sizeof(struct node)); [L563] COND FALSE !(((void *)0) == temp) VAL [temp={64:0}] [L566] return temp; VAL [\result={64:0}] [L570] RET, EXPR alloc_node() VAL [s={2:0}] [L570] s->next = alloc_node() [L571] EXPR s->next [L571] *s = *(s->next) [L571] *s = *(s->next) [L572] free(s) [L572] free(s) [L572] free(s) [L573] return 0; VAL [\result=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 38 edges, 12 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 257 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 20 IncrementalHoareTripleChecker+Unchecked, 187 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 432 IncrementalHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 70 mSDtfsCounter, 432 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 37, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 140 ConstructedInterpolants, 17 QuantifiedInterpolants, 889 SizeOfPredicates, 10 NumberOfNonLiveVariables, 351 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 16/40 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-30 10:39:03,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample