./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-memory-alloca/a.08-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-memory-alloca/a.08-alloca.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 6c2edc31dcdc4b2a4abe4268de27cc56aedb322bc6628c226d1c7bd6753071a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:38:46,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:38:46,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 13:38:46,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:38:46,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:38:46,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:38:46,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:38:46,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:38:46,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:38:46,668 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:38:46,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:38:46,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:38:46,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:38:46,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:38:46,670 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:38:46,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:38:46,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:38:46,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:38:46,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:38:46,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:38:46,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:38:46,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:38:46,671 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:38:46,671 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:38:46,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:38:46,671 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:38:46,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:38:46,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:38:46,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:38:46,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:38:46,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:38:46,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:38:46,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:38:46,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:38:46,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:38:46,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:38:46,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:38:46,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:38:46,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:38:46,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:38:46,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:38:46,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:38:46,674 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-jdk21/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 -> 6c2edc31dcdc4b2a4abe4268de27cc56aedb322bc6628c226d1c7bd6753071a5 [2025-02-06 13:38:46,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:38:46,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:38:46,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:38:46,977 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:38:46,977 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:38:46,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/a.08-alloca.i [2025-02-06 13:38:48,228 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a9967313/91cecacd133a4916be99e7df443d0ef8/FLAG7664f0385 [2025-02-06 13:38:48,585 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:38:48,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.08-alloca.i [2025-02-06 13:38:48,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a9967313/91cecacd133a4916be99e7df443d0ef8/FLAG7664f0385 [2025-02-06 13:38:48,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a9967313/91cecacd133a4916be99e7df443d0ef8 [2025-02-06 13:38:48,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:38:48,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:38:48,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:38:48,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:38:48,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:38:48,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:38:48" (1/1) ... [2025-02-06 13:38:48,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79da9237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:38:48, skipping insertion in model container [2025-02-06 13:38:48,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:38:48" (1/1) ... [2025-02-06 13:38:48,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:38:49,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:38:49,085 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:38:49,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:38:49,156 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:38:49,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:38:49 WrapperNode [2025-02-06 13:38:49,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:38:49,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:38:49,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:38:49,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:38:49,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:38:49" (1/1) ... [2025-02-06 13:38:49,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:38:49" (1/1) ... [2025-02-06 13:38:49,194 INFO L138 Inliner]: procedures = 111, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2025-02-06 13:38:49,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:38:49,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:38:49,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:38:49,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:38:49,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:38:49" (1/1) ... [2025-02-06 13:38:49,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:38:49" (1/1) ... [2025-02-06 13:38:49,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:38:49" (1/1) ... [2025-02-06 13:38:49,212 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 4, 5]. 45 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 5 writes are split as follows [1, 2, 2]. [2025-02-06 13:38:49,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:38:49" (1/1) ... [2025-02-06 13:38:49,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:38:49" (1/1) ... [2025-02-06 13:38:49,216 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:38:49" (1/1) ... [2025-02-06 13:38:49,216 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:38:49" (1/1) ... [2025-02-06 13:38:49,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:38:49" (1/1) ... [2025-02-06 13:38:49,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:38:49" (1/1) ... [2025-02-06 13:38:49,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:38:49,220 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:38:49,220 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:38:49,220 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:38:49,221 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:38:49" (1/1) ... [2025-02-06 13:38:49,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:38:49,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:38:49,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:38:49,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:38:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:38:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:38:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 13:38:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:38:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:38:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 13:38:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 13:38:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 13:38:49,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:38:49,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:38:49,352 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:38:49,353 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:38:49,460 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L562: havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;havoc main_#t~ret14#1; [2025-02-06 13:38:49,460 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L559: havoc test_fun_#t~mem11#1;call ULTIMATE.dealloc(test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset);havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset);havoc test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset);havoc test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset; [2025-02-06 13:38:49,469 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-06 13:38:49,469 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:38:49,476 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:38:49,476 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:38:49,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:38:49 BoogieIcfgContainer [2025-02-06 13:38:49,476 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:38:49,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:38:49,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:38:49,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:38:49,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:38:48" (1/3) ... [2025-02-06 13:38:49,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1614f15f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:38:49, skipping insertion in model container [2025-02-06 13:38:49,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:38:49" (2/3) ... [2025-02-06 13:38:49,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1614f15f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:38:49, skipping insertion in model container [2025-02-06 13:38:49,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:38:49" (3/3) ... [2025-02-06 13:38:49,485 INFO L128 eAbstractionObserver]: Analyzing ICFG a.08-alloca.i [2025-02-06 13:38:49,502 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:38:49,504 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG a.08-alloca.i that has 1 procedures, 18 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-02-06 13:38:49,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:38:49,557 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;@4ea94d2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:38:49,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 13:38:49,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:38:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 13:38:49,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:38:49,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 13:38:49,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:38:49,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:38:49,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1596488730, now seen corresponding path program 1 times [2025-02-06 13:38:49,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:38:49,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463454242] [2025-02-06 13:38:49,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:38:49,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:38:49,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 13:38:49,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 13:38:49,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:38:49,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:38:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:38:50,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:38:50,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463454242] [2025-02-06 13:38:50,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463454242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:38:50,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:38:50,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:38:50,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773173639] [2025-02-06 13:38:50,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:38:50,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:38:50,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:38:50,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:38:50,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:38:50,180 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 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-02-06 13:38:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:38:50,332 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2025-02-06 13:38:50,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:38:50,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 13:38:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:38:50,339 INFO L225 Difference]: With dead ends: 38 [2025-02-06 13:38:50,339 INFO L226 Difference]: Without dead ends: 23 [2025-02-06 13:38:50,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:38:50,344 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:38:50,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 37 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:38:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-06 13:38:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 12. [2025-02-06 13:38:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 11 states have internal predecessors, (13), 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-02-06 13:38:50,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2025-02-06 13:38:50,369 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 6 [2025-02-06 13:38:50,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:38:50,369 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2025-02-06 13:38:50,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 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-02-06 13:38:50,369 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2025-02-06 13:38:50,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 13:38:50,370 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:38:50,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:38:50,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:38:50,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:38:50,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:38:50,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2048456941, now seen corresponding path program 1 times [2025-02-06 13:38:50,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:38:50,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181813688] [2025-02-06 13:38:50,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:38:50,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:38:50,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 13:38:50,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 13:38:50,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:38:50,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:38:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:38:50,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:38:50,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181813688] [2025-02-06 13:38:50,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181813688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:38:50,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:38:50,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:38:50,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568349518] [2025-02-06 13:38:50,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:38:50,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:38:50,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:38:50,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:38:50,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:38:50,531 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:38:50,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:38:50,558 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2025-02-06 13:38:50,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:38:50,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 13:38:50,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:38:50,560 INFO L225 Difference]: With dead ends: 12 [2025-02-06 13:38:50,560 INFO L226 Difference]: Without dead ends: 11 [2025-02-06 13:38:50,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:38:50,561 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:38:50,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:38:50,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-06 13:38:50,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-06 13:38:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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-02-06 13:38:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2025-02-06 13:38:50,566 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 7 [2025-02-06 13:38:50,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:38:50,566 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-02-06 13:38:50,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:38:50,566 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2025-02-06 13:38:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 13:38:50,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:38:50,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:38:50,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:38:50,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:38:50,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:38:50,567 INFO L85 PathProgramCache]: Analyzing trace with hash 922344248, now seen corresponding path program 1 times [2025-02-06 13:38:50,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:38:50,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929097988] [2025-02-06 13:38:50,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:38:50,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:38:50,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:38:50,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:38:50,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:38:50,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:38:50,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:38:50,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:38:50,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929097988] [2025-02-06 13:38:50,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929097988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:38:50,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:38:50,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:38:50,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133207783] [2025-02-06 13:38:50,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:38:50,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:38:50,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:38:50,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:38:50,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:38:50,719 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:38:50,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:38:50,744 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2025-02-06 13:38:50,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:38:50,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 13:38:50,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:38:50,745 INFO L225 Difference]: With dead ends: 11 [2025-02-06 13:38:50,745 INFO L226 Difference]: Without dead ends: 10 [2025-02-06 13:38:50,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:38:50,746 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 12 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 [2025-02-06 13:38:50,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 12 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:38:50,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-06 13:38:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-02-06 13:38:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:38:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2025-02-06 13:38:50,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2025-02-06 13:38:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:38:50,748 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-02-06 13:38:50,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:38:50,751 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2025-02-06 13:38:50,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 13:38:50,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:38:50,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:38:50,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:38:50,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:38:50,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:38:50,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1472099407, now seen corresponding path program 1 times [2025-02-06 13:38:50,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:38:50,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982421067] [2025-02-06 13:38:50,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:38:50,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:38:50,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:38:50,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:38:50,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:38:50,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:38:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:38:50,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:38:50,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982421067] [2025-02-06 13:38:50,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982421067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:38:50,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:38:50,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:38:50,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006745591] [2025-02-06 13:38:50,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:38:50,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:38:50,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:38:50,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:38:50,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:38:50,957 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-02-06 13:38:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:38:51,040 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2025-02-06 13:38:51,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:38:51,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 13:38:51,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:38:51,041 INFO L225 Difference]: With dead ends: 10 [2025-02-06 13:38:51,041 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 13:38:51,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:38:51,042 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:38:51,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 10 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:38:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 13:38:51,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 13:38:51,043 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-02-06 13:38:51,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 13:38:51,043 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2025-02-06 13:38:51,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:38:51,043 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 13:38:51,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-02-06 13:38:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 13:38:51,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 13:38:51,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-02-06 13:38:51,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-02-06 13:38:51,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-02-06 13:38:51,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-02-06 13:38:51,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:38:51,051 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 13:38:51,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 13:38:51,063 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:38:51,073 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-06 13:38:51,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-06 13:38:51,074 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] [2025-02-06 13:38:51,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:38:51 BoogieIcfgContainer [2025-02-06 13:38:51,075 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:38:51,075 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:38:51,075 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:38:51,075 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:38:51,076 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:38:49" (3/4) ... [2025-02-06 13:38:51,078 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:38:51,085 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-06 13:38:51,086 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 13:38:51,086 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 13:38:51,086 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:38:51,160 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:38:51,160 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:38:51,160 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:38:51,162 INFO L158 Benchmark]: Toolchain (without parser) took 2365.86ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 99.2MB in the end (delta: 5.5MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2025-02-06 13:38:51,162 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:38:51,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.40ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 88.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:38:51,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.36ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 87.9MB in the end (delta: 987.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:38:51,163 INFO L158 Benchmark]: Boogie Preprocessor took 23.82ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 85.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:38:51,163 INFO L158 Benchmark]: IcfgBuilder took 256.15ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 73.1MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:38:51,163 INFO L158 Benchmark]: TraceAbstraction took 1596.03ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 105.7MB in the end (delta: -33.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:38:51,163 INFO L158 Benchmark]: Witness Printer took 84.78ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 99.2MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:38:51,166 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.24ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.40ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 88.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.36ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 87.9MB in the end (delta: 987.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.82ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 85.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 256.15ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 73.1MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1596.03ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 105.7MB in the end (delta: -33.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 84.78ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 99.2MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y_ref~0!base,]]] * 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: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 556]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 556]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 76 IncrementalHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 30 mSDtfsCounter, 76 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 13:38:51,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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