./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f49dce48b63f0ee8eed4ac47c25c384a83e3c23200b58c130c184e2b953e32f3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:09:35,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:09:35,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-24 16:09:35,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:09:35,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:09:35,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:09:35,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:09:35,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:09:35,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:09:35,523 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:09:35,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:09:35,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:09:35,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:09:35,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:09:35,525 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:09:35,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:09:35,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:09:35,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:09:35,527 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:09:35,527 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:09:35,528 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:09:35,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:09:35,532 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:09:35,532 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:09:35,532 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:09:35,533 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:09:35,533 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:09:35,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:09:35,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:09:35,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:09:35,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:09:35,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:09:35,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:09:35,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:09:35,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:09:35,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:09:35,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:09:35,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:09:35,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:09:35,537 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f49dce48b63f0ee8eed4ac47c25c384a83e3c23200b58c130c184e2b953e32f3 [2024-10-24 16:09:35,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:09:35,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:09:35,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:09:35,825 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:09:35,826 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:09:35,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca.i [2024-10-24 16:09:37,310 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:09:37,520 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:09:37,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca.i [2024-10-24 16:09:37,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89446709d/70a6b87a9bb646fda79e89418c6bedf7/FLAG2d20d5a35 [2024-10-24 16:09:37,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89446709d/70a6b87a9bb646fda79e89418c6bedf7 [2024-10-24 16:09:37,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:09:37,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:09:37,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:09:37,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:09:37,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:09:37,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:09:37" (1/1) ... [2024-10-24 16:09:37,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74cd2d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:37, skipping insertion in model container [2024-10-24 16:09:37,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:09:37" (1/1) ... [2024-10-24 16:09:37,927 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:09:38,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:09:38,304 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:09:38,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:09:38,390 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:09:38,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:38 WrapperNode [2024-10-24 16:09:38,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:09:38,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:09:38,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:09:38,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:09:38,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:38" (1/1) ... [2024-10-24 16:09:38,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:38" (1/1) ... [2024-10-24 16:09:38,436 INFO L138 Inliner]: procedures = 111, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-10-24 16:09:38,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:09:38,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:09:38,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:09:38,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:09:38,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:38" (1/1) ... [2024-10-24 16:09:38,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:38" (1/1) ... [2024-10-24 16:09:38,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:38" (1/1) ... [2024-10-24 16:09:38,476 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [5, 6, 2]. 46 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 6 writes are split as follows [2, 3, 1]. [2024-10-24 16:09:38,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:38" (1/1) ... [2024-10-24 16:09:38,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:38" (1/1) ... [2024-10-24 16:09:38,480 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:38" (1/1) ... [2024-10-24 16:09:38,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:38" (1/1) ... [2024-10-24 16:09:38,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:38" (1/1) ... [2024-10-24 16:09:38,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:38" (1/1) ... [2024-10-24 16:09:38,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:09:38,488 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:09:38,489 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:09:38,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:09:38,489 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:38" (1/1) ... [2024-10-24 16:09:38,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:09:38,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:09:38,525 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-10-24 16:09:38,532 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-10-24 16:09:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 16:09:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 16:09:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 16:09:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 16:09:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 16:09:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 16:09:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 16:09:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:09:38,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:09:38,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:09:38,697 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:09:38,699 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:09:38,969 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-10-24 16:09:38,970 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:09:39,021 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:09:39,021 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 16:09:39,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:09:39 BoogieIcfgContainer [2024-10-24 16:09:39,022 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:09:39,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:09:39,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:09:39,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:09:39,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:09:37" (1/3) ... [2024-10-24 16:09:39,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1278fd4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:09:39, skipping insertion in model container [2024-10-24 16:09:39,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:09:38" (2/3) ... [2024-10-24 16:09:39,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1278fd4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:09:39, skipping insertion in model container [2024-10-24 16:09:39,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:09:39" (3/3) ... [2024-10-24 16:09:39,034 INFO L112 eAbstractionObserver]: Analyzing ICFG c.01-no-inv-alloca.i [2024-10-24 16:09:39,050 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:09:39,050 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2024-10-24 16:09:39,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:09:39,114 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;@b616676, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:09:39,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2024-10-24 16:09:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 45 states have internal predecessors, (50), 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-10-24 16:09:39,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 16:09:39,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:39,125 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 16:09:39,125 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-24 16:09:39,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:39,132 INFO L85 PathProgramCache]: Analyzing trace with hash 3569, now seen corresponding path program 1 times [2024-10-24 16:09:39,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:39,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428020262] [2024-10-24 16:09:39,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:39,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:39,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:39,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428020262] [2024-10-24 16:09:39,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428020262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:09:39,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:09:39,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:09:39,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936785322] [2024-10-24 16:09:39,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:39,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:09:39,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:39,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:09:39,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:39,548 INFO L87 Difference]: Start difference. First operand has 46 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:39,641 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2024-10-24 16:09:39,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:09:39,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-24 16:09:39,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:39,658 INFO L225 Difference]: With dead ends: 41 [2024-10-24 16:09:39,658 INFO L226 Difference]: Without dead ends: 40 [2024-10-24 16:09:39,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:39,663 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:39,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 15 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:09:39,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-24 16:09:39,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-24 16:09:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 39 states have internal predecessors, (42), 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-10-24 16:09:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2024-10-24 16:09:39,702 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 2 [2024-10-24 16:09:39,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:39,702 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2024-10-24 16:09:39,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2024-10-24 16:09:39,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 16:09:39,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:39,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 16:09:39,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 16:09:39,703 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-24 16:09:39,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:39,704 INFO L85 PathProgramCache]: Analyzing trace with hash 3570, now seen corresponding path program 1 times [2024-10-24 16:09:39,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:39,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835993906] [2024-10-24 16:09:39,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:39,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:39,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:39,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835993906] [2024-10-24 16:09:39,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835993906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:09:39,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:09:39,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:09:39,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492981597] [2024-10-24 16:09:39,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:39,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:09:39,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:39,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:09:39,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:39,878 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:39,933 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2024-10-24 16:09:39,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:09:39,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-24 16:09:39,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:39,934 INFO L225 Difference]: With dead ends: 35 [2024-10-24 16:09:39,935 INFO L226 Difference]: Without dead ends: 35 [2024-10-24 16:09:39,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:39,936 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:39,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 16 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:09:39,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-24 16:09:39,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-24 16:09:39,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 34 states have internal predecessors, (37), 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-10-24 16:09:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2024-10-24 16:09:39,943 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 2 [2024-10-24 16:09:39,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:39,944 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2024-10-24 16:09:39,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:39,944 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-10-24 16:09:39,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-24 16:09:39,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:39,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-24 16:09:39,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 16:09:39,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-24 16:09:39,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:39,946 INFO L85 PathProgramCache]: Analyzing trace with hash 110615, now seen corresponding path program 1 times [2024-10-24 16:09:39,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:39,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481190449] [2024-10-24 16:09:39,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:39,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:40,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:40,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481190449] [2024-10-24 16:09:40,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481190449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:09:40,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:09:40,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:09:40,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376865848] [2024-10-24 16:09:40,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:40,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:09:40,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:40,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:09:40,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:40,029 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:40,071 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-10-24 16:09:40,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:09:40,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-24 16:09:40,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:40,072 INFO L225 Difference]: With dead ends: 29 [2024-10-24 16:09:40,072 INFO L226 Difference]: Without dead ends: 29 [2024-10-24 16:09:40,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:40,074 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:40,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 9 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:09:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-24 16:09:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-24 16:09:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 28 states have internal predecessors, (31), 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-10-24 16:09:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-10-24 16:09:40,079 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 3 [2024-10-24 16:09:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:40,079 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-10-24 16:09:40,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-10-24 16:09:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-24 16:09:40,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:40,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-24 16:09:40,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 16:09:40,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-24 16:09:40,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:40,081 INFO L85 PathProgramCache]: Analyzing trace with hash 110616, now seen corresponding path program 1 times [2024-10-24 16:09:40,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:40,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755406040] [2024-10-24 16:09:40,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:40,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:40,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:40,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755406040] [2024-10-24 16:09:40,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755406040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:09:40,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:09:40,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:09:40,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342102389] [2024-10-24 16:09:40,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:40,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:09:40,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:40,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:09:40,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:40,218 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:40,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:40,260 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-10-24 16:09:40,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:09:40,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-24 16:09:40,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:40,261 INFO L225 Difference]: With dead ends: 23 [2024-10-24 16:09:40,261 INFO L226 Difference]: Without dead ends: 23 [2024-10-24 16:09:40,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:40,263 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:40,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 10 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:09:40,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-24 16:09:40,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-24 16:09:40,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:40,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-10-24 16:09:40,266 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 3 [2024-10-24 16:09:40,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:40,267 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-10-24 16:09:40,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-10-24 16:09:40,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 16:09:40,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:40,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 16:09:40,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 16:09:40,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-24 16:09:40,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:40,268 INFO L85 PathProgramCache]: Analyzing trace with hash 3429044, now seen corresponding path program 1 times [2024-10-24 16:09:40,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:40,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968687072] [2024-10-24 16:09:40,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:40,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:40,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:40,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968687072] [2024-10-24 16:09:40,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968687072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:09:40,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:09:40,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:09:40,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877677892] [2024-10-24 16:09:40,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:40,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:09:40,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:40,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:09:40,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:40,301 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:40,330 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-10-24 16:09:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:09:40,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-24 16:09:40,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:40,331 INFO L225 Difference]: With dead ends: 21 [2024-10-24 16:09:40,331 INFO L226 Difference]: Without dead ends: 21 [2024-10-24 16:09:40,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:40,332 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:40,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:09:40,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-24 16:09:40,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-24 16:09:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 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-10-24 16:09:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-10-24 16:09:40,335 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 4 [2024-10-24 16:09:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:40,337 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-10-24 16:09:40,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-10-24 16:09:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 16:09:40,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:40,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 16:09:40,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 16:09:40,338 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-24 16:09:40,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:40,338 INFO L85 PathProgramCache]: Analyzing trace with hash 3429045, now seen corresponding path program 1 times [2024-10-24 16:09:40,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:40,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794907764] [2024-10-24 16:09:40,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:40,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:40,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:40,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:40,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794907764] [2024-10-24 16:09:40,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794907764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:09:40,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:09:40,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 16:09:40,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241210170] [2024-10-24 16:09:40,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:40,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:09:40,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:40,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:09:40,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:40,432 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:40,461 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-10-24 16:09:40,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:09:40,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-24 16:09:40,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:40,463 INFO L225 Difference]: With dead ends: 19 [2024-10-24 16:09:40,463 INFO L226 Difference]: Without dead ends: 19 [2024-10-24 16:09:40,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:09:40,464 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 8 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-10-24 16:09:40,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 8 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:09:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-24 16:09:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-24 16:09:40,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-10-24 16:09:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-10-24 16:09:40,471 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 4 [2024-10-24 16:09:40,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:40,471 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-10-24 16:09:40,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:09:40,471 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-10-24 16:09:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-24 16:09:40,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:09:40,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:09:40,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 16:09:40,475 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-24 16:09:40,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:09:40,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1402822927, now seen corresponding path program 1 times [2024-10-24 16:09:40,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:09:40,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067507582] [2024-10-24 16:09:40,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:09:40,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:09:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:09:40,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:40,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:09:40,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067507582] [2024-10-24 16:09:40,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067507582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:09:40,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:09:40,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:09:40,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182228540] [2024-10-24 16:09:40,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:09:40,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:09:40,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:09:40,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:09:40,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:09:40,725 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-10-24 16:09:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:09:40,758 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2024-10-24 16:09:40,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:09:40,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-10-24 16:09:40,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:09:40,759 INFO L225 Difference]: With dead ends: 18 [2024-10-24 16:09:40,759 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 16:09:40,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-10-24 16:09:40,762 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:09:40,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 12 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:09:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 16:09:40,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 16:09:40,764 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-10-24 16:09:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 16:09:40,764 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2024-10-24 16:09:40,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:09:40,764 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 16:09:40,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-10-24 16:09:40,764 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 16:09:40,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 16:09:40,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 27 remaining) [2024-10-24 16:09:40,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 27 remaining) [2024-10-24 16:09:40,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 27 remaining) [2024-10-24 16:09:40,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 27 remaining) [2024-10-24 16:09:40,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 27 remaining) [2024-10-24 16:09:40,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 27 remaining) [2024-10-24 16:09:40,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 27 remaining) [2024-10-24 16:09:40,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 27 remaining) [2024-10-24 16:09:40,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 27 remaining) [2024-10-24 16:09:40,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 27 remaining) [2024-10-24 16:09:40,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 27 remaining) [2024-10-24 16:09:40,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 27 remaining) [2024-10-24 16:09:40,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 27 remaining) [2024-10-24 16:09:40,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 27 remaining) [2024-10-24 16:09:40,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 27 remaining) [2024-10-24 16:09:40,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 27 remaining) [2024-10-24 16:09:40,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 27 remaining) [2024-10-24 16:09:40,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 27 remaining) [2024-10-24 16:09:40,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 27 remaining) [2024-10-24 16:09:40,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 27 remaining) [2024-10-24 16:09:40,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 27 remaining) [2024-10-24 16:09:40,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 27 remaining) [2024-10-24 16:09:40,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 27 remaining) [2024-10-24 16:09:40,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 27 remaining) [2024-10-24 16:09:40,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 27 remaining) [2024-10-24 16:09:40,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 27 remaining) [2024-10-24 16:09:40,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (0 of 27 remaining) [2024-10-24 16:09:40,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 16:09:40,774 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:09:40,776 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 16:09:40,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:09:40 BoogieIcfgContainer [2024-10-24 16:09:40,779 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 16:09:40,779 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 16:09:40,779 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 16:09:40,779 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 16:09:40,780 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:09:39" (3/4) ... [2024-10-24 16:09:40,781 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 16:09:40,788 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-24 16:09:40,789 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-24 16:09:40,789 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-24 16:09:40,789 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-24 16:09:40,878 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 16:09:40,878 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 16:09:40,878 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 16:09:40,879 INFO L158 Benchmark]: Toolchain (without parser) took 2989.47ms. Allocated memory is still 165.7MB. Free memory was 98.8MB in the beginning and 56.1MB in the end (delta: 42.7MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2024-10-24 16:09:40,879 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:09:40,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.01ms. Allocated memory is still 165.7MB. Free memory was 98.6MB in the beginning and 133.5MB in the end (delta: -34.9MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-10-24 16:09:40,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.97ms. Allocated memory is still 165.7MB. Free memory was 133.5MB in the beginning and 132.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:09:40,879 INFO L158 Benchmark]: Boogie Preprocessor took 48.79ms. Allocated memory is still 165.7MB. Free memory was 132.1MB in the beginning and 130.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:09:40,880 INFO L158 Benchmark]: RCFGBuilder took 533.42ms. Allocated memory is still 165.7MB. Free memory was 129.4MB in the beginning and 109.8MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 16:09:40,880 INFO L158 Benchmark]: TraceAbstraction took 1753.05ms. Allocated memory is still 165.7MB. Free memory was 109.0MB in the beginning and 60.3MB in the end (delta: 48.7MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2024-10-24 16:09:40,881 INFO L158 Benchmark]: Witness Printer took 99.13ms. Allocated memory is still 165.7MB. Free memory was 60.3MB in the beginning and 56.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 16:09:40,882 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.17ms. Allocated memory is still 109.1MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.01ms. Allocated memory is still 165.7MB. Free memory was 98.6MB in the beginning and 133.5MB in the end (delta: -34.9MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.97ms. Allocated memory is still 165.7MB. Free memory was 133.5MB in the beginning and 132.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.79ms. Allocated memory is still 165.7MB. Free memory was 132.1MB in the beginning and 130.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 533.42ms. Allocated memory is still 165.7MB. Free memory was 129.4MB in the beginning and 109.8MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1753.05ms. Allocated memory is still 165.7MB. Free memory was 109.0MB in the beginning and 60.3MB in the end (delta: 48.7MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. * Witness Printer took 99.13ms. Allocated memory is still 165.7MB. Free memory was 60.3MB in the beginning and 56.1MB 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: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 27 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 169 IncrementalHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 68 mSDtfsCounter, 169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 241 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 27 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-24 16:09:40,908 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