./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_2c.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/NestedRecursion_2c.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e757bed859e5dfb8bc677e07409ebb4da6a15dd0898403a302646229a6409be5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:55:13,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:55:13,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 08:55:13,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:55:13,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:55:13,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:55:13,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:55:13,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:55:13,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:55:13,279 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:55:13,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:55:13,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:55:13,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:55:13,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:55:13,280 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:55:13,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:55:13,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 08:55:13,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:55:13,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:55:13,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 08:55:13,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:55:13,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 08:55:13,281 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 08:55:13,281 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:55:13,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 08:55:13,281 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:55:13,281 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:55:13,281 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:55:13,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:55:13,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:55:13,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:55:13,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:55:13,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:55:13,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:55:13,282 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 08:55:13,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 08:55:13,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:55:13,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:55:13,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:55:13,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:55:13,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:55:13,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:55:13,282 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e757bed859e5dfb8bc677e07409ebb4da6a15dd0898403a302646229a6409be5 [2025-02-08 08:55:13,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:55:13,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:55:13,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:55:13,594 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:55:13,594 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:55:13,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_2c.c [2025-02-08 08:55:14,777 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d63392f4/7c5934f24ed24c25bf1e2be9f5e37e34/FLAG22b53ac27 [2025-02-08 08:55:14,993 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:55:14,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_2c.c [2025-02-08 08:55:15,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d63392f4/7c5934f24ed24c25bf1e2be9f5e37e34/FLAG22b53ac27 [2025-02-08 08:55:15,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d63392f4/7c5934f24ed24c25bf1e2be9f5e37e34 [2025-02-08 08:55:15,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:55:15,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:55:15,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:55:15,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:55:15,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:55:15,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:55:15" (1/1) ... [2025-02-08 08:55:15,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ffdba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:15, skipping insertion in model container [2025-02-08 08:55:15,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:55:15" (1/1) ... [2025-02-08 08:55:15,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:55:15,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:55:15,157 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:55:15,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:55:15,172 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:55:15,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:15 WrapperNode [2025-02-08 08:55:15,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:55:15,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:55:15,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:55:15,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:55:15,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:15" (1/1) ... [2025-02-08 08:55:15,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:15" (1/1) ... [2025-02-08 08:55:15,189 INFO L138 Inliner]: procedures = 5, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12 [2025-02-08 08:55:15,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:55:15,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:55:15,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:55:15,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:55:15,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:15" (1/1) ... [2025-02-08 08:55:15,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:15" (1/1) ... [2025-02-08 08:55:15,195 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:15" (1/1) ... [2025-02-08 08:55:15,198 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 08:55:15,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:15" (1/1) ... [2025-02-08 08:55:15,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:15" (1/1) ... [2025-02-08 08:55:15,199 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:15" (1/1) ... [2025-02-08 08:55:15,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:15" (1/1) ... [2025-02-08 08:55:15,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:15" (1/1) ... [2025-02-08 08:55:15,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:15" (1/1) ... [2025-02-08 08:55:15,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:55:15,202 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:55:15,202 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:55:15,202 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:55:15,202 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:15" (1/1) ... [2025-02-08 08:55:15,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:55:15,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:15,231 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-08 08:55:15,239 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-08 08:55:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure g [2025-02-08 08:55:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2025-02-08 08:55:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:55:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:55:15,289 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:55:15,291 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:55:15,359 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-02-08 08:55:15,359 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:55:15,365 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:55:15,365 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:55:15,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:55:15 BoogieIcfgContainer [2025-02-08 08:55:15,365 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:55:15,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:55:15,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:55:15,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:55:15,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:55:15" (1/3) ... [2025-02-08 08:55:15,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108f5c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:55:15, skipping insertion in model container [2025-02-08 08:55:15,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:55:15" (2/3) ... [2025-02-08 08:55:15,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108f5c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:55:15, skipping insertion in model container [2025-02-08 08:55:15,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:55:15" (3/3) ... [2025-02-08 08:55:15,372 INFO L128 eAbstractionObserver]: Analyzing ICFG NestedRecursion_2c.c [2025-02-08 08:55:15,381 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:55:15,382 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG NestedRecursion_2c.c that has 2 procedures, 23 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-02-08 08:55:15,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:55:15,417 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;@57695c5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:55:15,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 08:55:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 18 states have internal predecessors, (19), 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-08 08:55:15,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 08:55:15,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:15,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:55:15,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:15,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1508004498, now seen corresponding path program 1 times [2025-02-08 08:55:15,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:15,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259791000] [2025-02-08 08:55:15,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:15,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:15,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:55:15,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:55:15,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:15,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:15,542 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-08 08:55:15,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:15,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259791000] [2025-02-08 08:55:15,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259791000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:15,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:15,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:55:15,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275388619] [2025-02-08 08:55:15,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:15,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:55:15,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:15,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:55:15,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:55:15,560 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 18 states have internal predecessors, (19), 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 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-08 08:55:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:15,627 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2025-02-08 08:55:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:55:15,629 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-08 08:55:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:15,632 INFO L225 Difference]: With dead ends: 41 [2025-02-08 08:55:15,632 INFO L226 Difference]: Without dead ends: 31 [2025-02-08 08:55:15,634 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-08 08:55:15,635 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 22 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:15,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:15,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-08 08:55:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2025-02-08 08:55:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 22 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 08:55:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-02-08 08:55:15,657 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 6 [2025-02-08 08:55:15,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:15,657 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-02-08 08:55:15,658 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-08 08:55:15,658 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-02-08 08:55:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:55:15,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:15,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:15,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:55:15,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:15,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:15,659 INFO L85 PathProgramCache]: Analyzing trace with hash -496500839, now seen corresponding path program 1 times [2025-02-08 08:55:15,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:15,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273977154] [2025-02-08 08:55:15,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:15,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:15,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:55:15,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:55:15,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:15,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:15,695 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-08 08:55:15,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:15,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273977154] [2025-02-08 08:55:15,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273977154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:15,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:15,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:55:15,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054554924] [2025-02-08 08:55:15,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:15,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:55:15,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:15,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:55:15,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:55:15,697 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 4 states have (on average 1.5) 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-08 08:55:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:15,742 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2025-02-08 08:55:15,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:55:15,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) 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-08 08:55:15,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:15,744 INFO L225 Difference]: With dead ends: 46 [2025-02-08 08:55:15,744 INFO L226 Difference]: Without dead ends: 45 [2025-02-08 08:55:15,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-08 08:55:15,745 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:15,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 56 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:15,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-08 08:55:15,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2025-02-08 08:55:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 31 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 08:55:15,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2025-02-08 08:55:15,758 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 7 [2025-02-08 08:55:15,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:15,758 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2025-02-08 08:55:15,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) 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-08 08:55:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2025-02-08 08:55:15,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 08:55:15,758 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:15,758 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:15,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:55:15,764 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:15,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:15,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1757021964, now seen corresponding path program 1 times [2025-02-08 08:55:15,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:15,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673303664] [2025-02-08 08:55:15,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:15,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:15,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:55:15,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:55:15,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:15,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:15,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:15,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673303664] [2025-02-08 08:55:15,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673303664] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:55:15,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859417343] [2025-02-08 08:55:15,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:15,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:15,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:15,851 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-08 08:55:15,855 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-08 08:55:15,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:55:15,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:55:15,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:15,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:15,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 08:55:15,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:55:15,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:15,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:55:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:15,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859417343] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:55:15,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:55:15,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-08 08:55:15,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141398729] [2025-02-08 08:55:15,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:55:15,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:55:15,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:15,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:55:15,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:55:15,970 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:55:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:16,118 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2025-02-08 08:55:16,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:55:16,119 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 08:55:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:16,120 INFO L225 Difference]: With dead ends: 95 [2025-02-08 08:55:16,120 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 08:55:16,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-08 08:55:16,121 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 102 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:16,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 121 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:55:16,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 08:55:16,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2025-02-08 08:55:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 58 states have internal predecessors, (74), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 08:55:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2025-02-08 08:55:16,131 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 11 [2025-02-08 08:55:16,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:16,131 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2025-02-08 08:55:16,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:55:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2025-02-08 08:55:16,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 08:55:16,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:16,132 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:16,142 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-08 08:55:16,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:16,333 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:16,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:16,334 INFO L85 PathProgramCache]: Analyzing trace with hash 663001981, now seen corresponding path program 1 times [2025-02-08 08:55:16,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:16,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897365871] [2025-02-08 08:55:16,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:16,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:16,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:55:16,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:55:16,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:16,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:16,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:55:16,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:16,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897365871] [2025-02-08 08:55:16,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897365871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:16,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:16,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:55:16,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626703848] [2025-02-08 08:55:16,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:16,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:55:16,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:16,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:55:16,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:55:16,364 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:55:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:16,384 INFO L93 Difference]: Finished difference Result 116 states and 165 transitions. [2025-02-08 08:55:16,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:55:16,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-02-08 08:55:16,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:16,386 INFO L225 Difference]: With dead ends: 116 [2025-02-08 08:55:16,386 INFO L226 Difference]: Without dead ends: 115 [2025-02-08 08:55:16,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:55:16,387 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:16,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 47 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-08 08:55:16,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 98. [2025-02-08 08:55:16,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 74 states have internal predecessors, (91), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2025-02-08 08:55:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. [2025-02-08 08:55:16,409 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 126 transitions. Word has length 14 [2025-02-08 08:55:16,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:16,409 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 126 transitions. [2025-02-08 08:55:16,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:55:16,409 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2025-02-08 08:55:16,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 08:55:16,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:16,409 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:16,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:55:16,410 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:16,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:16,410 INFO L85 PathProgramCache]: Analyzing trace with hash -921775096, now seen corresponding path program 1 times [2025-02-08 08:55:16,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:16,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782137302] [2025-02-08 08:55:16,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:16,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:16,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:55:16,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:55:16,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:16,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:55:16,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:16,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782137302] [2025-02-08 08:55:16,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782137302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:16,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:16,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:55:16,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632833964] [2025-02-08 08:55:16,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:16,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:55:16,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:16,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:55:16,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:55:16,436 INFO L87 Difference]: Start difference. First operand 98 states and 126 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:55:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:16,447 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2025-02-08 08:55:16,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:55:16,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-08 08:55:16,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:16,449 INFO L225 Difference]: With dead ends: 98 [2025-02-08 08:55:16,449 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 08:55:16,449 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-08 08:55:16,450 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:16,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 31 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:16,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 08:55:16,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-08 08:55:16,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 73 states have internal predecessors, (85), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2025-02-08 08:55:16,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2025-02-08 08:55:16,461 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 15 [2025-02-08 08:55:16,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:16,461 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 120 transitions. [2025-02-08 08:55:16,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:55:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 120 transitions. [2025-02-08 08:55:16,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 08:55:16,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:16,462 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:16,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:55:16,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:16,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:16,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1039278909, now seen corresponding path program 1 times [2025-02-08 08:55:16,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:16,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806186802] [2025-02-08 08:55:16,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:16,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:16,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:55:16,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:55:16,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:16,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:16,509 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-08 08:55:16,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:16,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806186802] [2025-02-08 08:55:16,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806186802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:16,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:16,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:55:16,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793420329] [2025-02-08 08:55:16,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:16,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:55:16,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:16,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:55:16,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:55:16,511 INFO L87 Difference]: Start difference. First operand 97 states and 120 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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-08 08:55:16,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:16,591 INFO L93 Difference]: Finished difference Result 136 states and 174 transitions. [2025-02-08 08:55:16,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:55:16,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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-08 08:55:16,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:16,592 INFO L225 Difference]: With dead ends: 136 [2025-02-08 08:55:16,592 INFO L226 Difference]: Without dead ends: 135 [2025-02-08 08:55:16,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:55:16,593 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 29 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:16,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 76 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:55:16,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-08 08:55:16,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2025-02-08 08:55:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 89 states have (on average 1.1910112359550562) internal successors, (106), 97 states have internal predecessors, (106), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (32), 20 states have call predecessors, (32), 19 states have call successors, (32) [2025-02-08 08:55:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 160 transitions. [2025-02-08 08:55:16,606 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 160 transitions. Word has length 19 [2025-02-08 08:55:16,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:16,606 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 160 transitions. [2025-02-08 08:55:16,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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-08 08:55:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 160 transitions. [2025-02-08 08:55:16,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 08:55:16,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:16,607 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:16,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:55:16,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:16,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:16,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2142092210, now seen corresponding path program 1 times [2025-02-08 08:55:16,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:16,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20771472] [2025-02-08 08:55:16,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:16,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:16,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:55:16,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:55:16,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:16,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:55:16,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:16,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20771472] [2025-02-08 08:55:16,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20771472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:16,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:16,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:55:16,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689308007] [2025-02-08 08:55:16,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:16,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:55:16,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:16,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:55:16,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:55:16,655 INFO L87 Difference]: Start difference. First operand 125 states and 160 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-08 08:55:16,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:16,736 INFO L93 Difference]: Finished difference Result 155 states and 200 transitions. [2025-02-08 08:55:16,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:55:16,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 20 [2025-02-08 08:55:16,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:16,738 INFO L225 Difference]: With dead ends: 155 [2025-02-08 08:55:16,738 INFO L226 Difference]: Without dead ends: 154 [2025-02-08 08:55:16,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:55:16,738 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:16,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 75 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:55:16,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-08 08:55:16,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 143. [2025-02-08 08:55:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 111 states have internal predecessors, (121), 25 states have call successors, (25), 8 states have call predecessors, (25), 13 states have return successors, (37), 23 states have call predecessors, (37), 22 states have call successors, (37) [2025-02-08 08:55:16,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 183 transitions. [2025-02-08 08:55:16,753 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 183 transitions. Word has length 20 [2025-02-08 08:55:16,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:16,753 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 183 transitions. [2025-02-08 08:55:16,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-08 08:55:16,753 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 183 transitions. [2025-02-08 08:55:16,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 08:55:16,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:16,754 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:16,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:55:16,754 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:16,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:16,755 INFO L85 PathProgramCache]: Analyzing trace with hash -908531391, now seen corresponding path program 2 times [2025-02-08 08:55:16,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:16,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118019550] [2025-02-08 08:55:16,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:55:16,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:16,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 08:55:16,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:55:16,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:55:16,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:55:16,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:16,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118019550] [2025-02-08 08:55:16,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118019550] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:55:16,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133669127] [2025-02-08 08:55:16,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:55:16,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:16,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:16,846 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:55:16,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:55:16,879 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 08:55:16,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:55:16,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:55:16,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:16,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 08:55:16,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:55:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:55:16,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:55:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:55:17,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133669127] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:55:17,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:55:17,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 08:55:17,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247558790] [2025-02-08 08:55:17,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:55:17,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:55:17,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:17,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:55:17,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:55:17,015 INFO L87 Difference]: Start difference. First operand 143 states and 183 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 08:55:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:17,354 INFO L93 Difference]: Finished difference Result 214 states and 276 transitions. [2025-02-08 08:55:17,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 08:55:17,355 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-02-08 08:55:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:17,356 INFO L225 Difference]: With dead ends: 214 [2025-02-08 08:55:17,356 INFO L226 Difference]: Without dead ends: 213 [2025-02-08 08:55:17,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2025-02-08 08:55:17,357 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 133 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:17,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 173 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:55:17,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-08 08:55:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 197. [2025-02-08 08:55:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 141 states have (on average 1.177304964539007) internal successors, (166), 153 states have internal predecessors, (166), 34 states have call successors, (34), 11 states have call predecessors, (34), 19 states have return successors, (52), 32 states have call predecessors, (52), 31 states have call successors, (52) [2025-02-08 08:55:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 252 transitions. [2025-02-08 08:55:17,393 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 252 transitions. Word has length 24 [2025-02-08 08:55:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:17,393 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 252 transitions. [2025-02-08 08:55:17,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 08:55:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 252 transitions. [2025-02-08 08:55:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 08:55:17,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:17,394 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-02-08 08:55:17,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:55:17,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:17,595 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:17,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:17,595 INFO L85 PathProgramCache]: Analyzing trace with hash 156465938, now seen corresponding path program 2 times [2025-02-08 08:55:17,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:17,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961474844] [2025-02-08 08:55:17,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:55:17,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:17,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-08 08:55:17,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:55:17,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:55:17,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:17,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:17,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961474844] [2025-02-08 08:55:17,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961474844] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:55:17,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628278783] [2025-02-08 08:55:17,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:55:17,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:17,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:17,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:55:17,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:55:17,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-08 08:55:17,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:55:17,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:55:17,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:17,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 08:55:17,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:55:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:17,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:55:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:17,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628278783] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:55:17,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:55:17,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-02-08 08:55:17,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399860357] [2025-02-08 08:55:17,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:55:17,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 08:55:17,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:17,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 08:55:17,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-02-08 08:55:17,963 INFO L87 Difference]: Start difference. First operand 197 states and 252 transitions. Second operand has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 14 states have internal predecessors, (41), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:55:18,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:18,289 INFO L93 Difference]: Finished difference Result 318 states and 413 transitions. [2025-02-08 08:55:18,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 08:55:18,290 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 14 states have internal predecessors, (41), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-08 08:55:18,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:18,292 INFO L225 Difference]: With dead ends: 318 [2025-02-08 08:55:18,292 INFO L226 Difference]: Without dead ends: 317 [2025-02-08 08:55:18,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 08:55:18,293 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 377 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:18,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 227 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:55:18,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-08 08:55:18,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 305. [2025-02-08 08:55:18,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 219 states have (on average 1.1689497716894977) internal successors, (256), 237 states have internal predecessors, (256), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) [2025-02-08 08:55:18,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 390 transitions. [2025-02-08 08:55:18,328 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 390 transitions. Word has length 26 [2025-02-08 08:55:18,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:18,328 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 390 transitions. [2025-02-08 08:55:18,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 14 states have internal predecessors, (41), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:55:18,328 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 390 transitions. [2025-02-08 08:55:18,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 08:55:18,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:18,329 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:18,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:55:18,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:18,530 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:18,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:18,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2141652058, now seen corresponding path program 1 times [2025-02-08 08:55:18,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:18,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534299954] [2025-02-08 08:55:18,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:18,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:18,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 08:55:18,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 08:55:18,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:18,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 08:55:18,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:18,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534299954] [2025-02-08 08:55:18,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534299954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:18,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:18,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:55:18,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994131456] [2025-02-08 08:55:18,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:18,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:55:18,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:18,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:55:18,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:55:18,593 INFO L87 Difference]: Start difference. First operand 305 states and 390 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 08:55:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:18,650 INFO L93 Difference]: Finished difference Result 305 states and 390 transitions. [2025-02-08 08:55:18,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:55:18,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2025-02-08 08:55:18,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:18,652 INFO L225 Difference]: With dead ends: 305 [2025-02-08 08:55:18,652 INFO L226 Difference]: Without dead ends: 304 [2025-02-08 08:55:18,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:55:18,653 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:18,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 55 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:18,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-02-08 08:55:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-02-08 08:55:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 219 states have (on average 1.091324200913242) internal successors, (239), 236 states have internal predecessors, (239), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) [2025-02-08 08:55:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 373 transitions. [2025-02-08 08:55:18,694 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 373 transitions. Word has length 30 [2025-02-08 08:55:18,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:18,694 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 373 transitions. [2025-02-08 08:55:18,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 08:55:18,694 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 373 transitions. [2025-02-08 08:55:18,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 08:55:18,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:18,699 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-08 08:55:18,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:55:18,699 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:18,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:18,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1624274100, now seen corresponding path program 1 times [2025-02-08 08:55:18,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:18,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076805609] [2025-02-08 08:55:18,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:18,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:18,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 08:55:18,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 08:55:18,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:18,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:18,830 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-08 08:55:18,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:18,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076805609] [2025-02-08 08:55:18,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076805609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:18,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:18,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:55:18,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687174045] [2025-02-08 08:55:18,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:18,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:55:18,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:18,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:55:18,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:55:18,831 INFO L87 Difference]: Start difference. First operand 304 states and 373 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-08 08:55:18,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:18,935 INFO L93 Difference]: Finished difference Result 326 states and 415 transitions. [2025-02-08 08:55:18,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:55:18,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-08 08:55:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:18,936 INFO L225 Difference]: With dead ends: 326 [2025-02-08 08:55:18,937 INFO L226 Difference]: Without dead ends: 325 [2025-02-08 08:55:18,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:55:18,937 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:18,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 78 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:18,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-02-08 08:55:18,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 320. [2025-02-08 08:55:18,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 231 states have (on average 1.0952380952380953) internal successors, (253), 248 states have internal predecessors, (253), 55 states have call successors, (55), 18 states have call predecessors, (55), 32 states have return successors, (70), 53 states have call predecessors, (70), 52 states have call successors, (70) [2025-02-08 08:55:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 378 transitions. [2025-02-08 08:55:18,962 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 378 transitions. Word has length 35 [2025-02-08 08:55:18,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:18,962 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 378 transitions. [2025-02-08 08:55:18,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-08 08:55:18,962 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 378 transitions. [2025-02-08 08:55:18,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 08:55:18,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:18,963 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:18,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:55:18,963 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:18,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:18,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1187110473, now seen corresponding path program 1 times [2025-02-08 08:55:18,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:18,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675552895] [2025-02-08 08:55:18,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:55:18,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:18,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 08:55:18,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 08:55:18,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:55:18,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 08:55:19,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:19,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675552895] [2025-02-08 08:55:19,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675552895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:19,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:19,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:55:19,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553596586] [2025-02-08 08:55:19,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:19,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:55:19,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:19,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:55:19,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:55:19,015 INFO L87 Difference]: Start difference. First operand 320 states and 378 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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-08 08:55:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:19,112 INFO L93 Difference]: Finished difference Result 325 states and 414 transitions. [2025-02-08 08:55:19,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:55:19,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 36 [2025-02-08 08:55:19,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:19,114 INFO L225 Difference]: With dead ends: 325 [2025-02-08 08:55:19,114 INFO L226 Difference]: Without dead ends: 324 [2025-02-08 08:55:19,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:55:19,114 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:19,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 70 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:19,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-02-08 08:55:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 319. [2025-02-08 08:55:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 231 states have (on average 1.0865800865800865) internal successors, (251), 247 states have internal predecessors, (251), 55 states have call successors, (55), 18 states have call predecessors, (55), 32 states have return successors, (70), 53 states have call predecessors, (70), 52 states have call successors, (70) [2025-02-08 08:55:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 376 transitions. [2025-02-08 08:55:19,139 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 376 transitions. Word has length 36 [2025-02-08 08:55:19,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:19,139 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 376 transitions. [2025-02-08 08:55:19,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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-08 08:55:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 376 transitions. [2025-02-08 08:55:19,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 08:55:19,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:19,140 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:19,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:55:19,141 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:19,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:19,141 INFO L85 PathProgramCache]: Analyzing trace with hash 25643069, now seen corresponding path program 3 times [2025-02-08 08:55:19,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:19,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881795278] [2025-02-08 08:55:19,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:55:19,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:19,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 7 equivalence classes. [2025-02-08 08:55:19,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 08:55:19,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-08 08:55:19,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:19,303 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:55:19,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:19,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881795278] [2025-02-08 08:55:19,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881795278] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:55:19,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160434762] [2025-02-08 08:55:19,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:55:19,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:19,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:19,309 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:55:19,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:55:19,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 7 equivalence classes. [2025-02-08 08:55:19,340 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 08:55:19,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-08 08:55:19,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:19,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 08:55:19,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:55:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:55:19,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:55:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:55:19,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160434762] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:55:19,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:55:19,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-02-08 08:55:19,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672906921] [2025-02-08 08:55:19,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:55:19,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-08 08:55:19,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:19,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-08 08:55:19,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2025-02-08 08:55:19,688 INFO L87 Difference]: Start difference. First operand 319 states and 376 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 16 states have internal predecessors, (54), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 08:55:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:20,342 INFO L93 Difference]: Finished difference Result 455 states and 579 transitions. [2025-02-08 08:55:20,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-02-08 08:55:20,342 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 16 states have internal predecessors, (54), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2025-02-08 08:55:20,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:20,344 INFO L225 Difference]: With dead ends: 455 [2025-02-08 08:55:20,344 INFO L226 Difference]: Without dead ends: 454 [2025-02-08 08:55:20,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=721, Invalid=2471, Unknown=0, NotChecked=0, Total=3192 [2025-02-08 08:55:20,346 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 449 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:20,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 152 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 08:55:20,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-02-08 08:55:20,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 427. [2025-02-08 08:55:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 309 states have (on average 1.0841423948220066) internal successors, (335), 331 states have internal predecessors, (335), 73 states have call successors, (73), 24 states have call predecessors, (73), 44 states have return successors, (94), 71 states have call predecessors, (94), 70 states have call successors, (94) [2025-02-08 08:55:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 502 transitions. [2025-02-08 08:55:20,377 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 502 transitions. Word has length 39 [2025-02-08 08:55:20,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:20,377 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 502 transitions. [2025-02-08 08:55:20,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 16 states have internal predecessors, (54), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 08:55:20,378 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 502 transitions. [2025-02-08 08:55:20,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 08:55:20,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:20,378 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:20,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 08:55:20,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 08:55:20,583 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:20,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:20,583 INFO L85 PathProgramCache]: Analyzing trace with hash -984225238, now seen corresponding path program 2 times [2025-02-08 08:55:20,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:20,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194169359] [2025-02-08 08:55:20,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:55:20,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:20,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-02-08 08:55:20,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 08:55:20,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:55:20,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 08:55:20,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:20,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194169359] [2025-02-08 08:55:20,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194169359] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:55:20,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068366002] [2025-02-08 08:55:20,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:55:20,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:20,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:20,655 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:55:20,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:55:20,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-02-08 08:55:20,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 08:55:20,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:55:20,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:20,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 08:55:20,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:55:20,717 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 08:55:20,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:55:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 08:55:20,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068366002] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:55:20,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:55:20,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-02-08 08:55:20,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300725697] [2025-02-08 08:55:20,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:55:20,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 08:55:20,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:20,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 08:55:20,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-02-08 08:55:20,816 INFO L87 Difference]: Start difference. First operand 427 states and 502 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 08:55:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:21,128 INFO L93 Difference]: Finished difference Result 486 states and 622 transitions. [2025-02-08 08:55:21,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-08 08:55:21,128 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 40 [2025-02-08 08:55:21,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:21,130 INFO L225 Difference]: With dead ends: 486 [2025-02-08 08:55:21,130 INFO L226 Difference]: Without dead ends: 485 [2025-02-08 08:55:21,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=328, Invalid=1154, Unknown=0, NotChecked=0, Total=1482 [2025-02-08 08:55:21,131 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 76 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:21,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 157 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:55:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-02-08 08:55:21,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 481. [2025-02-08 08:55:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 348 states have (on average 1.0833333333333333) internal successors, (377), 373 states have internal predecessors, (377), 82 states have call successors, (82), 27 states have call predecessors, (82), 50 states have return successors, (106), 80 states have call predecessors, (106), 79 states have call successors, (106) [2025-02-08 08:55:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 565 transitions. [2025-02-08 08:55:21,152 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 565 transitions. Word has length 40 [2025-02-08 08:55:21,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:21,152 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 565 transitions. [2025-02-08 08:55:21,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 08:55:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 565 transitions. [2025-02-08 08:55:21,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 08:55:21,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:21,154 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1] [2025-02-08 08:55:21,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 08:55:21,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-08 08:55:21,355 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:21,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:21,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1399201838, now seen corresponding path program 3 times [2025-02-08 08:55:21,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:21,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579646393] [2025-02-08 08:55:21,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:55:21,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:21,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-02-08 08:55:21,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 08:55:21,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 08:55:21,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:21,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:21,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579646393] [2025-02-08 08:55:21,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579646393] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:55:21,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128174284] [2025-02-08 08:55:21,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:55:21,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:21,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:21,653 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:55:21,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:55:21,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 11 equivalence classes. [2025-02-08 08:55:21,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 08:55:21,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 08:55:21,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:21,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 08:55:21,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:55:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:21,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:55:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:22,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128174284] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:55:22,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:55:22,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-02-08 08:55:22,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948391617] [2025-02-08 08:55:22,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:55:22,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-08 08:55:22,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:22,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-08 08:55:22,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 08:55:22,169 INFO L87 Difference]: Start difference. First operand 481 states and 565 transitions. Second operand has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 26 states have internal predecessors, (89), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:55:22,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:22,885 INFO L93 Difference]: Finished difference Result 702 states and 907 transitions. [2025-02-08 08:55:22,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-08 08:55:22,886 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 26 states have internal predecessors, (89), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-02-08 08:55:22,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:22,888 INFO L225 Difference]: With dead ends: 702 [2025-02-08 08:55:22,888 INFO L226 Difference]: Without dead ends: 701 [2025-02-08 08:55:22,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2025-02-08 08:55:22,890 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 845 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:22,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 437 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 08:55:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-02-08 08:55:22,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 697. [2025-02-08 08:55:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 504 states have (on average 1.0813492063492063) internal successors, (545), 541 states have internal predecessors, (545), 118 states have call successors, (118), 39 states have call predecessors, (118), 74 states have return successors, (154), 116 states have call predecessors, (154), 115 states have call successors, (154) [2025-02-08 08:55:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 817 transitions. [2025-02-08 08:55:22,945 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 817 transitions. Word has length 56 [2025-02-08 08:55:22,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:22,945 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 817 transitions. [2025-02-08 08:55:22,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 26 states have internal predecessors, (89), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:55:22,945 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 817 transitions. [2025-02-08 08:55:22,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 08:55:22,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:22,949 INFO L218 NwaCegarLoop]: trace histogram [9, 7, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:22,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 08:55:23,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 08:55:23,150 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:23,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:23,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1244477492, now seen corresponding path program 3 times [2025-02-08 08:55:23,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:23,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860343021] [2025-02-08 08:55:23,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:55:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:23,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 9 equivalence classes. [2025-02-08 08:55:23,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 47 of 55 statements. [2025-02-08 08:55:23,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-08 08:55:23,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:23,435 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 74 proven. 42 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 08:55:23,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:23,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860343021] [2025-02-08 08:55:23,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860343021] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:55:23,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254753594] [2025-02-08 08:55:23,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:55:23,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:23,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:23,438 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:55:23,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:55:23,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 9 equivalence classes. [2025-02-08 08:55:23,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 47 of 55 statements. [2025-02-08 08:55:23,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-08 08:55:23,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:23,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 08:55:23,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:55:23,530 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 74 proven. 42 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 08:55:23,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:55:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 74 proven. 42 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 08:55:23,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254753594] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:55:23,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:55:23,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2025-02-08 08:55:23,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725461999] [2025-02-08 08:55:23,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:55:23,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 08:55:23,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:23,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 08:55:23,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2025-02-08 08:55:23,754 INFO L87 Difference]: Start difference. First operand 697 states and 817 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 16 states have internal predecessors, (61), 11 states have call successors, (13), 11 states have call predecessors, (13), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 08:55:24,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:24,609 INFO L93 Difference]: Finished difference Result 810 states and 1039 transitions. [2025-02-08 08:55:24,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-02-08 08:55:24,609 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 16 states have internal predecessors, (61), 11 states have call successors, (13), 11 states have call predecessors, (13), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2025-02-08 08:55:24,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:24,616 INFO L225 Difference]: With dead ends: 810 [2025-02-08 08:55:24,616 INFO L226 Difference]: Without dead ends: 809 [2025-02-08 08:55:24,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1399, Invalid=5081, Unknown=0, NotChecked=0, Total=6480 [2025-02-08 08:55:24,618 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 320 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:24,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 162 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:55:24,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-02-08 08:55:24,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 409. [2025-02-08 08:55:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 306 states have (on average 1.1143790849673203) internal successors, (341), 307 states have internal predecessors, (341), 69 states have call successors, (69), 34 states have call predecessors, (69), 33 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-08 08:55:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 477 transitions. [2025-02-08 08:55:24,662 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 477 transitions. Word has length 55 [2025-02-08 08:55:24,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:24,663 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 477 transitions. [2025-02-08 08:55:24,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 16 states have internal predecessors, (61), 11 states have call successors, (13), 11 states have call predecessors, (13), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 08:55:24,663 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 477 transitions. [2025-02-08 08:55:24,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-08 08:55:24,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:24,664 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:24,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 08:55:24,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:24,865 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:24,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:24,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1963102141, now seen corresponding path program 4 times [2025-02-08 08:55:24,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:24,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519377640] [2025-02-08 08:55:24,869 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:55:24,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:24,876 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-02-08 08:55:24,879 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 42 of 69 statements. [2025-02-08 08:55:24,879 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 08:55:24,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-02-08 08:55:24,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:24,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519377640] [2025-02-08 08:55:24,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519377640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:24,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:24,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:55:24,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616894239] [2025-02-08 08:55:24,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:24,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:55:24,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:24,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:55:24,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:55:24,912 INFO L87 Difference]: Start difference. First operand 409 states and 477 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:55:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:24,959 INFO L93 Difference]: Finished difference Result 939 states and 1196 transitions. [2025-02-08 08:55:24,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:55:24,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2025-02-08 08:55:24,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:24,961 INFO L225 Difference]: With dead ends: 939 [2025-02-08 08:55:24,961 INFO L226 Difference]: Without dead ends: 642 [2025-02-08 08:55:24,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:55:24,963 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:24,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 61 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:24,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-02-08 08:55:24,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 607. [2025-02-08 08:55:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 439 states have (on average 1.0774487471526195) internal successors, (473), 471 states have internal predecessors, (473), 102 states have call successors, (102), 35 states have call predecessors, (102), 65 states have return successors, (133), 100 states have call predecessors, (133), 100 states have call successors, (133) [2025-02-08 08:55:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 708 transitions. [2025-02-08 08:55:24,993 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 708 transitions. Word has length 69 [2025-02-08 08:55:24,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:24,994 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 708 transitions. [2025-02-08 08:55:24,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:55:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 708 transitions. [2025-02-08 08:55:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 08:55:24,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:24,995 INFO L218 NwaCegarLoop]: trace histogram [15, 13, 12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:24,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 08:55:24,996 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:24,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:24,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1316320628, now seen corresponding path program 4 times [2025-02-08 08:55:24,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:24,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549257910] [2025-02-08 08:55:24,996 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:55:24,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:24,999 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-02-08 08:55:25,005 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 08:55:25,005 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:55:25,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 158 proven. 255 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 08:55:25,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:25,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549257910] [2025-02-08 08:55:25,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549257910] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:55:25,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489644785] [2025-02-08 08:55:25,348 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:55:25,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:25,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:25,351 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:55:25,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 08:55:25,372 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-02-08 08:55:25,385 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 08:55:25,385 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:55:25,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:25,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 08:55:25,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:55:25,448 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 158 proven. 255 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 08:55:25,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:55:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 158 proven. 255 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 08:55:25,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489644785] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:55:25,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:55:25,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2025-02-08 08:55:25,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234953505] [2025-02-08 08:55:25,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:55:25,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-08 08:55:25,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:25,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-08 08:55:26,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=2086, Unknown=0, NotChecked=0, Total=2652 [2025-02-08 08:55:26,000 INFO L87 Difference]: Start difference. First operand 607 states and 708 transitions. Second operand has 52 states, 51 states have (on average 2.1372549019607843) internal successors, (109), 28 states have internal predecessors, (109), 23 states have call successors, (25), 23 states have call predecessors, (25), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 08:55:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:28,456 INFO L93 Difference]: Finished difference Result 826 states and 1018 transitions. [2025-02-08 08:55:28,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2025-02-08 08:55:28,456 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.1372549019607843) internal successors, (109), 28 states have internal predecessors, (109), 23 states have call successors, (25), 23 states have call predecessors, (25), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 85 [2025-02-08 08:55:28,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:28,459 INFO L225 Difference]: With dead ends: 826 [2025-02-08 08:55:28,459 INFO L226 Difference]: Without dead ends: 825 [2025-02-08 08:55:28,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7753 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=5809, Invalid=21251, Unknown=0, NotChecked=0, Total=27060 [2025-02-08 08:55:28,464 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 776 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:28,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 251 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 08:55:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-02-08 08:55:28,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 823. [2025-02-08 08:55:28,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 595 states have (on average 1.0773109243697478) internal successors, (641), 639 states have internal predecessors, (641), 138 states have call successors, (138), 47 states have call predecessors, (138), 89 states have return successors, (181), 136 states have call predecessors, (181), 136 states have call successors, (181) [2025-02-08 08:55:28,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 960 transitions. [2025-02-08 08:55:28,522 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 960 transitions. Word has length 85 [2025-02-08 08:55:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:28,526 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 960 transitions. [2025-02-08 08:55:28,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.1372549019607843) internal successors, (109), 28 states have internal predecessors, (109), 23 states have call successors, (25), 23 states have call predecessors, (25), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-08 08:55:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 960 transitions. [2025-02-08 08:55:28,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-08 08:55:28,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:28,528 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1] [2025-02-08 08:55:28,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 08:55:28,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 08:55:28,734 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:28,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:28,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1063270738, now seen corresponding path program 4 times [2025-02-08 08:55:28,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:28,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463307713] [2025-02-08 08:55:28,735 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:55:28,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:28,739 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 116 statements into 2 equivalence classes. [2025-02-08 08:55:28,751 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 08:55:28,752 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:55:28,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:29,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:29,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:29,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463307713] [2025-02-08 08:55:29,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463307713] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:55:29,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304311623] [2025-02-08 08:55:29,696 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:55:29,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:29,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:29,698 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:55:29,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 08:55:29,719 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 116 statements into 2 equivalence classes. [2025-02-08 08:55:29,737 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 08:55:29,737 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:55:29,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:29,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-08 08:55:29,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:55:29,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:29,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:55:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:31,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304311623] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:55:31,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:55:31,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-02-08 08:55:31,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96784667] [2025-02-08 08:55:31,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:55:31,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-02-08 08:55:31,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:31,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-02-08 08:55:31,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2260, Invalid=6860, Unknown=0, NotChecked=0, Total=9120 [2025-02-08 08:55:31,413 INFO L87 Difference]: Start difference. First operand 823 states and 960 transitions. Second operand has 96 states, 93 states have (on average 1.989247311827957) internal successors, (185), 50 states have internal predecessors, (185), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:55:33,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:33,859 INFO L93 Difference]: Finished difference Result 1258 states and 1558 transitions. [2025-02-08 08:55:33,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-02-08 08:55:33,859 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 93 states have (on average 1.989247311827957) internal successors, (185), 50 states have internal predecessors, (185), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-02-08 08:55:33,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:33,864 INFO L225 Difference]: With dead ends: 1258 [2025-02-08 08:55:33,864 INFO L226 Difference]: Without dead ends: 1257 [2025-02-08 08:55:33,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5549, Invalid=14473, Unknown=0, NotChecked=0, Total=20022 [2025-02-08 08:55:33,866 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 2205 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2207 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:33,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2207 Valid, 771 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 08:55:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-02-08 08:55:33,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1255. [2025-02-08 08:55:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 907 states have (on average 1.0771775082690187) internal successors, (977), 975 states have internal predecessors, (977), 210 states have call successors, (210), 71 states have call predecessors, (210), 137 states have return successors, (277), 208 states have call predecessors, (277), 208 states have call successors, (277) [2025-02-08 08:55:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1464 transitions. [2025-02-08 08:55:33,916 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1464 transitions. Word has length 116 [2025-02-08 08:55:33,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:33,916 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1464 transitions. [2025-02-08 08:55:33,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 93 states have (on average 1.989247311827957) internal successors, (185), 50 states have internal predecessors, (185), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:55:33,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1464 transitions. [2025-02-08 08:55:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-08 08:55:33,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:33,921 INFO L218 NwaCegarLoop]: trace histogram [27, 25, 24, 24, 24, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:55:33,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 08:55:34,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:34,122 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:34,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:34,122 INFO L85 PathProgramCache]: Analyzing trace with hash 597024756, now seen corresponding path program 5 times [2025-02-08 08:55:34,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:34,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447258883] [2025-02-08 08:55:34,122 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:55:34,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:34,128 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 145 statements into 26 equivalence classes. [2025-02-08 08:55:34,139 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 84 of 145 statements. [2025-02-08 08:55:34,140 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-02-08 08:55:34,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:34,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 1194 trivial. 0 not checked. [2025-02-08 08:55:34,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:34,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447258883] [2025-02-08 08:55:34,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447258883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:55:34,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:55:34,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:55:34,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009067884] [2025-02-08 08:55:34,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:55:34,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:55:34,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:34,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:55:34,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:55:34,205 INFO L87 Difference]: Start difference. First operand 1255 states and 1464 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 08:55:34,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:34,291 INFO L93 Difference]: Finished difference Result 1590 states and 1890 transitions. [2025-02-08 08:55:34,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:55:34,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 145 [2025-02-08 08:55:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:34,293 INFO L225 Difference]: With dead ends: 1590 [2025-02-08 08:55:34,293 INFO L226 Difference]: Without dead ends: 239 [2025-02-08 08:55:34,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:55:34,299 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:34,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:55:34,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-02-08 08:55:34,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2025-02-08 08:55:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 189 states have (on average 1.0052910052910053) internal successors, (190), 189 states have internal predecessors, (190), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:55:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2025-02-08 08:55:34,315 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 145 [2025-02-08 08:55:34,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:34,315 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2025-02-08 08:55:34,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 08:55:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2025-02-08 08:55:34,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-02-08 08:55:34,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:34,318 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1] [2025-02-08 08:55:34,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 08:55:34,318 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:34,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:34,319 INFO L85 PathProgramCache]: Analyzing trace with hash 857943122, now seen corresponding path program 5 times [2025-02-08 08:55:34,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:34,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941908364] [2025-02-08 08:55:34,319 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:55:34,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:34,330 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 236 statements into 47 equivalence classes. [2025-02-08 08:55:34,463 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 236 of 236 statements. [2025-02-08 08:55:34,464 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-08 08:55:34,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:37,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:55:37,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941908364] [2025-02-08 08:55:37,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941908364] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:55:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326200555] [2025-02-08 08:55:37,724 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:55:37,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:37,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:55:37,726 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:55:37,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 08:55:37,761 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 236 statements into 47 equivalence classes. [2025-02-08 08:55:37,900 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 236 of 236 statements. [2025-02-08 08:55:37,901 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-08 08:55:37,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:55:37,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-02-08 08:55:37,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:55:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:38,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:55:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:55:44,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326200555] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:55:44,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:55:44,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-02-08 08:55:44,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367836456] [2025-02-08 08:55:44,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:55:44,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-02-08 08:55:44,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:55:44,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-02-08 08:55:44,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9124, Invalid=27548, Unknown=0, NotChecked=0, Total=36672 [2025-02-08 08:55:44,037 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand has 192 states, 189 states have (on average 1.9947089947089947) internal successors, (377), 98 states have internal predecessors, (377), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:55:49,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:55:49,748 INFO L93 Difference]: Finished difference Result 480 states and 527 transitions. [2025-02-08 08:55:49,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-02-08 08:55:49,748 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 189 states have (on average 1.9947089947089947) internal successors, (377), 98 states have internal predecessors, (377), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2025-02-08 08:55:49,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:55:49,750 INFO L225 Difference]: With dead ends: 480 [2025-02-08 08:55:49,750 INFO L226 Difference]: Without dead ends: 479 [2025-02-08 08:55:49,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17484 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=22613, Invalid=58897, Unknown=0, NotChecked=0, Total=81510 [2025-02-08 08:55:49,755 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 1745 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 08:55:49,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1745 Valid, 41 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 08:55:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-02-08 08:55:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2025-02-08 08:55:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 381 states have (on average 1.0026246719160106) internal successors, (382), 381 states have internal predecessors, (382), 95 states have call successors, (95), 95 states have call predecessors, (95), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:55:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 477 transitions. [2025-02-08 08:55:49,767 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 477 transitions. Word has length 236 [2025-02-08 08:55:49,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:55:49,768 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 477 transitions. [2025-02-08 08:55:49,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 189 states have (on average 1.9947089947089947) internal successors, (377), 98 states have internal predecessors, (377), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:55:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 477 transitions. [2025-02-08 08:55:49,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-02-08 08:55:49,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:55:49,772 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 1, 1, 1, 1] [2025-02-08 08:55:49,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 08:55:49,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:55:49,976 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-02-08 08:55:49,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:55:49,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1778249134, now seen corresponding path program 6 times [2025-02-08 08:55:49,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:55:49,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195887743] [2025-02-08 08:55:49,977 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 08:55:49,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:55:49,987 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 476 statements into 95 equivalence classes. [2025-02-08 08:55:50,114 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 476 of 476 statements. [2025-02-08 08:55:50,114 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-02-08 08:55:50,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:56:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:56:03,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:56:03,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195887743] [2025-02-08 08:56:03,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195887743] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:56:03,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533486247] [2025-02-08 08:56:03,318 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 08:56:03,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:56:03,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:56:03,321 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:56:03,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 08:56:03,357 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 476 statements into 95 equivalence classes. [2025-02-08 08:56:03,620 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 476 of 476 statements. [2025-02-08 08:56:03,620 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-02-08 08:56:03,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:56:03,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-02-08 08:56:03,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:56:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:56:04,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:56:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:56:25,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533486247] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:56:25,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:56:25,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2025-02-08 08:56:25,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438111517] [2025-02-08 08:56:25,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:56:25,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-02-08 08:56:25,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:56:25,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-02-08 08:56:25,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36676, Invalid=110396, Unknown=0, NotChecked=0, Total=147072 [2025-02-08 08:56:25,575 INFO L87 Difference]: Start difference. First operand 477 states and 477 transitions. Second operand has 384 states, 381 states have (on average 1.9973753280839894) internal successors, (761), 194 states have internal predecessors, (761), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)