./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f 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/AutomizerReach.xml -i ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b834abf8dc1317d8271c7246f1223cb53b92d1ccf9f4021ff5d970b2c79106ab --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 17:00:01,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 17:00:01,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-12 17:00:01,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 17:00:01,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 17:00:01,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 17:00:01,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 17:00:01,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 17:00:01,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 17:00:01,695 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 17:00:01,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 17:00:01,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 17:00:01,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 17:00:01,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 17:00:01,701 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 17:00:01,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 17:00:01,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 17:00:01,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 17:00:01,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 17:00:01,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 17:00:01,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 17:00:01,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 17:00:01,704 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 17:00:01,704 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 17:00:01,705 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 17:00:01,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 17:00:01,705 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 17:00:01,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 17:00:01,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 17:00:01,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 17:00:01,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 17:00:01,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:00:01,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 17:00:01,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 17:00:01,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 17:00:01,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 17:00:01,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 17:00:01,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 17:00:01,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 17:00:01,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 17:00:01,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 17:00:01,710 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 ! overflow) ) 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 -> b834abf8dc1317d8271c7246f1223cb53b92d1ccf9f4021ff5d970b2c79106ab [2024-11-12 17:00:01,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 17:00:01,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 17:00:01,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 17:00:01,988 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 17:00:01,989 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 17:00:01,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5.i [2024-11-12 17:00:03,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 17:00:03,691 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 17:00:03,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5.i [2024-11-12 17:00:03,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49c4eb717/68c212881bf3486ab656b934becb484a/FLAG8de26ef49 [2024-11-12 17:00:04,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49c4eb717/68c212881bf3486ab656b934becb484a [2024-11-12 17:00:04,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 17:00:04,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 17:00:04,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 17:00:04,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 17:00:04,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 17:00:04,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:00:04" (1/1) ... [2024-11-12 17:00:04,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f258422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:04, skipping insertion in model container [2024-11-12 17:00:04,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:00:04" (1/1) ... [2024-11-12 17:00:04,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 17:00:04,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:00:04,272 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 17:00:04,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:00:04,298 INFO L204 MainTranslator]: Completed translation [2024-11-12 17:00:04,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:04 WrapperNode [2024-11-12 17:00:04,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 17:00:04,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 17:00:04,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 17:00:04,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 17:00:04,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:04" (1/1) ... [2024-11-12 17:00:04,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:04" (1/1) ... [2024-11-12 17:00:04,331 INFO L138 Inliner]: procedures = 12, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2024-11-12 17:00:04,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 17:00:04,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 17:00:04,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 17:00:04,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 17:00:04,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:04" (1/1) ... [2024-11-12 17:00:04,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:04" (1/1) ... [2024-11-12 17:00:04,344 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:04" (1/1) ... [2024-11-12 17:00:04,358 INFO L175 MemorySlicer]: Split 9 memory accesses to 4 slices as follows [3, 0, 4, 2]. 44 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 4 writes are split as follows [1, 0, 2, 1]. [2024-11-12 17:00:04,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:04" (1/1) ... [2024-11-12 17:00:04,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:04" (1/1) ... [2024-11-12 17:00:04,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:04" (1/1) ... [2024-11-12 17:00:04,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:04" (1/1) ... [2024-11-12 17:00:04,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:04" (1/1) ... [2024-11-12 17:00:04,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:04" (1/1) ... [2024-11-12 17:00:04,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 17:00:04,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 17:00:04,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 17:00:04,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 17:00:04,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:04" (1/1) ... [2024-11-12 17:00:04,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:00:04,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:00:04,408 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-12 17:00:04,410 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-12 17:00:04,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 17:00:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 17:00:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 17:00:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 17:00:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 17:00:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-12 17:00:04,448 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-12 17:00:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure g [2024-11-12 17:00:04,448 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2024-11-12 17:00:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 17:00:04,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 17:00:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 17:00:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 17:00:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 17:00:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 17:00:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 17:00:04,518 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 17:00:04,520 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 17:00:04,780 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-12 17:00:04,780 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 17:00:04,794 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 17:00:04,795 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 17:00:04,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:00:04 BoogieIcfgContainer [2024-11-12 17:00:04,796 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 17:00:04,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 17:00:04,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 17:00:04,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 17:00:04,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:00:04" (1/3) ... [2024-11-12 17:00:04,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f82799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:00:04, skipping insertion in model container [2024-11-12 17:00:04,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:00:04" (2/3) ... [2024-11-12 17:00:04,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f82799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:00:04, skipping insertion in model container [2024-11-12 17:00:04,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:00:04" (3/3) ... [2024-11-12 17:00:04,807 INFO L112 eAbstractionObserver]: Analyzing ICFG rec_malloc_ex5.i [2024-11-12 17:00:04,823 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 17:00:04,823 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-12 17:00:04,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 17:00:04,891 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=LoopHeads, 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;@7efce81d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 17:00:04,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-12 17:00:04,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 17:00:04,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 17:00:04,899 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:04,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:04,900 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-12 17:00:04,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:04,905 INFO L85 PathProgramCache]: Analyzing trace with hash -48964106, now seen corresponding path program 1 times [2024-11-12 17:00:04,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:04,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029666511] [2024-11-12 17:00:04,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:04,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:05,091 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-12 17:00:05,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:05,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029666511] [2024-11-12 17:00:05,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029666511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:05,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:05,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 17:00:05,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207665197] [2024-11-12 17:00:05,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:05,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:00:05,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:05,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:00:05,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:00:05,122 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:00:05,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:05,153 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2024-11-12 17:00:05,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:00:05,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-12 17:00:05,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:05,165 INFO L225 Difference]: With dead ends: 65 [2024-11-12 17:00:05,165 INFO L226 Difference]: Without dead ends: 27 [2024-11-12 17:00:05,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:00:05,174 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:05,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:05,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-12 17:00:05,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-12 17:00:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.4375) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-12 17:00:05,227 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 8 [2024-11-12 17:00:05,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:05,227 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-12 17:00:05,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:00:05,228 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-12 17:00:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 17:00:05,229 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:05,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:05,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 17:00:05,246 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-12 17:00:05,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:05,251 INFO L85 PathProgramCache]: Analyzing trace with hash 8294196, now seen corresponding path program 1 times [2024-11-12 17:00:05,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:05,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553807765] [2024-11-12 17:00:05,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:05,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:00:05,352 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-12 17:00:05,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:00:05,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553807765] [2024-11-12 17:00:05,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553807765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:00:05,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:00:05,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:00:05,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392404072] [2024-11-12 17:00:05,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:00:05,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:00:05,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:00:05,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:00:05,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:00:05,356 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:00:05,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:00:05,375 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-11-12 17:00:05,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:00:05,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-12 17:00:05,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:00:05,377 INFO L225 Difference]: With dead ends: 27 [2024-11-12 17:00:05,377 INFO L226 Difference]: Without dead ends: 25 [2024-11-12 17:00:05,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:00:05,378 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:00:05,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 39 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 17:00:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-12 17:00:05,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-12 17:00:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 17:00:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-11-12 17:00:05,386 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 8 [2024-11-12 17:00:05,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:00:05,386 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-12 17:00:05,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 17:00:05,387 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-11-12 17:00:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 17:00:05,387 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:00:05,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:00:05,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 17:00:05,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-12 17:00:05,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:00:05,388 INFO L85 PathProgramCache]: Analyzing trace with hash 257120114, now seen corresponding path program 1 times [2024-11-12 17:00:05,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:00:05,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147807903] [2024-11-12 17:00:05,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:00:05,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:00:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 17:00:05,430 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 17:00:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 17:00:05,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 17:00:05,468 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 17:00:05,469 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-12 17:00:05,471 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-12 17:00:05,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-12 17:00:05,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-12 17:00:05,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-12 17:00:05,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-12 17:00:05,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 17:00:05,477 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 17:00:05,501 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 17:00:05,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:00:05 BoogieIcfgContainer [2024-11-12 17:00:05,507 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 17:00:05,509 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 17:00:05,509 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 17:00:05,509 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 17:00:05,509 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:00:04" (3/4) ... [2024-11-12 17:00:05,510 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-12 17:00:05,544 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 17:00:05,544 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 17:00:05,544 INFO L158 Benchmark]: Toolchain (without parser) took 1474.51ms. Allocated memory is still 182.5MB. Free memory was 151.8MB in the beginning and 133.0MB in the end (delta: 18.9MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-12 17:00:05,545 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory was 81.8MB in the beginning and 81.7MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:00:05,545 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.48ms. Allocated memory is still 182.5MB. Free memory was 150.8MB in the beginning and 139.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 17:00:05,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.26ms. Allocated memory is still 182.5MB. Free memory was 139.2MB in the beginning and 138.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:00:05,546 INFO L158 Benchmark]: Boogie Preprocessor took 44.43ms. Allocated memory is still 182.5MB. Free memory was 138.2MB in the beginning and 136.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:00:05,546 INFO L158 Benchmark]: RCFGBuilder took 418.88ms. Allocated memory is still 182.5MB. Free memory was 136.1MB in the beginning and 119.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 17:00:05,546 INFO L158 Benchmark]: TraceAbstraction took 709.26ms. Allocated memory is still 182.5MB. Free memory was 118.3MB in the beginning and 135.1MB in the end (delta: -16.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 17:00:05,547 INFO L158 Benchmark]: Witness Printer took 35.11ms. Allocated memory is still 182.5MB. Free memory was 135.1MB in the beginning and 133.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 17:00:05,551 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 121.6MB. Free memory was 81.8MB in the beginning and 81.7MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.48ms. Allocated memory is still 182.5MB. Free memory was 150.8MB in the beginning and 139.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.26ms. Allocated memory is still 182.5MB. Free memory was 139.2MB in the beginning and 138.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.43ms. Allocated memory is still 182.5MB. Free memory was 138.2MB in the beginning and 136.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 418.88ms. Allocated memory is still 182.5MB. Free memory was 136.1MB in the beginning and 119.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 709.26ms. Allocated memory is still 182.5MB. Free memory was 118.3MB in the beginning and 135.1MB in the end (delta: -16.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 35.11ms. Allocated memory is still 182.5MB. Free memory was 135.1MB in the beginning and 133.0MB 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: 23]: integer overflow possible integer overflow possible We found a FailurePath: [L56] int *p1 = malloc(sizeof(int)); [L57] int *p2 = malloc(sizeof(int)); [L60] *p1 = __VERIFIER_nondet_int() [L61] *p2 = __VERIFIER_nondet_int() [L63] EXPR \read(*p1) [L63] *p1 < 0 || *p2 < 0 VAL [p1={-2:0}, p2={-1:0}] [L63] *p1 < 0 || *p2 < 0 [L63] EXPR \read(*p2) [L63] *p1 < 0 || *p2 < 0 VAL [p1={-2:0}, p2={-1:0}] [L63] COND FALSE !(*p1 < 0 || *p2 < 0) [L66] EXPR \read(*p2) [L66] CALL f(p1,*p2) VAL [\old(q)={-2:0}, \old(v)=2147483647] [L17] COND FALSE !(v < 0) [L22] int *tmp = malloc(sizeof(int)); [L23] v+1 VAL [\old(q)={-2:0}, \old(v)=2147483647, tmp={-3:0}] - UnprovableResult [Line: 23]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 25]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 25]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 59 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-12 17:00:05,593 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(OVERFLOW)