./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/McCarthy91-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/McCarthy91-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 2a5dd5c1c64cd1875ba800cc2db6d1da955f2d2f519c1964ff87558bc42b9b4c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:30:36,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:30:36,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:30:36,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:30:36,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:30:36,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:30:36,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:30:36,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:30:36,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:30:36,298 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:30:36,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:30:36,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:30:36,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:30:36,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:30:36,299 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:30:36,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:30:36,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:30:36,299 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:30:36,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:30:36,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:30:36,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:30:36,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:30:36,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:30:36,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:30:36,302 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:30:36,302 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:30:36,302 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:30:36,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:30:36,302 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:30:36,302 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:30:36,302 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:30:36,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:30:36,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:30:36,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:30:36,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:30:36,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:30:36,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:30:36,304 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:30:36,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:30:36,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:30:36,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:30:36,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:30:36,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:30:36,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:30:36,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:30:36,304 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a5dd5c1c64cd1875ba800cc2db6d1da955f2d2f519c1964ff87558bc42b9b4c [2025-02-06 14:30:36,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:30:36,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:30:36,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:30:36,594 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:30:36,594 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:30:36,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/McCarthy91-2.c [2025-02-06 14:30:37,900 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e335d0961/111e988bc09a4e57ab89f2fa2ed54d9e/FLAG227eb6012 [2025-02-06 14:30:38,144 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:30:38,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/McCarthy91-2.c [2025-02-06 14:30:38,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e335d0961/111e988bc09a4e57ab89f2fa2ed54d9e/FLAG227eb6012 [2025-02-06 14:30:38,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e335d0961/111e988bc09a4e57ab89f2fa2ed54d9e [2025-02-06 14:30:38,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:30:38,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:30:38,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:30:38,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:30:38,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:30:38,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:30:38" (1/1) ... [2025-02-06 14:30:38,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d1a6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:38, skipping insertion in model container [2025-02-06 14:30:38,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:30:38" (1/1) ... [2025-02-06 14:30:38,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:30:38,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:30:38,623 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:30:38,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:30:38,647 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:30:38,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:38 WrapperNode [2025-02-06 14:30:38,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:30:38,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:30:38,650 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:30:38,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:30:38,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:38" (1/1) ... [2025-02-06 14:30:38,661 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:38" (1/1) ... [2025-02-06 14:30:38,674 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2025-02-06 14:30:38,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:30:38,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:30:38,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:30:38,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:30:38,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:38" (1/1) ... [2025-02-06 14:30:38,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:38" (1/1) ... [2025-02-06 14:30:38,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:38" (1/1) ... [2025-02-06 14:30:38,695 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 14:30:38,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:38" (1/1) ... [2025-02-06 14:30:38,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:38" (1/1) ... [2025-02-06 14:30:38,699 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:38" (1/1) ... [2025-02-06 14:30:38,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:38" (1/1) ... [2025-02-06 14:30:38,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:38" (1/1) ... [2025-02-06 14:30:38,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:38" (1/1) ... [2025-02-06 14:30:38,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:30:38,706 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:30:38,706 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:30:38,706 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:30:38,707 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:38" (1/1) ... [2025-02-06 14:30:38,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:30:38,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:30:38,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 14:30:38,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 14:30:38,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:30:38,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:30:38,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:30:38,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:30:38,767 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2025-02-06 14:30:38,767 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2025-02-06 14:30:38,822 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:30:38,824 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:30:38,951 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L21: havoc #t~ret4;havoc #t~ret5; [2025-02-06 14:30:38,960 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-06 14:30:38,960 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:30:38,976 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:30:38,977 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:30:38,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:30:38 BoogieIcfgContainer [2025-02-06 14:30:38,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:30:38,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:30:38,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:30:38,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:30:38,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:30:38" (1/3) ... [2025-02-06 14:30:38,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227729b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:30:38, skipping insertion in model container [2025-02-06 14:30:38,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:30:38" (2/3) ... [2025-02-06 14:30:38,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227729b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:30:38, skipping insertion in model container [2025-02-06 14:30:38,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:30:38" (3/3) ... [2025-02-06 14:30:38,986 INFO L128 eAbstractionObserver]: Analyzing ICFG McCarthy91-2.c [2025-02-06 14:30:38,996 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:30:38,998 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG McCarthy91-2.c that has 2 procedures, 33 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-02-06 14:30:39,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:30:39,059 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;@7d62f78a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:30:39,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 14:30:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 14:30:39,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 14:30:39,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:30:39,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 14:30:39,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:30:39,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:30:39,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1419665204, now seen corresponding path program 1 times [2025-02-06 14:30:39,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:30:39,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285853047] [2025-02-06 14:30:39,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:39,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:30:39,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 14:30:39,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 14:30:39,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:39,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:39,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:30:39,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285853047] [2025-02-06 14:30:39,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285853047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:30:39,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:30:39,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:30:39,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387132882] [2025-02-06 14:30:39,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:30:39,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:30:39,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:39,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:30:39,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:30:39,247 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:30:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:30:39,275 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2025-02-06 14:30:39,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:30:39,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 14:30:39,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:30:39,281 INFO L225 Difference]: With dead ends: 36 [2025-02-06 14:30:39,281 INFO L226 Difference]: Without dead ends: 25 [2025-02-06 14:30:39,283 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-02-06 14:30:39,288 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:30:39,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:30:39,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-06 14:30:39,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-06 14:30:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 14:30:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2025-02-06 14:30:39,314 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 6 [2025-02-06 14:30:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:30:39,314 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2025-02-06 14:30:39,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:30:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2025-02-06 14:30:39,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 14:30:39,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:30:39,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 14:30:39,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:30:39,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:30:39,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:30:39,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1419665244, now seen corresponding path program 1 times [2025-02-06 14:30:39,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:30:39,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133062499] [2025-02-06 14:30:39,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:39,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:30:39,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 14:30:39,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 14:30:39,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:39,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:39,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:39,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:30:39,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133062499] [2025-02-06 14:30:39,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133062499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:30:39,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:30:39,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:30:39,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585627997] [2025-02-06 14:30:39,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:30:39,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:30:39,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:39,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:30:39,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:30:39,411 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:30:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:30:39,520 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2025-02-06 14:30:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:30:39,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 14:30:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:30:39,522 INFO L225 Difference]: With dead ends: 42 [2025-02-06 14:30:39,522 INFO L226 Difference]: Without dead ends: 41 [2025-02-06 14:30:39,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:30:39,523 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 24 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:30:39,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 46 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:30:39,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-06 14:30:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2025-02-06 14:30:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:30:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-02-06 14:30:39,540 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 6 [2025-02-06 14:30:39,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:30:39,540 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-02-06 14:30:39,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:30:39,540 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-02-06 14:30:39,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 14:30:39,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:30:39,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:30:39,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:30:39,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:30:39,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:30:39,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1059948354, now seen corresponding path program 1 times [2025-02-06 14:30:39,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:30:39,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973604039] [2025-02-06 14:30:39,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:39,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:30:39,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 14:30:39,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 14:30:39,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:39,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:39,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:30:39,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973604039] [2025-02-06 14:30:39,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973604039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:30:39,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:30:39,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:30:39,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890577703] [2025-02-06 14:30:39,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:30:39,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:30:39,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:39,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:30:39,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:30:39,617 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:30:39,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:30:39,690 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2025-02-06 14:30:39,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:30:39,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 14:30:39,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:30:39,692 INFO L225 Difference]: With dead ends: 57 [2025-02-06 14:30:39,692 INFO L226 Difference]: Without dead ends: 54 [2025-02-06 14:30:39,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:30:39,693 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:30:39,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 52 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:30:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-06 14:30:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2025-02-06 14:30:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 36 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:30:39,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2025-02-06 14:30:39,711 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 7 [2025-02-06 14:30:39,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:30:39,712 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2025-02-06 14:30:39,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:30:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2025-02-06 14:30:39,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 14:30:39,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:30:39,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:30:39,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:30:39,712 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:30:39,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:30:39,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1059949603, now seen corresponding path program 1 times [2025-02-06 14:30:39,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:30:39,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023673634] [2025-02-06 14:30:39,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:39,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:30:39,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 14:30:39,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 14:30:39,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:39,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:39,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:30:39,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023673634] [2025-02-06 14:30:39,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023673634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:30:39,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:30:39,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:30:39,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16135217] [2025-02-06 14:30:39,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:30:39,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:30:39,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:39,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:30:39,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:30:39,750 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:30:39,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:30:39,769 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-02-06 14:30:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:30:39,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 14:30:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:30:39,771 INFO L225 Difference]: With dead ends: 53 [2025-02-06 14:30:39,771 INFO L226 Difference]: Without dead ends: 52 [2025-02-06 14:30:39,772 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-02-06 14:30:39,772 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:30:39,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 37 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:30:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-06 14:30:39,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2025-02-06 14:30:39,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:30:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2025-02-06 14:30:39,784 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 7 [2025-02-06 14:30:39,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:30:39,784 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2025-02-06 14:30:39,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:30:39,784 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2025-02-06 14:30:39,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 14:30:39,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:30:39,785 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:30:39,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:30:39,785 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:30:39,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:30:39,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1472259172, now seen corresponding path program 1 times [2025-02-06 14:30:39,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:30:39,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155505138] [2025-02-06 14:30:39,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:39,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:30:39,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 14:30:39,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 14:30:39,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:39,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:39,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:30:39,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155505138] [2025-02-06 14:30:39,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155505138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:30:39,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:30:39,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:30:39,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286234164] [2025-02-06 14:30:39,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:30:39,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:30:39,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:39,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:30:39,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:30:39,853 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:30:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:30:39,926 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2025-02-06 14:30:39,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:30:39,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 14:30:39,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:30:39,928 INFO L225 Difference]: With dead ends: 68 [2025-02-06 14:30:39,928 INFO L226 Difference]: Without dead ends: 67 [2025-02-06 14:30:39,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:30:39,929 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:30:39,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 63 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:30:39,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-06 14:30:39,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2025-02-06 14:30:39,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 14:30:39,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2025-02-06 14:30:39,942 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 12 [2025-02-06 14:30:39,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:30:39,942 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2025-02-06 14:30:39,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:30:39,942 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2025-02-06 14:30:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 14:30:39,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:30:39,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:30:39,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 14:30:39,943 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:30:39,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:30:39,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2136061504, now seen corresponding path program 1 times [2025-02-06 14:30:39,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:30:39,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479739772] [2025-02-06 14:30:39,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:39,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:30:39,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 14:30:39,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 14:30:39,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:39,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:40,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:40,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:30:40,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479739772] [2025-02-06 14:30:40,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479739772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:30:40,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:30:40,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:30:40,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267924099] [2025-02-06 14:30:40,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:30:40,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:30:40,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:40,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:30:40,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:30:40,007 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-02-06 14:30:40,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:30:40,018 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2025-02-06 14:30:40,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:30:40,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2025-02-06 14:30:40,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:30:40,019 INFO L225 Difference]: With dead ends: 58 [2025-02-06 14:30:40,019 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 14:30:40,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:30:40,021 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:30:40,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:30:40,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 14:30:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-06 14:30:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 36 states have internal predecessors, (40), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:30:40,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-02-06 14:30:40,039 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 13 [2025-02-06 14:30:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:30:40,039 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-02-06 14:30:40,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-02-06 14:30:40,040 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-02-06 14:30:40,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 14:30:40,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:30:40,040 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:30:40,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 14:30:40,040 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:30:40,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:30:40,041 INFO L85 PathProgramCache]: Analyzing trace with hash -505048532, now seen corresponding path program 1 times [2025-02-06 14:30:40,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:30:40,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848892264] [2025-02-06 14:30:40,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:40,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:30:40,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 14:30:40,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 14:30:40,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:40,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:30:40,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:30:40,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848892264] [2025-02-06 14:30:40,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848892264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:30:40,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:30:40,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:30:40,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363078204] [2025-02-06 14:30:40,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:30:40,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:30:40,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:40,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:30:40,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:30:40,137 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:30:40,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:30:40,292 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2025-02-06 14:30:40,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 14:30:40,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-02-06 14:30:40,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:30:40,294 INFO L225 Difference]: With dead ends: 101 [2025-02-06 14:30:40,294 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 14:30:40,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-06 14:30:40,296 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:30:40,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 68 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:30:40,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 14:30:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2025-02-06 14:30:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 66 states have internal predecessors, (70), 19 states have call successors, (19), 6 states have call predecessors, (19), 8 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2025-02-06 14:30:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2025-02-06 14:30:40,319 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 19 [2025-02-06 14:30:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:30:40,319 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2025-02-06 14:30:40,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:30:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2025-02-06 14:30:40,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 14:30:40,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:30:40,320 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:30:40,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 14:30:40,320 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:30:40,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:30:40,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1523363442, now seen corresponding path program 1 times [2025-02-06 14:30:40,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:30:40,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138831091] [2025-02-06 14:30:40,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:40,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:30:40,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 14:30:40,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 14:30:40,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:40,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 14:30:40,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:30:40,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138831091] [2025-02-06 14:30:40,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138831091] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:30:40,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557406660] [2025-02-06 14:30:40,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:40,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:30:40,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:30:40,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:30:40,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 14:30:40,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 14:30:40,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 14:30:40,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:40,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:40,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 14:30:40,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:30:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:40,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:30:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:40,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557406660] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:30:40,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:30:40,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 21 [2025-02-06 14:30:40,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122806823] [2025-02-06 14:30:40,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:30:40,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 14:30:40,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:40,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 14:30:40,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2025-02-06 14:30:40,846 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand has 22 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 17 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 14:30:41,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:30:41,441 INFO L93 Difference]: Finished difference Result 100 states and 128 transitions. [2025-02-06 14:30:41,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 14:30:41,442 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 17 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2025-02-06 14:30:41,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:30:41,443 INFO L225 Difference]: With dead ends: 100 [2025-02-06 14:30:41,444 INFO L226 Difference]: Without dead ends: 99 [2025-02-06 14:30:41,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=462, Invalid=1344, Unknown=0, NotChecked=0, Total=1806 [2025-02-06 14:30:41,445 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 120 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:30:41,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 64 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:30:41,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-06 14:30:41,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2025-02-06 14:30:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 65 states have internal predecessors, (68), 19 states have call successors, (19), 6 states have call predecessors, (19), 8 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2025-02-06 14:30:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2025-02-06 14:30:41,461 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 20 [2025-02-06 14:30:41,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:30:41,461 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2025-02-06 14:30:41,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 17 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 14:30:41,461 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2025-02-06 14:30:41,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 14:30:41,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:30:41,462 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 14:30:41,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 14:30:41,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:30:41,668 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 14:30:41,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:30:41,669 INFO L85 PathProgramCache]: Analyzing trace with hash -721137655, now seen corresponding path program 1 times [2025-02-06 14:30:41,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:30:41,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466295372] [2025-02-06 14:30:41,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:30:41,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:30:41,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 14:30:41,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 14:30:41,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:30:41,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:30:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 14:30:41,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:30:41,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466295372] [2025-02-06 14:30:41,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466295372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:30:41,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:30:41,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 14:30:41,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234632057] [2025-02-06 14:30:41,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:30:41,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:30:41,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:41,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:30:41,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:30:41,790 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:30:41,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:30:41,918 INFO L93 Difference]: Finished difference Result 93 states and 121 transitions. [2025-02-06 14:30:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 14:30:41,919 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-02-06 14:30:41,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:30:41,920 INFO L225 Difference]: With dead ends: 93 [2025-02-06 14:30:41,920 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 14:30:41,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-02-06 14:30:41,923 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:30:41,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 71 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:30:41,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 14:30:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 14:30:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:30:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 14:30:41,924 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2025-02-06 14:30:41,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:30:41,924 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 14:30:41,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:30:41,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 14:30:41,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 14:30:41,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-02-06 14:30:41,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-02-06 14:30:41,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-02-06 14:30:41,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-02-06 14:30:41,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-02-06 14:30:41,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-02-06 14:30:41,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 14:30:41,931 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:30:41,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 14:30:42,427 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 14:30:42,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:30:42 BoogieIcfgContainer [2025-02-06 14:30:42,433 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 14:30:42,434 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 14:30:42,434 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 14:30:42,434 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 14:30:42,434 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:30:38" (3/4) ... [2025-02-06 14:30:42,436 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 14:30:42,441 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f91 [2025-02-06 14:30:42,444 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-06 14:30:42,444 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 14:30:42,444 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 14:30:42,445 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 14:30:42,513 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 14:30:42,514 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 14:30:42,514 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 14:30:42,514 INFO L158 Benchmark]: Toolchain (without parser) took 4043.07ms. Allocated memory is still 167.8MB. Free memory was 125.0MB in the beginning and 47.4MB in the end (delta: 77.7MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. [2025-02-06 14:30:42,514 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:30:42,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.44ms. Allocated memory is still 167.8MB. Free memory was 125.0MB in the beginning and 115.0MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:30:42,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.84ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 113.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:30:42,515 INFO L158 Benchmark]: Boogie Preprocessor took 29.97ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 112.7MB in the end (delta: 804.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:30:42,515 INFO L158 Benchmark]: IcfgBuilder took 271.50ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 101.1MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 14:30:42,516 INFO L158 Benchmark]: TraceAbstraction took 3453.08ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 52.6MB in the end (delta: 47.8MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2025-02-06 14:30:42,516 INFO L158 Benchmark]: Witness Printer took 80.04ms. Allocated memory is still 167.8MB. Free memory was 52.6MB in the beginning and 47.4MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:30:42,517 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.35ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.44ms. Allocated memory is still 167.8MB. Free memory was 125.0MB in the beginning and 115.0MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.84ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 113.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.97ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 112.7MB in the end (delta: 804.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 271.50ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 101.1MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3453.08ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 52.6MB in the end (delta: 47.8MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. * Witness Printer took 80.04ms. Allocated memory is still 167.8MB. Free memory was 52.6MB in the beginning and 47.4MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: 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 2 procedures, 33 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 239 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 228 mSDsluCounter, 500 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 315 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 571 IncrementalHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 185 mSDtfsCounter, 571 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=7, InterpolantAutomatonStates: 78, 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, 46 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 373 SizeOfPredicates, 3 NumberOfNonLiveVariables, 57 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 54/68 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 14:30:42,528 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