./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/loop-lit/hh2012-ex2b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/loop-lit/hh2012-ex2b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 12ffe0151f66e38d44395f8b9bdd221232c7b33d9923434a587a3ef14595f89f --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:58:08,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:58:08,660 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:58:08,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:58:08,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:58:08,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:58:08,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:58:08,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:58:08,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:58:08,685 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:58:08,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:58:08,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:58:08,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:58:08,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:58:08,687 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:58:08,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:58:08,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:58:08,687 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:58:08,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:58:08,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:58:08,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:58:08,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:58:08,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:58:08,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:58:08,688 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:58:08,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:58:08,688 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:58:08,688 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:58:08,688 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:58:08,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:58:08,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:58:08,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:58:08,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:58:08,689 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:58:08,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:58:08,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:58:08,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:58:08,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:58:08,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:58:08,689 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:58:08,689 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:58:08,690 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:58:08,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:58:08,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:58:08,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:58:08,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:58:08,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:58:08,690 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 12ffe0151f66e38d44395f8b9bdd221232c7b33d9923434a587a3ef14595f89f [2025-04-29 10:58:08,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:58:08,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:58:08,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:58:08,892 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:58:08,892 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:58:08,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/hh2012-ex2b.c [2025-04-29 10:58:10,160 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b932d6ceb/fa457f1b00024d8bba9b6cf80764a813/FLAGe9a300215 [2025-04-29 10:58:10,336 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:58:10,340 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hh2012-ex2b.c [2025-04-29 10:58:10,341 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:58:10,354 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b932d6ceb/fa457f1b00024d8bba9b6cf80764a813/FLAGe9a300215 [2025-04-29 10:58:11,210 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b932d6ceb/fa457f1b00024d8bba9b6cf80764a813 [2025-04-29 10:58:11,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:58:11,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:58:11,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:58:11,214 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:58:11,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:58:11,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5836c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11, skipping insertion in model container [2025-04-29 10:58:11,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:58:11,366 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hh2012-ex2b.c[245,258] [2025-04-29 10:58:11,380 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:58:11,383 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:58:11,399 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hh2012-ex2b.c[245,258] [2025-04-29 10:58:11,406 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:58:11,415 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:58:11,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11 WrapperNode [2025-04-29 10:58:11,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:58:11,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:58:11,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:58:11,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:58:11,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,435 INFO L138 Inliner]: procedures = 7, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2025-04-29 10:58:11,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:58:11,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:58:11,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:58:11,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:58:11,442 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,447 INFO L175 MemorySlicer]: No memory access in input program. [2025-04-29 10:58:11,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,450 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,451 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:58:11,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:58:11,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:58:11,463 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:58:11,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (1/1) ... [2025-04-29 10:58:11,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:58:11,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:11,487 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 10:58:11,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 10:58:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:58:11,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:58:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-04-29 10:58:11,505 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-04-29 10:58:11,535 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:58:11,536 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:58:11,591 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-04-29 10:58:11,591 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:58:11,596 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:58:11,597 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 10:58:11,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:58:11 BoogieIcfgContainer [2025-04-29 10:58:11,597 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:58:11,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:58:11,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:58:11,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:58:11,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:58:11" (1/3) ... [2025-04-29 10:58:11,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68839257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:58:11, skipping insertion in model container [2025-04-29 10:58:11,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:11" (2/3) ... [2025-04-29 10:58:11,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68839257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:58:11, skipping insertion in model container [2025-04-29 10:58:11,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:58:11" (3/3) ... [2025-04-29 10:58:11,603 INFO L128 eAbstractionObserver]: Analyzing ICFG hh2012-ex2b.c [2025-04-29 10:58:11,612 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:58:11,614 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hh2012-ex2b.c that has 2 procedures, 17 locations, 23 edges, 1 initial locations, 1 loop locations, and 1 error locations. [2025-04-29 10:58:11,646 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:58:11,654 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@39bfbbc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:58:11,654 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:58:11,658 INFO L278 IsEmpty]: Start isEmpty. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:58:11,663 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 10:58:11,663 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:11,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 10:58:11,664 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:11,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:11,670 INFO L85 PathProgramCache]: Analyzing trace with hash 890509690, now seen corresponding path program 1 times [2025-04-29 10:58:11,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:11,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536359351] [2025-04-29 10:58:11,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:11,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:11,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 10:58:11,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 10:58:11,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:11,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:11,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:58:11,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:11,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536359351] [2025-04-29 10:58:11,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536359351] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:11,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:11,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:58:11,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376702759] [2025-04-29 10:58:11,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:11,841 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:58:11,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:11,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:58:11,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:58:11,859 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2025-04-29 10:58:11,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:11,915 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2025-04-29 10:58:11,916 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:58:11,917 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 6 [2025-04-29 10:58:11,917 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:11,921 INFO L225 Difference]: With dead ends: 33 [2025-04-29 10:58:11,921 INFO L226 Difference]: Without dead ends: 18 [2025-04-29 10:58:11,923 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:11,926 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:11,926 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 40 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:11,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-04-29 10:58:11,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-04-29 10:58:11,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 10:58:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-04-29 10:58:11,954 INFO L79 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 6 [2025-04-29 10:58:11,954 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:11,954 INFO L485 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-04-29 10:58:11,955 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2025-04-29 10:58:11,955 INFO L278 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-04-29 10:58:11,956 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 10:58:11,956 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:11,956 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:11,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:58:11,957 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:11,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:11,958 INFO L85 PathProgramCache]: Analyzing trace with hash 987579284, now seen corresponding path program 1 times [2025-04-29 10:58:11,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:11,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924533222] [2025-04-29 10:58:11,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:11,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:11,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 10:58:11,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 10:58:11,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:11,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:58:12,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:12,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924533222] [2025-04-29 10:58:12,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924533222] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:12,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:12,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:58:12,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868967158] [2025-04-29 10:58:12,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:12,001 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:58:12,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:12,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:58:12,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:58:12,002 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 10:58:12,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:12,015 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2025-04-29 10:58:12,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:58:12,015 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-04-29 10:58:12,016 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:12,016 INFO L225 Difference]: With dead ends: 38 [2025-04-29 10:58:12,016 INFO L226 Difference]: Without dead ends: 22 [2025-04-29 10:58:12,017 INFO L436 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 [2025-04-29 10:58:12,019 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:12,019 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 29 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:12,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-04-29 10:58:12,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-04-29 10:58:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-04-29 10:58:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-04-29 10:58:12,026 INFO L79 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2025-04-29 10:58:12,027 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:12,027 INFO L485 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-04-29 10:58:12,027 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-04-29 10:58:12,027 INFO L278 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-04-29 10:58:12,028 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 10:58:12,028 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:12,028 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:12,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:58:12,028 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:12,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:12,028 INFO L85 PathProgramCache]: Analyzing trace with hash -999924754, now seen corresponding path program 1 times [2025-04-29 10:58:12,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:12,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192816017] [2025-04-29 10:58:12,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:12,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:12,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 10:58:12,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 10:58:12,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:12,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:58:12,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:12,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192816017] [2025-04-29 10:58:12,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192816017] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:12,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973911171] [2025-04-29 10:58:12,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:12,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:12,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:12,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:58:12,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 10:58:12,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 10:58:12,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 10:58:12,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:12,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:12,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 10:58:12,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:58:12,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:12,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:58:12,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973911171] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:12,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:12,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-04-29 10:58:12,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913533211] [2025-04-29 10:58:12,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:12,217 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:58:12,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:12,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:58:12,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:12,217 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 10:58:12,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:12,252 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2025-04-29 10:58:12,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:58:12,253 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 22 [2025-04-29 10:58:12,253 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:12,253 INFO L225 Difference]: With dead ends: 54 [2025-04-29 10:58:12,253 INFO L226 Difference]: Without dead ends: 34 [2025-04-29 10:58:12,253 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:58:12,254 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:12,254 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:58:12,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-04-29 10:58:12,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-04-29 10:58:12,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 10:58:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2025-04-29 10:58:12,260 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 22 [2025-04-29 10:58:12,260 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:12,260 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2025-04-29 10:58:12,260 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 10:58:12,260 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2025-04-29 10:58:12,261 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 10:58:12,261 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:58:12,261 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:12,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 10:58:12,465 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:12,465 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:58:12,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:12,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1640773380, now seen corresponding path program 2 times [2025-04-29 10:58:12,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:12,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894923422] [2025-04-29 10:58:12,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:58:12,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:12,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-29 10:58:12,487 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 10:58:12,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:58:12,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:12,686 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-04-29 10:58:12,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:12,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894923422] [2025-04-29 10:58:12,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894923422] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:12,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728276190] [2025-04-29 10:58:12,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:58:12,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:12,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:12,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:58:12,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 10:58:12,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-29 10:58:12,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 10:58:12,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:58:12,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:12,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 10:58:12,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:12,804 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-29 10:58:12,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:12,925 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-29 10:58:12,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728276190] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:12,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:12,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-29 10:58:12,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587437879] [2025-04-29 10:58:12,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:12,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 10:58:12,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:12,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 10:58:12,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-04-29 10:58:12,927 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 17 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2025-04-29 10:58:13,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:58:13,012 INFO L93 Difference]: Finished difference Result 88 states and 127 transitions. [2025-04-29 10:58:13,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 10:58:13,012 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) Word has length 46 [2025-04-29 10:58:13,013 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:58:13,013 INFO L225 Difference]: With dead ends: 88 [2025-04-29 10:58:13,013 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 10:58:13,014 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-04-29 10:58:13,015 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:58:13,015 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 80 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:58:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 10:58:13,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 10:58:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:58:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 10:58:13,016 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2025-04-29 10:58:13,016 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:58:13,016 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 10:58:13,016 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2025-04-29 10:58:13,016 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 10:58:13,016 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 10:58:13,019 INFO L790 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-29 10:58:13,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 10:58:13,220 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 10:58:13,222 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-29 10:58:13,223 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-29 10:58:13,244 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 10:58:13,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 10:58:13 BoogieIcfgContainer [2025-04-29 10:58:13,255 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 10:58:13,255 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 10:58:13,255 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 10:58:13,255 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 10:58:13,256 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:58:11" (3/4) ... [2025-04-29 10:58:13,257 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 10:58:13,259 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-04-29 10:58:13,261 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-04-29 10:58:13,261 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-29 10:58:13,261 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 10:58:13,312 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 10:58:13,312 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 10:58:13,313 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 10:58:13,316 INFO L158 Benchmark]: Toolchain (without parser) took 2099.69ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 55.6MB in the end (delta: 54.4MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2025-04-29 10:58:13,316 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:58:13,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.09ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 97.3MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 10:58:13,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.96ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 95.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 10:58:13,319 INFO L158 Benchmark]: Boogie Preprocessor took 22.73ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 94.2MB in the end (delta: 998.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:58:13,319 INFO L158 Benchmark]: RCFGBuilder took 134.57ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 85.0MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 10:58:13,319 INFO L158 Benchmark]: TraceAbstraction took 1656.42ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 61.1MB in the end (delta: 23.0MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2025-04-29 10:58:13,319 INFO L158 Benchmark]: Witness Printer took 57.33ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 55.6MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 10:58:13,320 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.19ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.09ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 97.3MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.96ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 95.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.73ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 94.2MB in the end (delta: 998.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 134.57ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 85.0MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1656.42ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 61.1MB in the end (delta: 23.0MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Witness Printer took 57.33ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 55.6MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 23 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 205 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 152 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 53 mSDtfsCounter, 90 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=3, InterpolantAutomatonStates: 30, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 122 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 215/308 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (n < 61) RESULT: Ultimate proved your program to be correct! [2025-04-29 10:58:13,333 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 Result: TRUE