./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers1-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/memsafety-ext3/getNumbers1-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 ae33a6a64877fc5c824e4d2dbc13817f946c171e566de8189cdbc86c749355b6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:13:46,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:13:46,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:13:46,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:13:46,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:13:46,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:13:46,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:13:46,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:13:46,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:13:46,636 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:13:46,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:13:46,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:13:46,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:13:46,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:13:46,637 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:13:46,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:13:46,637 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:13:46,637 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:13:46,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:13:46,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:13:46,639 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:13:46,639 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:13:46,639 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:13:46,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:13:46,640 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:13:46,640 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:13:46,640 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:13:46,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:13:46,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:13:46,641 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:13:46,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:13:46,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:13:46,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:13:46,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:13:46,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:13:46,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:13:46,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:13:46,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:13:46,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:13:46,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:13:46,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:13:46,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:13:46,645 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 -> ae33a6a64877fc5c824e4d2dbc13817f946c171e566de8189cdbc86c749355b6 [2024-11-10 15:13:46,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:13:46,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:13:46,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:13:46,851 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:13:46,852 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:13:46,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers1-1.c [2024-11-10 15:13:48,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:13:48,224 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:13:48,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers1-1.c [2024-11-10 15:13:48,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/239b9eb7f/c7a563aa90da4998bff9e9a84a4d2157/FLAG4a7a6f4fd [2024-11-10 15:13:48,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/239b9eb7f/c7a563aa90da4998bff9e9a84a4d2157 [2024-11-10 15:13:48,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:13:48,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:13:48,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:13:48,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:13:48,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:13:48,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:13:48" (1/1) ... [2024-11-10 15:13:48,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30055949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:48, skipping insertion in model container [2024-11-10 15:13:48,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:13:48" (1/1) ... [2024-11-10 15:13:48,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:13:48,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:13:48,398 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:13:48,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:13:48,418 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:13:48,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:48 WrapperNode [2024-11-10 15:13:48,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:13:48,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:13:48,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:13:48,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:13:48,424 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:13:48" (1/1) ... [2024-11-10 15:13:48,432 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:13:48" (1/1) ... [2024-11-10 15:13:48,444 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2024-11-10 15:13:48,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:13:48,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:13:48,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:13:48,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:13:48,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:48" (1/1) ... [2024-11-10 15:13:48,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:48" (1/1) ... [2024-11-10 15:13:48,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:48" (1/1) ... [2024-11-10 15:13:48,466 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2024-11-10 15:13:48,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:48" (1/1) ... [2024-11-10 15:13:48,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:48" (1/1) ... [2024-11-10 15:13:48,470 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:48" (1/1) ... [2024-11-10 15:13:48,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:48" (1/1) ... [2024-11-10 15:13:48,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:48" (1/1) ... [2024-11-10 15:13:48,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:48" (1/1) ... [2024-11-10 15:13:48,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:13:48,480 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:13:48,480 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:13:48,480 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:13:48,480 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:48" (1/1) ... [2024-11-10 15:13:48,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:13:48,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:48,514 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:13:48,519 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:13:48,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:13:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:13:48,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:13:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:13:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 15:13:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:13:48,615 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:13:48,618 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:13:48,759 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L8: call ULTIMATE.dealloc(getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset);havoc getNumbers_#t~malloc0#1.base, getNumbers_#t~malloc0#1.offset; [2024-11-10 15:13:48,767 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 15:13:48,768 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:13:48,777 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:13:48,777 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:13:48,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:13:48 BoogieIcfgContainer [2024-11-10 15:13:48,778 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:13:48,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:13:48,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:13:48,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:13:48,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:13:48" (1/3) ... [2024-11-10 15:13:48,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e79c42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:13:48, skipping insertion in model container [2024-11-10 15:13:48,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:13:48" (2/3) ... [2024-11-10 15:13:48,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e79c42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:13:48, skipping insertion in model container [2024-11-10 15:13:48,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:13:48" (3/3) ... [2024-11-10 15:13:48,785 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers1-1.c [2024-11-10 15:13:48,798 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:13:48,798 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-11-10 15:13:48,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:13:48,861 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;@292d774a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:13:48,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 15:13:48,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 22 states have internal predecessors, (26), 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:13:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:13:48,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:48,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:13:48,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-11-10 15:13:48,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:48,893 INFO L85 PathProgramCache]: Analyzing trace with hash 56271191, now seen corresponding path program 1 times [2024-11-10 15:13:48,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:48,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274153737] [2024-11-10 15:13:48,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:48,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:49,070 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:13:49,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:49,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274153737] [2024-11-10 15:13:49,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274153737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:49,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:49,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:13:49,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220741632] [2024-11-10 15:13:49,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:49,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:13:49,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:49,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:13:49,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:49,098 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 22 states have internal predecessors, (26), 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 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:49,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:49,129 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-10 15:13:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:13:49,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:13:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:49,137 INFO L225 Difference]: With dead ends: 22 [2024-11-10 15:13:49,137 INFO L226 Difference]: Without dead ends: 19 [2024-11-10 15:13:49,139 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:13:49,141 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 28 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:13:49,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 28 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:13:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-10 15:13:49,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-10 15:13:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 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:13:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-11-10 15:13:49,168 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 5 [2024-11-10 15:13:49,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:49,168 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-11-10 15:13:49,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2024-11-10 15:13:49,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:13:49,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:49,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:13:49,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:13:49,169 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-11-10 15:13:49,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:49,170 INFO L85 PathProgramCache]: Analyzing trace with hash 56271192, now seen corresponding path program 1 times [2024-11-10 15:13:49,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:49,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577785498] [2024-11-10 15:13:49,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:49,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:49,302 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:13:49,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:49,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577785498] [2024-11-10 15:13:49,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577785498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:13:49,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:13:49,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:13:49,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825582088] [2024-11-10 15:13:49,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:13:49,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:13:49,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:49,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:13:49,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:13:49,308 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:49,332 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2024-11-10 15:13:49,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:13:49,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:13:49,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:49,334 INFO L225 Difference]: With dead ends: 23 [2024-11-10 15:13:49,334 INFO L226 Difference]: Without dead ends: 23 [2024-11-10 15:13:49,334 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:13:49,336 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:49,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:13:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-10 15:13:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-11-10 15:13:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 21 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-11-10 15:13:49,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-11-10 15:13:49,342 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 5 [2024-11-10 15:13:49,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:49,343 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-10 15:13:49,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:13:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-11-10 15:13:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 15:13:49,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:49,344 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-10 15:13:49,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:13:49,345 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-11-10 15:13:49,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:49,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1478000006, now seen corresponding path program 1 times [2024-11-10 15:13:49,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:49,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406416173] [2024-11-10 15:13:49,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:49,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:49,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:49,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406416173] [2024-11-10 15:13:49,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406416173] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:49,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633294256] [2024-11-10 15:13:49,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:49,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:49,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:49,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:13:49,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 15:13:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:49,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 15:13:49,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:49,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:13:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:49,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:49,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633294256] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:13:49,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:13:49,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2024-11-10 15:13:49,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104504148] [2024-11-10 15:13:49,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:13:49,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:13:49,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:49,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:13:49,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:13:49,790 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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-11-10 15:13:49,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:49,869 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2024-11-10 15:13:49,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:13:49,871 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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) Word has length 9 [2024-11-10 15:13:49,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:49,871 INFO L225 Difference]: With dead ends: 32 [2024-11-10 15:13:49,871 INFO L226 Difference]: Without dead ends: 32 [2024-11-10 15:13:49,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:13:49,872 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:49,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:13:49,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-10 15:13:49,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-10 15:13:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 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:13:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-11-10 15:13:49,878 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 9 [2024-11-10 15:13:49,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:49,878 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-11-10 15:13:49,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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-11-10 15:13:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-11-10 15:13:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:13:49,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:49,879 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:49,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 15:13:50,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:50,080 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-11-10 15:13:50,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:50,081 INFO L85 PathProgramCache]: Analyzing trace with hash -801163946, now seen corresponding path program 1 times [2024-11-10 15:13:50,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:50,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809844826] [2024-11-10 15:13:50,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:50,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:50,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:13:50,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809844826] [2024-11-10 15:13:50,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809844826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:13:50,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550207283] [2024-11-10 15:13:50,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:50,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:13:50,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:13:50,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:13:50,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 15:13:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:13:50,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 15:13:50,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:13:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:50,278 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:13:50,342 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:13:50,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550207283] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:13:50,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:13:50,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-10 15:13:50,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128421725] [2024-11-10 15:13:50,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:13:50,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:13:50,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:13:50,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:13:50,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:13:50,344 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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:13:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:13:50,398 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2024-11-10 15:13:50,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:13:50,398 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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 25 [2024-11-10 15:13:50,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:13:50,399 INFO L225 Difference]: With dead ends: 56 [2024-11-10 15:13:50,400 INFO L226 Difference]: Without dead ends: 56 [2024-11-10 15:13:50,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:13:50,401 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:13:50,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:13:50,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-10 15:13:50,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-10 15:13:50,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 55 states have internal predecessors, (57), 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:13:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2024-11-10 15:13:50,410 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 25 [2024-11-10 15:13:50,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:13:50,410 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2024-11-10 15:13:50,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 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:13:50,410 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2024-11-10 15:13:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 15:13:50,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:13:50,411 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:13:50,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 15:13:50,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-10 15:13:50,612 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-11-10 15:13:50,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:13:50,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1286869214, now seen corresponding path program 2 times [2024-11-10 15:13:50,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:13:50,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666957579] [2024-11-10 15:13:50,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:13:50,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:13:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 15:13:50,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 15:13:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 15:13:50,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 15:13:50,671 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 15:13:50,672 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 5 remaining) [2024-11-10 15:13:50,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-10 15:13:50,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2024-11-10 15:13:50,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2024-11-10 15:13:50,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2024-11-10 15:13:50,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:13:50,677 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-11-10 15:13:50,701 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 15:13:50,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:13:50 BoogieIcfgContainer [2024-11-10 15:13:50,704 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 15:13:50,704 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 15:13:50,704 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 15:13:50,704 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 15:13:50,704 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:13:48" (3/4) ... [2024-11-10 15:13:50,705 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 15:13:50,741 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 15:13:50,742 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 15:13:50,742 INFO L158 Benchmark]: Toolchain (without parser) took 2498.57ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 90.2MB in the beginning and 107.8MB in the end (delta: -17.6MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2024-11-10 15:13:50,742 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 112.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:13:50,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.23ms. Allocated memory is still 163.6MB. Free memory was 89.9MB in the beginning and 78.1MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 15:13:50,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.63ms. Allocated memory is still 163.6MB. Free memory was 78.1MB in the beginning and 76.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:13:50,743 INFO L158 Benchmark]: Boogie Preprocessor took 33.72ms. Allocated memory is still 163.6MB. Free memory was 76.6MB in the beginning and 74.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:13:50,743 INFO L158 Benchmark]: IcfgBuilder took 298.25ms. Allocated memory is still 163.6MB. Free memory was 74.9MB in the beginning and 63.0MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 15:13:50,743 INFO L158 Benchmark]: TraceAbstraction took 1923.99ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 62.2MB in the beginning and 109.9MB in the end (delta: -47.7MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-11-10 15:13:50,743 INFO L158 Benchmark]: Witness Printer took 37.80ms. Allocated memory is still 218.1MB. Free memory was 109.9MB in the beginning and 107.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:13:50,746 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.16ms. Allocated memory is still 163.6MB. Free memory is still 112.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.23ms. Allocated memory is still 163.6MB. Free memory was 89.9MB in the beginning and 78.1MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.63ms. Allocated memory is still 163.6MB. Free memory was 78.1MB in the beginning and 76.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.72ms. Allocated memory is still 163.6MB. Free memory was 76.6MB in the beginning and 74.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 298.25ms. Allocated memory is still 163.6MB. Free memory was 74.9MB in the beginning and 63.0MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1923.99ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 62.2MB in the beginning and 109.9MB in the end (delta: -47.7MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Witness Printer took 37.80ms. Allocated memory is still 218.1MB. Free memory was 109.9MB in the beginning and 107.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L19] CALL, EXPR getNumbers() [L8] int *array = alloca(10 * sizeof(int)); [L10] int i = 0; VAL [array={10:0}, i=0] [L10] COND TRUE i < 10 VAL [array={10:0}, i=0] [L11] array[i] = i [L10] ++i VAL [array={10:0}, i=1] [L10] COND TRUE i < 10 VAL [array={10:0}, i=1] [L11] array[i] = i [L10] ++i VAL [array={10:0}, i=2] [L10] COND TRUE i < 10 VAL [array={10:0}, i=2] [L11] array[i] = i [L10] ++i VAL [array={10:0}, i=3] [L10] COND TRUE i < 10 VAL [array={10:0}, i=3] [L11] array[i] = i [L10] ++i VAL [array={10:0}, i=4] [L10] COND TRUE i < 10 VAL [array={10:0}, i=4] [L11] array[i] = i [L10] ++i VAL [array={10:0}, i=5] [L10] COND TRUE i < 10 VAL [array={10:0}, i=5] [L11] array[i] = i [L10] ++i VAL [array={10:0}, i=6] [L10] COND TRUE i < 10 VAL [array={10:0}, i=6] [L11] array[i] = i [L10] ++i VAL [array={10:0}, i=7] [L10] COND TRUE i < 10 VAL [array={10:0}, i=7] [L11] array[i] = i [L10] ++i VAL [array={10:0}, i=8] [L10] COND TRUE i < 10 VAL [array={10:0}, i=8] [L11] array[i] = i [L10] ++i VAL [array={10:0}, i=9] [L10] COND TRUE i < 10 VAL [array={10:0}, i=9] [L11] array[i] = i [L10] ++i VAL [array={10:0}, i=10] [L10] COND FALSE !(i < 10) VAL [array={10:0}] [L14] return array; [L19] RET, EXPR getNumbers() [L19] int *numbers = getNumbers(); [L21] int i = 0; VAL [i=0, numbers={10:0}] [L21] COND TRUE i < 10 [L22] numbers + i - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 5, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 196 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 127 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 69 mSDtfsCounter, 127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=4, InterpolantAutomatonStates: 25, 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, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 537 SizeOfPredicates, 1 NumberOfNonLiveVariables, 129 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/105 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-10 15:13:50,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)