./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_04_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_04_good.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 83a476f7230972f2bd32ac165bdd81b2702503a3b7501d64fea6d186c4e0b266 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 04:44:01,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 04:44:01,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 04:44:01,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 04:44:01,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 04:44:01,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 04:44:01,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 04:44:01,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 04:44:01,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 04:44:01,358 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 04:44:01,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 04:44:01,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 04:44:01,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 04:44:01,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 04:44:01,358 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 04:44:01,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 04:44:01,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 04:44:01,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 04:44:01,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 04:44:01,359 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 04:44:01,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 04:44:01,359 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 04:44:01,359 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 04:44:01,360 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 04:44:01,360 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 04:44:01,360 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 04:44:01,360 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 04:44:01,360 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 04:44:01,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 04:44:01,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 04:44:01,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 04:44:01,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:44:01,360 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 04:44:01,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 04:44:01,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 04:44:01,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 04:44:01,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:44:01,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 04:44:01,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 04:44:01,361 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 04:44:01,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 04:44:01,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 04:44:01,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 04:44:01,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 04:44:01,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 04:44:01,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 04:44:01,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 04:44:01,361 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 -> 83a476f7230972f2bd32ac165bdd81b2702503a3b7501d64fea6d186c4e0b266 [2025-01-10 04:44:01,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 04:44:01,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 04:44:01,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 04:44:01,751 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 04:44:01,751 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 04:44:01,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_04_good.i [2025-01-10 04:44:03,196 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10c393d0c/3464f8fe36d0440280c8ebe60b856628/FLAG812a90f1e [2025-01-10 04:44:03,643 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 04:44:03,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_04_good.i [2025-01-10 04:44:03,661 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10c393d0c/3464f8fe36d0440280c8ebe60b856628/FLAG812a90f1e [2025-01-10 04:44:03,673 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10c393d0c/3464f8fe36d0440280c8ebe60b856628 [2025-01-10 04:44:03,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 04:44:03,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 04:44:03,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 04:44:03,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 04:44:03,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 04:44:03,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:44:03" (1/1) ... [2025-01-10 04:44:03,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20160d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:03, skipping insertion in model container [2025-01-10 04:44:03,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:44:03" (1/1) ... [2025-01-10 04:44:03,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 04:44:04,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 04:44:04,866 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 04:44:05,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 04:44:05,117 INFO L204 MainTranslator]: Completed translation [2025-01-10 04:44:05,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:05 WrapperNode [2025-01-10 04:44:05,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 04:44:05,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 04:44:05,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 04:44:05,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 04:44:05,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:05" (1/1) ... [2025-01-10 04:44:05,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:05" (1/1) ... [2025-01-10 04:44:05,158 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 207 [2025-01-10 04:44:05,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 04:44:05,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 04:44:05,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 04:44:05,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 04:44:05,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:05" (1/1) ... [2025-01-10 04:44:05,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:05" (1/1) ... [2025-01-10 04:44:05,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:05" (1/1) ... [2025-01-10 04:44:05,179 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 04:44:05,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:05" (1/1) ... [2025-01-10 04:44:05,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:05" (1/1) ... [2025-01-10 04:44:05,185 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:05" (1/1) ... [2025-01-10 04:44:05,187 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:05" (1/1) ... [2025-01-10 04:44:05,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:05" (1/1) ... [2025-01-10 04:44:05,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:05" (1/1) ... [2025-01-10 04:44:05,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:05" (1/1) ... [2025-01-10 04:44:05,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 04:44:05,204 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 04:44:05,204 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 04:44:05,204 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 04:44:05,205 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:05" (1/1) ... [2025-01-10 04:44:05,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 04:44:05,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 04:44:05,237 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-01-10 04:44:05,261 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-01-10 04:44:05,290 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-01-10 04:44:05,290 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-01-10 04:44:05,291 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-01-10 04:44:05,291 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-01-10 04:44:05,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 04:44:05,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 04:44:05,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 04:44:05,450 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 04:44:05,453 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 04:44:05,763 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-01-10 04:44:05,764 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 04:44:05,775 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 04:44:05,775 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 04:44:05,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:44:05 BoogieIcfgContainer [2025-01-10 04:44:05,776 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 04:44:05,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 04:44:05,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 04:44:05,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 04:44:05,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 04:44:03" (1/3) ... [2025-01-10 04:44:05,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8b1c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:44:05, skipping insertion in model container [2025-01-10 04:44:05,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:44:05" (2/3) ... [2025-01-10 04:44:05,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8b1c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:44:05, skipping insertion in model container [2025-01-10 04:44:05,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:44:05" (3/3) ... [2025-01-10 04:44:05,786 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_04_good.i [2025-01-10 04:44:05,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 04:44:05,799 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_rand_preinc_04_good.i that has 3 procedures, 103 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-01-10 04:44:05,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 04:44:05,858 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;@6c188d95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 04:44:05,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 04:44:05,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 82 states have (on average 1.548780487804878) internal successors, (127), 94 states have internal predecessors, (127), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 04:44:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 04:44:05,866 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:05,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:44:05,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:44:05,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:05,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1257461886, now seen corresponding path program 1 times [2025-01-10 04:44:05,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:05,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696994371] [2025-01-10 04:44:05,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:05,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:05,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 04:44:05,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 04:44:05,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:05,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:06,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:44:06,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:06,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696994371] [2025-01-10 04:44:06,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696994371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:06,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:06,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:44:06,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111547189] [2025-01-10 04:44:06,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:06,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:44:06,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:06,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:44:06,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:06,139 INFO L87 Difference]: Start difference. First operand has 103 states, 82 states have (on average 1.548780487804878) internal successors, (127), 94 states have internal predecessors, (127), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:06,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:06,177 INFO L93 Difference]: Finished difference Result 179 states and 252 transitions. [2025-01-10 04:44:06,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:44:06,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-01-10 04:44:06,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:06,183 INFO L225 Difference]: With dead ends: 179 [2025-01-10 04:44:06,184 INFO L226 Difference]: Without dead ends: 94 [2025-01-10 04:44:06,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:06,187 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 137 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:06,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 135 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:06,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-10 04:44:06,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-01-10 04:44:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.5) internal successors, (114), 87 states have internal predecessors, (114), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 04:44:06,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions. [2025-01-10 04:44:06,224 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 12 [2025-01-10 04:44:06,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:06,226 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 130 transitions. [2025-01-10 04:44:06,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2025-01-10 04:44:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 04:44:06,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:06,228 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:44:06,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 04:44:06,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:44:06,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:06,230 INFO L85 PathProgramCache]: Analyzing trace with hash -804808767, now seen corresponding path program 1 times [2025-01-10 04:44:06,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:06,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448206252] [2025-01-10 04:44:06,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:06,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:06,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 04:44:06,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 04:44:06,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:06,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:06,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:44:06,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:06,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448206252] [2025-01-10 04:44:06,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448206252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:06,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:06,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 04:44:06,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615498271] [2025-01-10 04:44:06,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:06,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 04:44:06,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:06,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 04:44:06,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 04:44:06,579 INFO L87 Difference]: Start difference. First operand 94 states and 130 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:06,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:06,665 INFO L93 Difference]: Finished difference Result 103 states and 143 transitions. [2025-01-10 04:44:06,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 04:44:06,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-01-10 04:44:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:06,666 INFO L225 Difference]: With dead ends: 103 [2025-01-10 04:44:06,666 INFO L226 Difference]: Without dead ends: 102 [2025-01-10 04:44:06,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 04:44:06,667 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 41 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:06,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 546 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-10 04:44:06,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2025-01-10 04:44:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.4938271604938271) internal successors, (121), 92 states have internal predecessors, (121), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 04:44:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 137 transitions. [2025-01-10 04:44:06,676 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 137 transitions. Word has length 18 [2025-01-10 04:44:06,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:06,677 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 137 transitions. [2025-01-10 04:44:06,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:06,677 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2025-01-10 04:44:06,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 04:44:06,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:06,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:44:06,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 04:44:06,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:44:06,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:06,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1522084711, now seen corresponding path program 1 times [2025-01-10 04:44:06,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:06,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176443108] [2025-01-10 04:44:06,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:06,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:06,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 04:44:06,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 04:44:06,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:06,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:44:06,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:06,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176443108] [2025-01-10 04:44:06,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176443108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:06,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:06,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:44:06,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801441558] [2025-01-10 04:44:06,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:06,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:44:06,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:06,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:44:06,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:06,744 INFO L87 Difference]: Start difference. First operand 99 states and 137 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:06,762 INFO L93 Difference]: Finished difference Result 100 states and 138 transitions. [2025-01-10 04:44:06,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:44:06,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-01-10 04:44:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:06,763 INFO L225 Difference]: With dead ends: 100 [2025-01-10 04:44:06,763 INFO L226 Difference]: Without dead ends: 99 [2025-01-10 04:44:06,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:06,763 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 37 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:06,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 208 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-10 04:44:06,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2025-01-10 04:44:06,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.486842105263158) internal successors, (113), 86 states have internal predecessors, (113), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 04:44:06,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2025-01-10 04:44:06,770 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 18 [2025-01-10 04:44:06,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:06,770 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2025-01-10 04:44:06,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:06,770 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2025-01-10 04:44:06,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 04:44:06,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:06,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:44:06,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 04:44:06,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:44:06,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:06,771 INFO L85 PathProgramCache]: Analyzing trace with hash 820732141, now seen corresponding path program 1 times [2025-01-10 04:44:06,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:06,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016383052] [2025-01-10 04:44:06,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:06,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:06,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 04:44:06,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 04:44:06,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:06,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 04:44:06,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:06,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016383052] [2025-01-10 04:44:06,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016383052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:06,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:06,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:44:06,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146051903] [2025-01-10 04:44:06,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:06,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:44:06,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:06,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:44:06,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:06,798 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:06,810 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2025-01-10 04:44:06,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:44:06,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-01-10 04:44:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:06,811 INFO L225 Difference]: With dead ends: 93 [2025-01-10 04:44:06,811 INFO L226 Difference]: Without dead ends: 92 [2025-01-10 04:44:06,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:06,812 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 35 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:06,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 212 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-10 04:44:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-10 04:44:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 85 states have internal predecessors, (112), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 04:44:06,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2025-01-10 04:44:06,818 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 19 [2025-01-10 04:44:06,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:06,818 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2025-01-10 04:44:06,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 04:44:06,819 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2025-01-10 04:44:06,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 04:44:06,819 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:06,819 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:44:06,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 04:44:06,820 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:44:06,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:06,820 INFO L85 PathProgramCache]: Analyzing trace with hash -2000336317, now seen corresponding path program 1 times [2025-01-10 04:44:06,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:06,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692160473] [2025-01-10 04:44:06,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:06,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:06,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 04:44:06,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 04:44:06,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:06,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 04:44:06,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:06,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692160473] [2025-01-10 04:44:06,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692160473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:06,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:06,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 04:44:06,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079551646] [2025-01-10 04:44:06,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:06,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:44:06,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:06,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:44:06,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:06,856 INFO L87 Difference]: Start difference. First operand 92 states and 128 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-01-10 04:44:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:06,873 INFO L93 Difference]: Finished difference Result 148 states and 200 transitions. [2025-01-10 04:44:06,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:44:06,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) Word has length 32 [2025-01-10 04:44:06,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:06,874 INFO L225 Difference]: With dead ends: 148 [2025-01-10 04:44:06,874 INFO L226 Difference]: Without dead ends: 90 [2025-01-10 04:44:06,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:06,875 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:06,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-10 04:44:06,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-10 04:44:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 83 states have internal predecessors, (110), 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-01-10 04:44:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2025-01-10 04:44:06,882 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 32 [2025-01-10 04:44:06,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:06,882 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2025-01-10 04:44:06,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-01-10 04:44:06,882 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2025-01-10 04:44:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-10 04:44:06,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:06,883 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:44:06,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 04:44:06,883 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:44:06,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:06,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2114690354, now seen corresponding path program 1 times [2025-01-10 04:44:06,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:06,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85426189] [2025-01-10 04:44:06,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:06,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:06,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 04:44:06,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 04:44:06,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:06,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 04:44:06,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:06,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85426189] [2025-01-10 04:44:06,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85426189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:06,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:06,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:44:06,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209989024] [2025-01-10 04:44:06,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:06,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:44:06,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:06,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:44:06,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:06,969 INFO L87 Difference]: Start difference. First operand 90 states and 122 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 04:44:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:06,983 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2025-01-10 04:44:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:44:06,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-01-10 04:44:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:06,985 INFO L225 Difference]: With dead ends: 90 [2025-01-10 04:44:06,985 INFO L226 Difference]: Without dead ends: 89 [2025-01-10 04:44:06,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:06,986 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 36 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 193 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-01-10 04:44:06,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 193 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:06,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-10 04:44:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-10 04:44:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 82 states have internal predecessors, (109), 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-01-10 04:44:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2025-01-10 04:44:07,006 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 33 [2025-01-10 04:44:07,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:07,006 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2025-01-10 04:44:07,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 04:44:07,006 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2025-01-10 04:44:07,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 04:44:07,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:07,007 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:44:07,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 04:44:07,007 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:44:07,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:07,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1130891778, now seen corresponding path program 1 times [2025-01-10 04:44:07,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:07,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493028268] [2025-01-10 04:44:07,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:07,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:07,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 04:44:07,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 04:44:07,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:07,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 04:44:07,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:07,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493028268] [2025-01-10 04:44:07,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493028268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:07,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:07,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:44:07,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317666991] [2025-01-10 04:44:07,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:07,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:44:07,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:07,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:44:07,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:07,050 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 04:44:07,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:07,063 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2025-01-10 04:44:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:44:07,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-01-10 04:44:07,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:07,064 INFO L225 Difference]: With dead ends: 89 [2025-01-10 04:44:07,064 INFO L226 Difference]: Without dead ends: 88 [2025-01-10 04:44:07,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:07,065 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 35 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:07,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 196 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-10 04:44:07,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-10 04:44:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 81 states have internal predecessors, (108), 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-01-10 04:44:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2025-01-10 04:44:07,071 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 34 [2025-01-10 04:44:07,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:07,071 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2025-01-10 04:44:07,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 04:44:07,071 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2025-01-10 04:44:07,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-10 04:44:07,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:07,072 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:44:07,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 04:44:07,073 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:44:07,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:07,073 INFO L85 PathProgramCache]: Analyzing trace with hash 403832941, now seen corresponding path program 1 times [2025-01-10 04:44:07,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:07,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165885399] [2025-01-10 04:44:07,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:07,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:07,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 04:44:07,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 04:44:07,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:07,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 04:44:07,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:07,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165885399] [2025-01-10 04:44:07,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165885399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:07,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:07,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:44:07,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83729593] [2025-01-10 04:44:07,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:07,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:44:07,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:07,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:44:07,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:07,136 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 04:44:07,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:07,150 INFO L93 Difference]: Finished difference Result 88 states and 120 transitions. [2025-01-10 04:44:07,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:44:07,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-01-10 04:44:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:07,152 INFO L225 Difference]: With dead ends: 88 [2025-01-10 04:44:07,152 INFO L226 Difference]: Without dead ends: 86 [2025-01-10 04:44:07,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:07,152 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:07,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 228 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:07,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-10 04:44:07,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-01-10 04:44:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.394736842105263) internal successors, (106), 79 states have internal predecessors, (106), 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-01-10 04:44:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2025-01-10 04:44:07,159 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 41 [2025-01-10 04:44:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:07,159 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2025-01-10 04:44:07,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 04:44:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2025-01-10 04:44:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-10 04:44:07,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 04:44:07,160 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:44:07,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 04:44:07,160 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 04:44:07,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 04:44:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash -517882348, now seen corresponding path program 1 times [2025-01-10 04:44:07,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 04:44:07,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626923067] [2025-01-10 04:44:07,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 04:44:07,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 04:44:07,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 04:44:07,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 04:44:07,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 04:44:07,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 04:44:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 04:44:07,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 04:44:07,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626923067] [2025-01-10 04:44:07,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626923067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 04:44:07,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 04:44:07,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 04:44:07,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046708271] [2025-01-10 04:44:07,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 04:44:07,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 04:44:07,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 04:44:07,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 04:44:07,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:07,253 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 04:44:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 04:44:07,284 INFO L93 Difference]: Finished difference Result 86 states and 118 transitions. [2025-01-10 04:44:07,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 04:44:07,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2025-01-10 04:44:07,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 04:44:07,285 INFO L225 Difference]: With dead ends: 86 [2025-01-10 04:44:07,285 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 04:44:07,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 04:44:07,286 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 04:44:07,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 227 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 04:44:07,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 04:44:07,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 04:44:07,289 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-01-10 04:44:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 04:44:07,289 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2025-01-10 04:44:07,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 04:44:07,290 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 04:44:07,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 04:44:07,290 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 04:44:07,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 04:44:07,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-01-10 04:44:07,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-01-10 04:44:07,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 04:44:07,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 04:44:07,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 04:44:07,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 04:44:07,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 04:44:07,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 04:44:07,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 04:44:07,298 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 04:44:07,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 04:44:07,518 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 04:44:07,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 04:44:07 BoogieIcfgContainer [2025-01-10 04:44:07,530 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 04:44:07,531 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 04:44:07,531 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 04:44:07,531 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 04:44:07,531 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:44:05" (3/4) ... [2025-01-10 04:44:07,532 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 04:44:07,540 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2025-01-10 04:44:07,541 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-01-10 04:44:07,549 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-10 04:44:07,550 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-10 04:44:07,550 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 04:44:07,550 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 04:44:07,641 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 04:44:07,642 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 04:44:07,642 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 04:44:07,642 INFO L158 Benchmark]: Toolchain (without parser) took 3966.52ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 50.4MB in the end (delta: 59.0MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2025-01-10 04:44:07,642 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 04:44:07,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1441.40ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 49.7MB in the end (delta: 58.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-10 04:44:07,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.48ms. Allocated memory is still 142.6MB. Free memory was 49.7MB in the beginning and 46.2MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 04:44:07,643 INFO L158 Benchmark]: Boogie Preprocessor took 44.85ms. Allocated memory is still 142.6MB. Free memory was 46.2MB in the beginning and 43.7MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 04:44:07,645 INFO L158 Benchmark]: RCFGBuilder took 571.55ms. Allocated memory is still 142.6MB. Free memory was 43.7MB in the beginning and 90.5MB in the end (delta: -46.8MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2025-01-10 04:44:07,645 INFO L158 Benchmark]: TraceAbstraction took 1751.84ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 57.4MB in the end (delta: 32.4MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2025-01-10 04:44:07,645 INFO L158 Benchmark]: Witness Printer took 110.99ms. Allocated memory is still 142.6MB. Free memory was 57.4MB in the beginning and 50.4MB in the end (delta: 7.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 04:44:07,646 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.30ms. Allocated memory is still 201.3MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1441.40ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 49.7MB in the end (delta: 58.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.48ms. Allocated memory is still 142.6MB. Free memory was 49.7MB in the beginning and 46.2MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.85ms. Allocated memory is still 142.6MB. Free memory was 46.2MB in the beginning and 43.7MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 571.55ms. Allocated memory is still 142.6MB. Free memory was 43.7MB in the beginning and 90.5MB in the end (delta: -46.8MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1751.84ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 57.4MB in the end (delta: 32.4MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * Witness Printer took 110.99ms. Allocated memory is still 142.6MB. Free memory was 57.4MB in the beginning and 50.4MB in the end (delta: 7.0MB). There was no memory consumed. 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: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1588]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1588]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1613]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1613]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1630]: 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 3 procedures, 103 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 436 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 434 mSDsluCounter, 2065 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 976 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 113 IncrementalHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 1089 mSDtfsCounter, 113 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 345 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 36/36 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 04:44:07,666 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