./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-regression/test26-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-regression/test26-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e16a9039af683ff71136e4fdf1d6e681546010da6b9063cc41cb578540720f5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:07:24,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:07:24,828 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:07:24,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:07:24,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:07:24,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:07:24,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:07:24,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:07:24,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:07:24,860 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:07:24,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:07:24,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:07:24,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:07:24,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:07:24,861 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:07:24,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:07:24,861 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:07:24,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:07:24,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:07:24,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:07:24,862 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:07:24,865 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:07:24,865 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:07:24,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:07:24,867 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:07:24,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:07:24,868 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:07:24,868 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:07:24,868 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:07:24,868 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:07:24,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:07:24,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:07:24,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:07:24,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:07:24,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:07:24,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:07:24,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:07:24,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:07:24,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:07:24,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:07:24,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:07:24,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:07:24,871 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 6e16a9039af683ff71136e4fdf1d6e681546010da6b9063cc41cb578540720f5 [2024-11-10 15:07:25,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:07:25,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:07:25,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:07:25,096 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:07:25,096 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:07:25,097 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test26-1.c [2024-11-10 15:07:26,276 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:07:26,420 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:07:26,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test26-1.c [2024-11-10 15:07:26,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a708ea9c8/025ae861e1be431bba717bbff94b1b7d/FLAG52c1f65fa [2024-11-10 15:07:26,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a708ea9c8/025ae861e1be431bba717bbff94b1b7d [2024-11-10 15:07:26,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:07:26,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:07:26,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:07:26,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:07:26,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:07:26,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:07:26" (1/1) ... [2024-11-10 15:07:26,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2970dcdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:26, skipping insertion in model container [2024-11-10 15:07:26,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:07:26" (1/1) ... [2024-11-10 15:07:26,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:07:27,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:07:27,030 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:07:27,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:07:27,054 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:07:27,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:27 WrapperNode [2024-11-10 15:07:27,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:07:27,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:07:27,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:07:27,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:07:27,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:27" (1/1) ... [2024-11-10 15:07:27,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:27" (1/1) ... [2024-11-10 15:07:27,079 INFO L138 Inliner]: procedures = 12, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 36 [2024-11-10 15:07:27,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:07:27,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:07:27,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:07:27,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:07:27,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:27" (1/1) ... [2024-11-10 15:07:27,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:27" (1/1) ... [2024-11-10 15:07:27,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:27" (1/1) ... [2024-11-10 15:07:27,097 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 1 writes are split as follows [0, 1]. [2024-11-10 15:07:27,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:27" (1/1) ... [2024-11-10 15:07:27,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:27" (1/1) ... [2024-11-10 15:07:27,100 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:27" (1/1) ... [2024-11-10 15:07:27,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:27" (1/1) ... [2024-11-10 15:07:27,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:27" (1/1) ... [2024-11-10 15:07:27,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:27" (1/1) ... [2024-11-10 15:07:27,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:07:27,103 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:07:27,103 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:07:27,103 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:07:27,104 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:27" (1/1) ... [2024-11-10 15:07:27,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:07:27,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:07:27,133 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) [2024-11-10 15:07:27,135 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 [2024-11-10 15:07:27,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:07:27,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:07:27,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:07:27,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:07:27,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:07:27,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:07:27,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 15:07:27,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:07:27,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:07:27,220 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:07:27,222 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:07:27,325 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-10 15:07:27,325 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:07:27,338 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:07:27,338 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:07:27,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:07:27 BoogieIcfgContainer [2024-11-10 15:07:27,339 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:07:27,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:07:27,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:07:27,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:07:27,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:07:26" (1/3) ... [2024-11-10 15:07:27,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c8b6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:07:27, skipping insertion in model container [2024-11-10 15:07:27,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:27" (2/3) ... [2024-11-10 15:07:27,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c8b6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:07:27, skipping insertion in model container [2024-11-10 15:07:27,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:07:27" (3/3) ... [2024-11-10 15:07:27,347 INFO L112 eAbstractionObserver]: Analyzing ICFG test26-1.c [2024-11-10 15:07:27,360 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:07:27,361 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-10 15:07:27,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:07:27,400 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@17d502e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:07:27,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-10 15:07:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.6875) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:27,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 15:07:27,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:27,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 15:07:27,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-10 15:07:27,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:27,412 INFO L85 PathProgramCache]: Analyzing trace with hash 59547, now seen corresponding path program 1 times [2024-11-10 15:07:27,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:27,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145660696] [2024-11-10 15:07:27,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:27,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:07:27,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:27,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145660696] [2024-11-10 15:07:27,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145660696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:07:27,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:07:27,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:07:27,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642343760] [2024-11-10 15:07:27,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:07:27,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:07:27,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:27,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:07:27,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:07:27,672 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.6875) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:27,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:27,733 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2024-11-10 15:07:27,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:07:27,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-10 15:07:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:27,741 INFO L225 Difference]: With dead ends: 24 [2024-11-10 15:07:27,741 INFO L226 Difference]: Without dead ends: 21 [2024-11-10 15:07:27,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:07:27,754 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:27,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 20 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:07:27,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-10 15:07:27,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-10 15:07:27,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 20 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2024-11-10 15:07:27,775 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 3 [2024-11-10 15:07:27,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:27,776 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2024-11-10 15:07:27,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:27,776 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2024-11-10 15:07:27,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 15:07:27,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:27,777 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 15:07:27,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:07:27,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-10 15:07:27,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:27,778 INFO L85 PathProgramCache]: Analyzing trace with hash 59548, now seen corresponding path program 1 times [2024-11-10 15:07:27,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:27,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585429383] [2024-11-10 15:07:27,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:27,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:07:27,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:27,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585429383] [2024-11-10 15:07:27,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585429383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:07:27,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:07:27,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:07:27,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302519024] [2024-11-10 15:07:27,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:07:27,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:07:27,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:27,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:07:27,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:07:27,925 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:27,954 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2024-11-10 15:07:27,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:07:27,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-10 15:07:27,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:27,955 INFO L225 Difference]: With dead ends: 19 [2024-11-10 15:07:27,955 INFO L226 Difference]: Without dead ends: 19 [2024-11-10 15:07:27,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:07:27,956 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:27,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 20 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:07:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-10 15:07:27,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-10 15:07:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 18 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2024-11-10 15:07:27,959 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 3 [2024-11-10 15:07:27,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:27,959 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2024-11-10 15:07:27,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:27,960 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2024-11-10 15:07:27,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 15:07:27,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:27,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 15:07:27,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:07:27,961 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-10 15:07:27,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:27,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1845950, now seen corresponding path program 1 times [2024-11-10 15:07:27,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:27,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932945730] [2024-11-10 15:07:27,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:27,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:07:28,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:28,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932945730] [2024-11-10 15:07:28,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932945730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:07:28,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:07:28,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:07:28,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498869622] [2024-11-10 15:07:28,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:07:28,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:07:28,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:28,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:07:28,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:07:28,022 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:28,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:28,043 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2024-11-10 15:07:28,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:07:28,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-10 15:07:28,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:28,044 INFO L225 Difference]: With dead ends: 18 [2024-11-10 15:07:28,044 INFO L226 Difference]: Without dead ends: 18 [2024-11-10 15:07:28,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:07:28,045 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:28,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 16 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:07:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-10 15:07:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-10 15:07:28,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 17 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2024-11-10 15:07:28,050 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 4 [2024-11-10 15:07:28,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:28,051 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2024-11-10 15:07:28,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2024-11-10 15:07:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 15:07:28,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:28,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 15:07:28,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:07:28,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-10 15:07:28,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:28,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1845951, now seen corresponding path program 1 times [2024-11-10 15:07:28,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:28,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759412388] [2024-11-10 15:07:28,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:28,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:07:28,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:28,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759412388] [2024-11-10 15:07:28,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759412388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:07:28,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:07:28,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:07:28,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210947770] [2024-11-10 15:07:28,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:07:28,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:07:28,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:28,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:07:28,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:07:28,172 INFO L87 Difference]: Start difference. First operand 18 states and 17 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:28,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:28,204 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2024-11-10 15:07:28,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:07:28,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-10 15:07:28,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:28,206 INFO L225 Difference]: With dead ends: 17 [2024-11-10 15:07:28,206 INFO L226 Difference]: Without dead ends: 17 [2024-11-10 15:07:28,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:07:28,207 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:28,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 18 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:07:28,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-10 15:07:28,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-10 15:07:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 16 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:28,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2024-11-10 15:07:28,211 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 4 [2024-11-10 15:07:28,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:28,211 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2024-11-10 15:07:28,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2024-11-10 15:07:28,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:07:28,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:28,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:07:28,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:07:28,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-10 15:07:28,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:28,213 INFO L85 PathProgramCache]: Analyzing trace with hash -841886377, now seen corresponding path program 1 times [2024-11-10 15:07:28,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:28,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121561044] [2024-11-10 15:07:28,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:28,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:07:28,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:28,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121561044] [2024-11-10 15:07:28,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121561044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:07:28,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:07:28,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:07:28,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904149920] [2024-11-10 15:07:28,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:07:28,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:07:28,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:28,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:07:28,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:07:28,267 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:28,285 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2024-11-10 15:07:28,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:07:28,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 15:07:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:28,286 INFO L225 Difference]: With dead ends: 16 [2024-11-10 15:07:28,286 INFO L226 Difference]: Without dead ends: 16 [2024-11-10 15:07:28,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:07:28,288 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:28,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:07:28,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-10 15:07:28,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-10 15:07:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2024-11-10 15:07:28,294 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 7 [2024-11-10 15:07:28,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:28,294 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2024-11-10 15:07:28,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:28,295 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2024-11-10 15:07:28,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:07:28,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:28,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:07:28,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:07:28,295 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-10 15:07:28,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:28,296 INFO L85 PathProgramCache]: Analyzing trace with hash -841886376, now seen corresponding path program 1 times [2024-11-10 15:07:28,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:28,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244734642] [2024-11-10 15:07:28,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:28,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:07:28,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:28,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244734642] [2024-11-10 15:07:28,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244734642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:07:28,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:07:28,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:07:28,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309685996] [2024-11-10 15:07:28,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:07:28,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:07:28,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:28,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:07:28,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:07:28,376 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:28,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:28,400 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2024-11-10 15:07:28,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:07:28,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 15:07:28,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:28,402 INFO L225 Difference]: With dead ends: 15 [2024-11-10 15:07:28,402 INFO L226 Difference]: Without dead ends: 15 [2024-11-10 15:07:28,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:07:28,403 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:28,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 15 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:07:28,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-10 15:07:28,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-10 15:07:28,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:28,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2024-11-10 15:07:28,407 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 7 [2024-11-10 15:07:28,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:28,407 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2024-11-10 15:07:28,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:28,407 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2024-11-10 15:07:28,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:07:28,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:28,408 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:07:28,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:07:28,408 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-10 15:07:28,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:28,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1000487410, now seen corresponding path program 1 times [2024-11-10 15:07:28,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:28,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654881707] [2024-11-10 15:07:28,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:28,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:07:28,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:28,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654881707] [2024-11-10 15:07:28,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654881707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:07:28,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:07:28,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:07:28,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927203467] [2024-11-10 15:07:28,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:07:28,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:07:28,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:28,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:07:28,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:07:28,680 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:28,716 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2024-11-10 15:07:28,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:07:28,717 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-10 15:07:28,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:28,717 INFO L225 Difference]: With dead ends: 12 [2024-11-10 15:07:28,717 INFO L226 Difference]: Without dead ends: 12 [2024-11-10 15:07:28,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:07:28,718 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:28,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 21 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:07:28,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-10 15:07:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-10 15:07:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:28,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2024-11-10 15:07:28,719 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 11 [2024-11-10 15:07:28,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:28,719 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2024-11-10 15:07:28,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:28,719 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2024-11-10 15:07:28,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:07:28,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:07:28,720 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:07:28,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:07:28,720 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-10 15:07:28,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:07:28,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1000489172, now seen corresponding path program 1 times [2024-11-10 15:07:28,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:07:28,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895690014] [2024-11-10 15:07:28,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:07:28,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:07:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:07:28,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:07:28,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:07:28,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895690014] [2024-11-10 15:07:28,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895690014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:07:28,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:07:28,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:07:28,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722889716] [2024-11-10 15:07:28,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:07:28,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:07:28,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:07:28,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:07:28,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:07:28,748 INFO L87 Difference]: Start difference. First operand 12 states and 11 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:28,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:07:28,754 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2024-11-10 15:07:28,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:07:28,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-10 15:07:28,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:07:28,754 INFO L225 Difference]: With dead ends: 11 [2024-11-10 15:07:28,755 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 15:07:28,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:07:28,755 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:07:28,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:07:28,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 15:07:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 15:07:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 15:07:28,756 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2024-11-10 15:07:28,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:07:28,757 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 15:07:28,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:07:28,757 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 15:07:28,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 15:07:28,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2024-11-10 15:07:28,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2024-11-10 15:07:28,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2024-11-10 15:07:28,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2024-11-10 15:07:28,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2024-11-10 15:07:28,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2024-11-10 15:07:28,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 10 remaining) [2024-11-10 15:07:28,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2024-11-10 15:07:28,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2024-11-10 15:07:28,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 10 remaining) [2024-11-10 15:07:28,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:07:28,762 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:07:28,764 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 15:07:28,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:07:28 BoogieIcfgContainer [2024-11-10 15:07:28,766 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 15:07:28,766 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 15:07:28,766 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 15:07:28,766 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 15:07:28,767 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:07:27" (3/4) ... [2024-11-10 15:07:28,768 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 15:07:28,774 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-10 15:07:28,774 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-10 15:07:28,776 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 15:07:28,776 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 15:07:28,830 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 15:07:28,831 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 15:07:28,831 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 15:07:28,831 INFO L158 Benchmark]: Toolchain (without parser) took 1980.09ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 122.9MB in the beginning and 176.5MB in the end (delta: -53.6MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-11-10 15:07:28,831 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 144.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:07:28,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.16ms. Allocated memory is still 176.2MB. Free memory was 122.9MB in the beginning and 110.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 15:07:28,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.57ms. Allocated memory is still 176.2MB. Free memory was 110.7MB in the beginning and 109.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:07:28,835 INFO L158 Benchmark]: Boogie Preprocessor took 22.94ms. Allocated memory is still 176.2MB. Free memory was 109.1MB in the beginning and 107.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:07:28,835 INFO L158 Benchmark]: IcfgBuilder took 236.10ms. Allocated memory is still 176.2MB. Free memory was 107.3MB in the beginning and 95.9MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 15:07:28,836 INFO L158 Benchmark]: TraceAbstraction took 1424.23ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 95.1MB in the beginning and 180.7MB in the end (delta: -85.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:07:28,836 INFO L158 Benchmark]: Witness Printer took 64.70ms. Allocated memory is still 239.1MB. Free memory was 180.7MB in the beginning and 176.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 15:07:28,837 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 144.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.16ms. Allocated memory is still 176.2MB. Free memory was 122.9MB in the beginning and 110.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.57ms. Allocated memory is still 176.2MB. Free memory was 110.7MB in the beginning and 109.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.94ms. Allocated memory is still 176.2MB. Free memory was 109.1MB in the beginning and 107.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 236.10ms. Allocated memory is still 176.2MB. Free memory was 107.3MB in the beginning and 95.9MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1424.23ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 95.1MB in the beginning and 180.7MB in the end (delta: -85.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 64.70ms. Allocated memory is still 239.1MB. Free memory was 180.7MB in the beginning and 176.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 142 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 132 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 73 mSDtfsCounter, 132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 35, 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 348 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 15:07:28,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE