./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound50.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a70bdaebce973cfb63a6da68866c665cdef037b6b862a38db5ed10fbf681a6e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:25:48,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:25:48,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:25:48,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:25:48,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:25:48,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:25:48,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:25:48,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:25:48,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:25:48,153 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:25:48,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:25:48,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:25:48,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:25:48,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:25:48,155 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:25:48,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:25:48,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:25:48,156 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:25:48,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:25:48,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:25:48,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:25:48,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:25:48,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:25:48,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:25:48,156 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:25:48,156 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:25:48,156 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:25:48,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:25:48,156 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:25:48,156 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:25:48,156 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:25:48,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:25:48,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:25:48,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:25:48,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:25:48,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:25:48,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:25:48,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:25:48,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:25:48,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:25:48,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:25:48,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:25:48,157 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:25:48,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:25:48,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:25:48,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:25:48,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:25:48,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:25:48,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:25:48,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:25:48,158 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a70bdaebce973cfb63a6da68866c665cdef037b6b862a38db5ed10fbf681a6e5 [2025-01-10 02:25:48,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:25:48,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:25:48,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:25:48,455 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:25:48,456 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:25:48,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound50.c [2025-01-10 02:25:49,856 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fdb8beb92/effd577f293e40fca8115adfe8c731fc/FLAGfae26514e [2025-01-10 02:25:50,139 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:25:50,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound50.c [2025-01-10 02:25:50,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fdb8beb92/effd577f293e40fca8115adfe8c731fc/FLAGfae26514e [2025-01-10 02:25:50,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fdb8beb92/effd577f293e40fca8115adfe8c731fc [2025-01-10 02:25:50,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:25:50,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:25:50,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:25:50,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:25:50,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:25:50,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:25:50" (1/1) ... [2025-01-10 02:25:50,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31623347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:50, skipping insertion in model container [2025-01-10 02:25:50,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:25:50" (1/1) ... [2025-01-10 02:25:50,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:25:50,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:25:50,371 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:25:50,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:25:50,407 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:25:50,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:50 WrapperNode [2025-01-10 02:25:50,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:25:50,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:25:50,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:25:50,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:25:50,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:50" (1/1) ... [2025-01-10 02:25:50,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:50" (1/1) ... [2025-01-10 02:25:50,458 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 134 [2025-01-10 02:25:50,458 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:25:50,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:25:50,459 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:25:50,459 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:25:50,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:50" (1/1) ... [2025-01-10 02:25:50,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:50" (1/1) ... [2025-01-10 02:25:50,476 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:50" (1/1) ... [2025-01-10 02:25:50,492 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 02:25:50,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:50" (1/1) ... [2025-01-10 02:25:50,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:50" (1/1) ... [2025-01-10 02:25:50,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:50" (1/1) ... [2025-01-10 02:25:50,502 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:50" (1/1) ... [2025-01-10 02:25:50,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:50" (1/1) ... [2025-01-10 02:25:50,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:50" (1/1) ... [2025-01-10 02:25:50,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:50" (1/1) ... [2025-01-10 02:25:50,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:25:50,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:25:50,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:25:50,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:25:50,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:50" (1/1) ... [2025-01-10 02:25:50,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:25:50,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:50,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 02:25:50,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 02:25:50,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:25:50,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:25:50,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:25:50,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:25:50,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:25:50,581 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:25:50,620 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:25:50,621 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:25:51,118 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2025-01-10 02:25:51,118 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:25:51,131 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:25:51,132 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 02:25:51,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:25:51 BoogieIcfgContainer [2025-01-10 02:25:51,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:25:51,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:25:51,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:25:51,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:25:51,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:25:50" (1/3) ... [2025-01-10 02:25:51,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7bf5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:25:51, skipping insertion in model container [2025-01-10 02:25:51,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:50" (2/3) ... [2025-01-10 02:25:51,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7bf5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:25:51, skipping insertion in model container [2025-01-10 02:25:51,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:25:51" (3/3) ... [2025-01-10 02:25:51,143 INFO L128 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound50.c [2025-01-10 02:25:51,160 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:25:51,161 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps5-ll_unwindbound50.c that has 2 procedures, 192 locations, 1 initial locations, 1 loop locations, and 86 error locations. [2025-01-10 02:25:51,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:25:51,236 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;@90ca9d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:25:51,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2025-01-10 02:25:51,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 101 states have (on average 1.900990099009901) internal successors, (192), 187 states have internal predecessors, (192), 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-01-10 02:25:51,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 02:25:51,245 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:51,245 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 02:25:51,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:25:51,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:51,251 INFO L85 PathProgramCache]: Analyzing trace with hash 889512265, now seen corresponding path program 1 times [2025-01-10 02:25:51,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:51,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327232370] [2025-01-10 02:25:51,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:51,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:51,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 02:25:51,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 02:25:51,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:51,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:51,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:25:51,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:51,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327232370] [2025-01-10 02:25:51,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327232370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:51,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:51,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:25:51,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978924614] [2025-01-10 02:25:51,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:51,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 02:25:51,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:51,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 02:25:51,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:25:51,400 INFO L87 Difference]: Start difference. First operand has 192 states, 101 states have (on average 1.900990099009901) internal successors, (192), 187 states have internal predecessors, (192), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:25:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:51,436 INFO L93 Difference]: Finished difference Result 367 states and 394 transitions. [2025-01-10 02:25:51,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 02:25:51,438 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 02:25:51,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:51,445 INFO L225 Difference]: With dead ends: 367 [2025-01-10 02:25:51,446 INFO L226 Difference]: Without dead ends: 172 [2025-01-10 02:25:51,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:25:51,455 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:51,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:25:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-10 02:25:51,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-01-10 02:25:51,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 96 states have (on average 1.7708333333333333) internal successors, (170), 168 states have internal predecessors, (170), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:25:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 174 transitions. [2025-01-10 02:25:51,511 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 174 transitions. Word has length 6 [2025-01-10 02:25:51,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:51,512 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 174 transitions. [2025-01-10 02:25:51,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:25:51,512 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 174 transitions. [2025-01-10 02:25:51,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 02:25:51,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:51,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 02:25:51,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:25:51,513 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:25:51,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:51,514 INFO L85 PathProgramCache]: Analyzing trace with hash 889568326, now seen corresponding path program 1 times [2025-01-10 02:25:51,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:51,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632048365] [2025-01-10 02:25:51,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:51,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:51,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 02:25:51,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 02:25:51,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:51,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:51,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:25:51,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:51,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632048365] [2025-01-10 02:25:51,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632048365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:51,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:51,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:25:51,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56702827] [2025-01-10 02:25:51,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:51,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:25:51,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:51,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:25:51,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:25:51,602 INFO L87 Difference]: Start difference. First operand 172 states and 174 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:25:51,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:51,661 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2025-01-10 02:25:51,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:25:51,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 02:25:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:51,662 INFO L225 Difference]: With dead ends: 172 [2025-01-10 02:25:51,663 INFO L226 Difference]: Without dead ends: 171 [2025-01-10 02:25:51,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:25:51,664 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 170 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:51,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 333 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:25:51,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-10 02:25:51,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-01-10 02:25:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 96 states have (on average 1.7604166666666667) internal successors, (169), 167 states have internal predecessors, (169), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:25:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2025-01-10 02:25:51,676 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 6 [2025-01-10 02:25:51,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:51,677 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2025-01-10 02:25:51,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:25:51,677 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2025-01-10 02:25:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 02:25:51,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:51,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:25:51,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:25:51,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:25:51,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:51,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1806814377, now seen corresponding path program 1 times [2025-01-10 02:25:51,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:51,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917365058] [2025-01-10 02:25:51,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:51,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:51,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 02:25:51,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 02:25:51,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:51,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:25:51,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:51,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917365058] [2025-01-10 02:25:51,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917365058] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:51,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:51,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:25:51,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741409150] [2025-01-10 02:25:51,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:51,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:25:51,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:51,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:25:51,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:25:51,772 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:25:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:51,818 INFO L93 Difference]: Finished difference Result 251 states and 253 transitions. [2025-01-10 02:25:51,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:25:51,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 02:25:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:51,823 INFO L225 Difference]: With dead ends: 251 [2025-01-10 02:25:51,823 INFO L226 Difference]: Without dead ends: 175 [2025-01-10 02:25:51,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:25:51,824 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 3 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:51,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 501 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:25:51,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-10 02:25:51,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-01-10 02:25:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 100 states have (on average 1.73) internal successors, (173), 171 states have internal predecessors, (173), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:25:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2025-01-10 02:25:51,839 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 7 [2025-01-10 02:25:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:51,840 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2025-01-10 02:25:51,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:25:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2025-01-10 02:25:51,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 02:25:51,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:51,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:25:51,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:25:51,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:25:51,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:51,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1181830318, now seen corresponding path program 1 times [2025-01-10 02:25:51,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:51,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343280758] [2025-01-10 02:25:51,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:51,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 02:25:51,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 02:25:51,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:51,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:25:51,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:51,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343280758] [2025-01-10 02:25:51,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343280758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:51,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:51,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:25:51,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392280476] [2025-01-10 02:25:51,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:51,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:25:51,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:51,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:25:51,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:25:51,912 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:25:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:52,298 INFO L93 Difference]: Finished difference Result 311 states and 323 transitions. [2025-01-10 02:25:52,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:25:52,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 02:25:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:52,301 INFO L225 Difference]: With dead ends: 311 [2025-01-10 02:25:52,302 INFO L226 Difference]: Without dead ends: 255 [2025-01-10 02:25:52,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:25:52,303 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 82 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:52,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 129 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:25:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-01-10 02:25:52,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 249. [2025-01-10 02:25:52,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 173 states have (on average 1.5028901734104045) internal successors, (260), 244 states have internal predecessors, (260), 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-01-10 02:25:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 266 transitions. [2025-01-10 02:25:52,328 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 266 transitions. Word has length 9 [2025-01-10 02:25:52,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:52,328 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 266 transitions. [2025-01-10 02:25:52,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:25:52,328 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 266 transitions. [2025-01-10 02:25:52,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 02:25:52,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:52,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:25:52,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:25:52,330 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:25:52,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1504231542, now seen corresponding path program 1 times [2025-01-10 02:25:52,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:52,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844639500] [2025-01-10 02:25:52,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:52,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:52,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 02:25:52,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 02:25:52,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:52,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:25:52,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:52,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844639500] [2025-01-10 02:25:52,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844639500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:52,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:52,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:25:52,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139758435] [2025-01-10 02:25:52,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:52,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:25:52,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:52,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:25:52,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:25:52,468 INFO L87 Difference]: Start difference. First operand 249 states and 266 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:25:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:52,547 INFO L93 Difference]: Finished difference Result 268 states and 280 transitions. [2025-01-10 02:25:52,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:25:52,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-10 02:25:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:52,549 INFO L225 Difference]: With dead ends: 268 [2025-01-10 02:25:52,549 INFO L226 Difference]: Without dead ends: 263 [2025-01-10 02:25:52,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:25:52,552 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 58 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:52,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 294 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:25:52,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-10 02:25:52,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 256. [2025-01-10 02:25:52,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 251 states have internal predecessors, (267), 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-01-10 02:25:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 273 transitions. [2025-01-10 02:25:52,570 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 273 transitions. Word has length 37 [2025-01-10 02:25:52,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:52,570 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 273 transitions. [2025-01-10 02:25:52,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:25:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 273 transitions. [2025-01-10 02:25:52,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-10 02:25:52,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:52,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:25:52,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:25:52,571 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:25:52,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:52,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1837470508, now seen corresponding path program 1 times [2025-01-10 02:25:52,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:52,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153612751] [2025-01-10 02:25:52,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:52,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:52,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 02:25:52,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 02:25:52,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:52,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:25:52,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:52,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153612751] [2025-01-10 02:25:52,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153612751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:52,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:52,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:25:52,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689960253] [2025-01-10 02:25:52,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:52,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:25:52,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:52,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:25:52,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:25:52,706 INFO L87 Difference]: Start difference. First operand 256 states and 273 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:25:53,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:53,096 INFO L93 Difference]: Finished difference Result 267 states and 275 transitions. [2025-01-10 02:25:53,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:25:53,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-01-10 02:25:53,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:53,098 INFO L225 Difference]: With dead ends: 267 [2025-01-10 02:25:53,099 INFO L226 Difference]: Without dead ends: 262 [2025-01-10 02:25:53,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:25:53,101 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 84 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:53,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 252 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:25:53,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-01-10 02:25:53,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 256. [2025-01-10 02:25:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 180 states have (on average 1.4555555555555555) internal successors, (262), 251 states have internal predecessors, (262), 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-01-10 02:25:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 268 transitions. [2025-01-10 02:25:53,119 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 268 transitions. Word has length 39 [2025-01-10 02:25:53,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:53,119 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 268 transitions. [2025-01-10 02:25:53,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:25:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 268 transitions. [2025-01-10 02:25:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-10 02:25:53,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:53,120 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:25:53,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 02:25:53,120 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:25:53,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:53,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1127011017, now seen corresponding path program 1 times [2025-01-10 02:25:53,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:53,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041756590] [2025-01-10 02:25:53,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:53,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:53,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 02:25:53,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 02:25:53,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:53,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:25:53,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:53,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041756590] [2025-01-10 02:25:53,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041756590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:53,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:53,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:25:53,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370573462] [2025-01-10 02:25:53,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:53,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:25:53,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:53,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:25:53,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:25:53,246 INFO L87 Difference]: Start difference. First operand 256 states and 268 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:25:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:53,608 INFO L93 Difference]: Finished difference Result 266 states and 270 transitions. [2025-01-10 02:25:53,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:25:53,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-01-10 02:25:53,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:53,610 INFO L225 Difference]: With dead ends: 266 [2025-01-10 02:25:53,610 INFO L226 Difference]: Without dead ends: 228 [2025-01-10 02:25:53,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:25:53,610 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 85 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:53,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 265 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:25:53,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-01-10 02:25:53,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 222. [2025-01-10 02:25:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 146 states have (on average 1.5342465753424657) internal successors, (224), 217 states have internal predecessors, (224), 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-01-10 02:25:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 230 transitions. [2025-01-10 02:25:53,621 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 230 transitions. Word has length 40 [2025-01-10 02:25:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:53,622 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 230 transitions. [2025-01-10 02:25:53,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:25:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 230 transitions. [2025-01-10 02:25:53,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 02:25:53,625 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:53,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:25:53,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:25:53,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:25:53,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:53,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1235073029, now seen corresponding path program 1 times [2025-01-10 02:25:53,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:53,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303024929] [2025-01-10 02:25:53,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:53,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:53,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 02:25:53,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 02:25:53,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:53,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:53,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:25:53,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:53,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303024929] [2025-01-10 02:25:53,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303024929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:53,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:53,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:25:53,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614714401] [2025-01-10 02:25:53,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:53,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:25:53,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:53,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:25:53,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:25:53,684 INFO L87 Difference]: Start difference. First operand 222 states and 230 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:25:53,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:53,702 INFO L93 Difference]: Finished difference Result 224 states and 230 transitions. [2025-01-10 02:25:53,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:25:53,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-01-10 02:25:53,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:53,704 INFO L225 Difference]: With dead ends: 224 [2025-01-10 02:25:53,704 INFO L226 Difference]: Without dead ends: 222 [2025-01-10 02:25:53,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:25:53,705 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 1 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:53,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 335 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:25:53,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-01-10 02:25:53,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-01-10 02:25:53,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 146 states have (on average 1.5205479452054795) internal successors, (222), 217 states have internal predecessors, (222), 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-01-10 02:25:53,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 228 transitions. [2025-01-10 02:25:53,712 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 228 transitions. Word has length 49 [2025-01-10 02:25:53,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:53,715 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 228 transitions. [2025-01-10 02:25:53,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:25:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 228 transitions. [2025-01-10 02:25:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-10 02:25:53,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:53,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:25:53,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:25:53,717 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:25:53,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:53,717 INFO L85 PathProgramCache]: Analyzing trace with hash -759757524, now seen corresponding path program 1 times [2025-01-10 02:25:53,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:53,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656838343] [2025-01-10 02:25:53,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:53,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:53,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 02:25:53,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 02:25:53,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:53,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:25:53,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313313034] [2025-01-10 02:25:53,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:53,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:53,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:53,755 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-01-10 02:25:53,766 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-01-10 02:25:53,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 02:25:53,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 02:25:53,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:53,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:53,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:25:53,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:25:53,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:25:53,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:53,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656838343] [2025-01-10 02:25:53,910 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:25:53,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313313034] [2025-01-10 02:25:53,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313313034] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:53,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:53,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:25:53,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472148746] [2025-01-10 02:25:53,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:53,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:25:53,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:53,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:25:53,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:25:53,912 INFO L87 Difference]: Start difference. First operand 222 states and 228 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:25:54,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:54,293 INFO L93 Difference]: Finished difference Result 365 states and 382 transitions. [2025-01-10 02:25:54,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:25:54,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-01-10 02:25:54,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:54,295 INFO L225 Difference]: With dead ends: 365 [2025-01-10 02:25:54,295 INFO L226 Difference]: Without dead ends: 311 [2025-01-10 02:25:54,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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-01-10 02:25:54,296 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 95 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:54,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 153 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:25:54,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-01-10 02:25:54,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 304. [2025-01-10 02:25:54,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 226 states have (on average 1.407079646017699) internal successors, (318), 297 states have internal predecessors, (318), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:25:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 328 transitions. [2025-01-10 02:25:54,305 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 328 transitions. Word has length 54 [2025-01-10 02:25:54,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:54,305 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 328 transitions. [2025-01-10 02:25:54,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:25:54,306 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 328 transitions. [2025-01-10 02:25:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 02:25:54,307 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:54,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:25:54,314 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-01-10 02:25:54,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:54,508 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:25:54,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:54,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1022363922, now seen corresponding path program 1 times [2025-01-10 02:25:54,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:54,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468983982] [2025-01-10 02:25:54,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:54,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:54,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 02:25:54,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 02:25:54,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:54,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:54,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:25:54,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:54,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468983982] [2025-01-10 02:25:54,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468983982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:54,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:54,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:25:54,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433177722] [2025-01-10 02:25:54,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:54,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:25:54,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:54,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:25:54,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:25:54,583 INFO L87 Difference]: Start difference. First operand 304 states and 328 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:25:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:54,671 INFO L93 Difference]: Finished difference Result 305 states and 328 transitions. [2025-01-10 02:25:54,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:25:54,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2025-01-10 02:25:54,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:54,673 INFO L225 Difference]: With dead ends: 305 [2025-01-10 02:25:54,673 INFO L226 Difference]: Without dead ends: 304 [2025-01-10 02:25:54,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:25:54,674 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 42 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:54,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 278 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:25:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-01-10 02:25:54,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-01-10 02:25:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 226 states have (on average 1.4026548672566372) internal successors, (317), 297 states have internal predecessors, (317), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:25:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 327 transitions. [2025-01-10 02:25:54,687 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 327 transitions. Word has length 60 [2025-01-10 02:25:54,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:54,688 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 327 transitions. [2025-01-10 02:25:54,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:25:54,688 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 327 transitions. [2025-01-10 02:25:54,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 02:25:54,690 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:54,690 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:25:54,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 02:25:54,690 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:25:54,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:54,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1630547131, now seen corresponding path program 1 times [2025-01-10 02:25:54,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:54,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046130573] [2025-01-10 02:25:54,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:54,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:54,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 02:25:54,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 02:25:54,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:54,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:54,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:25:54,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:54,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046130573] [2025-01-10 02:25:54,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046130573] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:25:54,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746850473] [2025-01-10 02:25:54,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:54,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:54,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:54,838 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-01-10 02:25:54,840 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-01-10 02:25:54,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 02:25:54,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 02:25:54,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:54,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:54,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:25:54,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:25:55,003 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:25:55,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746850473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:55,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:25:55,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-10 02:25:55,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669328591] [2025-01-10 02:25:55,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:55,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:25:55,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:55,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:25:55,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:25:55,005 INFO L87 Difference]: Start difference. First operand 304 states and 327 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:25:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:55,053 INFO L93 Difference]: Finished difference Result 416 states and 446 transitions. [2025-01-10 02:25:55,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:25:55,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-01-10 02:25:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:55,056 INFO L225 Difference]: With dead ends: 416 [2025-01-10 02:25:55,056 INFO L226 Difference]: Without dead ends: 415 [2025-01-10 02:25:55,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:25:55,057 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 118 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:55,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 781 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:25:55,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-01-10 02:25:55,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 377. [2025-01-10 02:25:55,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 297 states have (on average 1.4175084175084176) internal successors, (421), 369 states have internal predecessors, (421), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:25:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 435 transitions. [2025-01-10 02:25:55,071 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 435 transitions. Word has length 63 [2025-01-10 02:25:55,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:55,071 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 435 transitions. [2025-01-10 02:25:55,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:25:55,071 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 435 transitions. [2025-01-10 02:25:55,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 02:25:55,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:55,073 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:25:55,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 02:25:55,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:55,278 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:25:55,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:55,280 INFO L85 PathProgramCache]: Analyzing trace with hash 785101852, now seen corresponding path program 1 times [2025-01-10 02:25:55,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:55,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016131970] [2025-01-10 02:25:55,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:55,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:55,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 02:25:55,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 02:25:55,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:55,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:25:55,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [857515592] [2025-01-10 02:25:55,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:55,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:55,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:55,309 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-01-10 02:25:55,312 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-01-10 02:25:55,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 02:25:55,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 02:25:55,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:55,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:55,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:25:55,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-10 02:25:55,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:25:55,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:55,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016131970] [2025-01-10 02:25:55,505 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:25:55,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857515592] [2025-01-10 02:25:55,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857515592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:55,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:55,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:25:55,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706207803] [2025-01-10 02:25:55,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:55,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:25:55,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:55,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:25:55,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:25:55,507 INFO L87 Difference]: Start difference. First operand 377 states and 435 transitions. Second operand has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:25:55,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:55,557 INFO L93 Difference]: Finished difference Result 377 states and 435 transitions. [2025-01-10 02:25:55,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:25:55,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-01-10 02:25:55,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:55,560 INFO L225 Difference]: With dead ends: 377 [2025-01-10 02:25:55,560 INFO L226 Difference]: Without dead ends: 374 [2025-01-10 02:25:55,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:25:55,561 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 96 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:55,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 151 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:25:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-01-10 02:25:55,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2025-01-10 02:25:55,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 297 states have (on average 1.393939393939394) internal successors, (414), 366 states have internal predecessors, (414), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:25:55,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 428 transitions. [2025-01-10 02:25:55,572 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 428 transitions. Word has length 93 [2025-01-10 02:25:55,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:55,572 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 428 transitions. [2025-01-10 02:25:55,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:25:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 428 transitions. [2025-01-10 02:25:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 02:25:55,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:55,574 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:25:55,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 02:25:55,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:55,775 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:25:55,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:55,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1431646251, now seen corresponding path program 1 times [2025-01-10 02:25:55,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:55,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261482344] [2025-01-10 02:25:55,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:55,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:55,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 02:25:55,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 02:25:55,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:55,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:25:55,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [603891136] [2025-01-10 02:25:55,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:55,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:55,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:55,805 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-01-10 02:25:55,808 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-01-10 02:25:55,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 02:25:55,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 02:25:55,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:55,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:55,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:25:55,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:56,162 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:25:56,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:25:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:25:56,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:56,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261482344] [2025-01-10 02:25:56,379 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:25:56,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603891136] [2025-01-10 02:25:56,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603891136] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:25:56,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:25:56,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-01-10 02:25:56,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425745360] [2025-01-10 02:25:56,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:25:56,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:25:56,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:56,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:25:56,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:25:56,381 INFO L87 Difference]: Start difference. First operand 374 states and 428 transitions. Second operand has 8 states, 7 states have (on average 25.428571428571427) internal successors, (178), 8 states have internal predecessors, (178), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:25:57,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:57,186 INFO L93 Difference]: Finished difference Result 503 states and 554 transitions. [2025-01-10 02:25:57,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:25:57,187 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 25.428571428571427) internal successors, (178), 8 states have internal predecessors, (178), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2025-01-10 02:25:57,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:57,189 INFO L225 Difference]: With dead ends: 503 [2025-01-10 02:25:57,189 INFO L226 Difference]: Without dead ends: 496 [2025-01-10 02:25:57,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:25:57,190 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 291 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:57,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 383 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 02:25:57,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-10 02:25:57,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 446. [2025-01-10 02:25:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 369 states have (on average 1.4336043360433603) internal successors, (529), 438 states have internal predecessors, (529), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:25:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 543 transitions. [2025-01-10 02:25:57,202 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 543 transitions. Word has length 94 [2025-01-10 02:25:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:57,203 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 543 transitions. [2025-01-10 02:25:57,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 25.428571428571427) internal successors, (178), 8 states have internal predecessors, (178), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:25:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 543 transitions. [2025-01-10 02:25:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 02:25:57,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:57,204 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:25:57,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 02:25:57,404 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-01-10 02:25:57,405 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:25:57,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:57,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1431360706, now seen corresponding path program 1 times [2025-01-10 02:25:57,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:57,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794968748] [2025-01-10 02:25:57,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:57,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:57,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 02:25:57,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 02:25:57,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:57,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:25:57,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1438767815] [2025-01-10 02:25:57,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:57,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:57,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:57,447 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-01-10 02:25:57,449 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-01-10 02:25:57,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 02:25:57,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 02:25:57,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:57,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:57,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:25:57,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:25:57,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:25:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:25:58,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:58,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794968748] [2025-01-10 02:25:58,149 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:25:58,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438767815] [2025-01-10 02:25:58,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438767815] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 02:25:58,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:25:58,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-01-10 02:25:58,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588297720] [2025-01-10 02:25:58,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:58,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:25:58,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:58,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:25:58,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:25:58,152 INFO L87 Difference]: Start difference. First operand 446 states and 543 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:26:02,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:26:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:02,643 INFO L93 Difference]: Finished difference Result 446 states and 543 transitions. [2025-01-10 02:26:02,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:26:02,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2025-01-10 02:26:02,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:02,645 INFO L225 Difference]: With dead ends: 446 [2025-01-10 02:26:02,646 INFO L226 Difference]: Without dead ends: 444 [2025-01-10 02:26:02,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:26:02,646 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 91 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:02,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 54 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-01-10 02:26:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-01-10 02:26:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-01-10 02:26:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 369 states have (on average 1.4173441734417345) internal successors, (523), 436 states have internal predecessors, (523), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:26:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 537 transitions. [2025-01-10 02:26:02,664 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 537 transitions. Word has length 95 [2025-01-10 02:26:02,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:02,664 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 537 transitions. [2025-01-10 02:26:02,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:26:02,664 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 537 transitions. [2025-01-10 02:26:02,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-10 02:26:02,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:02,665 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:26:02,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 02:26:02,871 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-01-10 02:26:02,871 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:26:02,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:02,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1422508809, now seen corresponding path program 1 times [2025-01-10 02:26:02,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:02,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892147155] [2025-01-10 02:26:02,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:02,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:02,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 02:26:02,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 02:26:02,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:02,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:26:02,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [491235501] [2025-01-10 02:26:02,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:02,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:02,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:02,907 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-01-10 02:26:02,908 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-01-10 02:26:02,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 02:26:02,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 02:26:02,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:02,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:02,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:26:02,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:26:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:26:03,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:26:03,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:03,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892147155] [2025-01-10 02:26:03,102 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:26:03,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491235501] [2025-01-10 02:26:03,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491235501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:26:03,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:26:03,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:26:03,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827930300] [2025-01-10 02:26:03,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:26:03,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:26:03,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:03,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:26:03,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:26:03,104 INFO L87 Difference]: Start difference. First operand 444 states and 537 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:26:03,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:03,823 INFO L93 Difference]: Finished difference Result 447 states and 537 transitions. [2025-01-10 02:26:03,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:26:03,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2025-01-10 02:26:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:03,826 INFO L225 Difference]: With dead ends: 447 [2025-01-10 02:26:03,826 INFO L226 Difference]: Without dead ends: 427 [2025-01-10 02:26:03,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:26:03,827 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 139 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:03,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 51 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 02:26:03,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-01-10 02:26:03,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2025-01-10 02:26:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 369 states have (on average 1.2926829268292683) internal successors, (477), 419 states have internal predecessors, (477), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:26:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 491 transitions. [2025-01-10 02:26:03,842 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 491 transitions. Word has length 96 [2025-01-10 02:26:03,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:03,843 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 491 transitions. [2025-01-10 02:26:03,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:26:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 491 transitions. [2025-01-10 02:26:03,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 02:26:03,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:03,844 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:26:03,851 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-01-10 02:26:04,048 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-01-10 02:26:04,048 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:26:04,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:04,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1148100000, now seen corresponding path program 1 times [2025-01-10 02:26:04,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:04,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795945610] [2025-01-10 02:26:04,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:04,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:04,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 02:26:04,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 02:26:04,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:04,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:26:04,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [963970143] [2025-01-10 02:26:04,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:04,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:04,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:04,087 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-01-10 02:26:04,089 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-01-10 02:26:04,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 02:26:04,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 02:26:04,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:04,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:04,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:26:04,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:26:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:26:04,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:26:04,681 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-10 02:26:04,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:04,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795945610] [2025-01-10 02:26:04,681 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:26:04,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963970143] [2025-01-10 02:26:04,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963970143] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 02:26:04,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:26:04,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-10 02:26:04,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143916418] [2025-01-10 02:26:04,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:26:04,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:26:04,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:04,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:26:04,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:26:04,683 INFO L87 Difference]: Start difference. First operand 427 states and 491 transitions. Second operand has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:26:09,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:26:16,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:26:18,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:26:19,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:19,070 INFO L93 Difference]: Finished difference Result 427 states and 491 transitions. [2025-01-10 02:26:19,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:26:19,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2025-01-10 02:26:19,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:19,073 INFO L225 Difference]: With dead ends: 427 [2025-01-10 02:26:19,073 INFO L226 Difference]: Without dead ends: 425 [2025-01-10 02:26:19,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:26:19,074 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 83 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:19,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 47 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 292 Invalid, 1 Unknown, 0 Unchecked, 14.4s Time] [2025-01-10 02:26:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-10 02:26:19,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-01-10 02:26:19,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 369 states have (on average 1.2764227642276422) internal successors, (471), 417 states have internal predecessors, (471), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:26:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 485 transitions. [2025-01-10 02:26:19,088 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 485 transitions. Word has length 97 [2025-01-10 02:26:19,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:19,088 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 485 transitions. [2025-01-10 02:26:19,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:26:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 485 transitions. [2025-01-10 02:26:19,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-10 02:26:19,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:19,089 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:26:19,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 02:26:19,289 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-01-10 02:26:19,290 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:26:19,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:19,290 INFO L85 PathProgramCache]: Analyzing trace with hash 769876980, now seen corresponding path program 1 times [2025-01-10 02:26:19,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:19,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755160582] [2025-01-10 02:26:19,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:19,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:19,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 02:26:19,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 02:26:19,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:19,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:19,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:19,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755160582] [2025-01-10 02:26:19,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755160582] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:26:19,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148674673] [2025-01-10 02:26:19,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:19,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:19,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:19,450 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-01-10 02:26:19,451 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-01-10 02:26:19,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 02:26:19,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 02:26:19,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:19,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:19,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:26:19,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:26:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:26:19,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:26:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:19,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148674673] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:26:19,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:26:19,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-01-10 02:26:19,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38975396] [2025-01-10 02:26:19,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:26:19,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:26:19,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:19,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:26:19,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:26:19,662 INFO L87 Difference]: Start difference. First operand 425 states and 485 transitions. Second operand has 10 states, 10 states have (on average 16.2) internal successors, (162), 10 states have internal predecessors, (162), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 02:26:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:19,774 INFO L93 Difference]: Finished difference Result 610 states and 649 transitions. [2025-01-10 02:26:19,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 02:26:19,774 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.2) internal successors, (162), 10 states have internal predecessors, (162), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 104 [2025-01-10 02:26:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:19,776 INFO L225 Difference]: With dead ends: 610 [2025-01-10 02:26:19,776 INFO L226 Difference]: Without dead ends: 479 [2025-01-10 02:26:19,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-01-10 02:26:19,778 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 238 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:19,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 764 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:26:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-01-10 02:26:19,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 429. [2025-01-10 02:26:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 369 states have (on average 1.2872628726287263) internal successors, (475), 417 states have internal predecessors, (475), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:26:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 491 transitions. [2025-01-10 02:26:19,796 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 491 transitions. Word has length 104 [2025-01-10 02:26:19,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:19,796 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 491 transitions. [2025-01-10 02:26:19,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.2) internal successors, (162), 10 states have internal predecessors, (162), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 02:26:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 491 transitions. [2025-01-10 02:26:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-10 02:26:19,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:19,798 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:26:19,805 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-01-10 02:26:19,998 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,SelfDestructingSolverStorable16 [2025-01-10 02:26:19,998 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:26:19,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:19,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1769836147, now seen corresponding path program 1 times [2025-01-10 02:26:19,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:19,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923853990] [2025-01-10 02:26:19,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:19,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:20,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 02:26:20,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 02:26:20,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:20,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:20,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:20,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923853990] [2025-01-10 02:26:20,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923853990] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:26:20,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478323920] [2025-01-10 02:26:20,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:20,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:20,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:20,079 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-01-10 02:26:20,081 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-01-10 02:26:20,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 02:26:20,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 02:26:20,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:20,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:20,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:26:20,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:26:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:20,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:26:20,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478323920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:26:20,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:26:20,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:26:20,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274806511] [2025-01-10 02:26:20,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:26:20,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:26:20,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:20,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:26:20,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:26:20,250 INFO L87 Difference]: Start difference. First operand 429 states and 491 transitions. Second operand has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:26:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:20,275 INFO L93 Difference]: Finished difference Result 450 states and 497 transitions. [2025-01-10 02:26:20,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:26:20,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2025-01-10 02:26:20,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:20,277 INFO L225 Difference]: With dead ends: 450 [2025-01-10 02:26:20,278 INFO L226 Difference]: Without dead ends: 449 [2025-01-10 02:26:20,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:26:20,278 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 84 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:20,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 397 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:26:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-01-10 02:26:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 428. [2025-01-10 02:26:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 369 states have (on average 1.2791327913279134) internal successors, (472), 416 states have internal predecessors, (472), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:26:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 488 transitions. [2025-01-10 02:26:20,295 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 488 transitions. Word has length 105 [2025-01-10 02:26:20,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:20,296 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 488 transitions. [2025-01-10 02:26:20,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:26:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 488 transitions. [2025-01-10 02:26:20,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-10 02:26:20,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:20,297 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:26:20,305 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-01-10 02:26:20,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 02:26:20,498 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:26:20,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:20,498 INFO L85 PathProgramCache]: Analyzing trace with hash 969654422, now seen corresponding path program 1 times [2025-01-10 02:26:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:20,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567004848] [2025-01-10 02:26:20,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:20,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:20,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-10 02:26:20,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-10 02:26:20,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:20,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:20,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:20,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567004848] [2025-01-10 02:26:20,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567004848] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:26:20,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569014631] [2025-01-10 02:26:20,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:20,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:20,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:20,585 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-01-10 02:26:20,587 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-01-10 02:26:20,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-10 02:26:20,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-10 02:26:20,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:20,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:20,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:26:20,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:26:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:20,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:26:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:20,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569014631] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:26:20,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:26:20,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 02:26:20,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336024951] [2025-01-10 02:26:20,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:26:20,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:26:20,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:20,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:26:20,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:26:20,891 INFO L87 Difference]: Start difference. First operand 428 states and 488 transitions. Second operand has 7 states, 6 states have (on average 39.0) internal successors, (234), 7 states have internal predecessors, (234), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:26:20,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:20,933 INFO L93 Difference]: Finished difference Result 508 states and 547 transitions. [2025-01-10 02:26:20,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:26:20,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 39.0) internal successors, (234), 7 states have internal predecessors, (234), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 106 [2025-01-10 02:26:20,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:20,935 INFO L225 Difference]: With dead ends: 508 [2025-01-10 02:26:20,935 INFO L226 Difference]: Without dead ends: 507 [2025-01-10 02:26:20,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:26:20,936 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 51 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:20,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 600 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:26:20,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-01-10 02:26:20,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 466. [2025-01-10 02:26:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 406 states have (on average 1.2955665024630543) internal successors, (526), 453 states have internal predecessors, (526), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:26:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 544 transitions. [2025-01-10 02:26:20,952 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 544 transitions. Word has length 106 [2025-01-10 02:26:20,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:20,952 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 544 transitions. [2025-01-10 02:26:20,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 39.0) internal successors, (234), 7 states have internal predecessors, (234), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:26:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 544 transitions. [2025-01-10 02:26:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-10 02:26:20,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:20,953 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 02:26:20,961 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-01-10 02:26:21,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:21,155 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:26:21,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:21,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1419332142, now seen corresponding path program 1 times [2025-01-10 02:26:21,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:21,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361575257] [2025-01-10 02:26:21,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:21,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:21,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-10 02:26:21,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-10 02:26:21,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:21,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 02:26:21,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:21,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361575257] [2025-01-10 02:26:21,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361575257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:26:21,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:26:21,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:26:21,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402220508] [2025-01-10 02:26:21,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:26:21,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:26:21,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:21,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:26:21,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:26:21,227 INFO L87 Difference]: Start difference. First operand 466 states and 544 transitions. Second operand has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:26:21,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:21,383 INFO L93 Difference]: Finished difference Result 466 states and 544 transitions. [2025-01-10 02:26:21,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:26:21,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 121 [2025-01-10 02:26:21,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:21,384 INFO L225 Difference]: With dead ends: 466 [2025-01-10 02:26:21,384 INFO L226 Difference]: Without dead ends: 459 [2025-01-10 02:26:21,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:26:21,385 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 132 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:21,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 34 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:26:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-01-10 02:26:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2025-01-10 02:26:21,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 406 states have (on average 1.2463054187192117) internal successors, (506), 446 states have internal predecessors, (506), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:26:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 524 transitions. [2025-01-10 02:26:21,405 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 524 transitions. Word has length 121 [2025-01-10 02:26:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:21,405 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 524 transitions. [2025-01-10 02:26:21,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:26:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 524 transitions. [2025-01-10 02:26:21,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-10 02:26:21,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:21,406 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 02:26:21,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 02:26:21,406 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:26:21,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:21,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1049623385, now seen corresponding path program 1 times [2025-01-10 02:26:21,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:21,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726792302] [2025-01-10 02:26:21,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:21,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:21,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-10 02:26:21,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-10 02:26:21,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:21,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:21,485 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-10 02:26:21,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:21,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726792302] [2025-01-10 02:26:21,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726792302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:26:21,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:26:21,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:26:21,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379929519] [2025-01-10 02:26:21,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:26:21,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:26:21,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:21,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:26:21,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:26:21,487 INFO L87 Difference]: Start difference. First operand 459 states and 524 transitions. Second operand has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:26:21,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:21,634 INFO L93 Difference]: Finished difference Result 459 states and 524 transitions. [2025-01-10 02:26:21,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:26:21,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 122 [2025-01-10 02:26:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:21,636 INFO L225 Difference]: With dead ends: 459 [2025-01-10 02:26:21,636 INFO L226 Difference]: Without dead ends: 457 [2025-01-10 02:26:21,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:26:21,637 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:21,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 34 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:26:21,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-01-10 02:26:21,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2025-01-10 02:26:21,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 406 states have (on average 1.2364532019704433) internal successors, (502), 444 states have internal predecessors, (502), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:26:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 520 transitions. [2025-01-10 02:26:21,653 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 520 transitions. Word has length 122 [2025-01-10 02:26:21,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:21,653 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 520 transitions. [2025-01-10 02:26:21,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:26:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 520 transitions. [2025-01-10 02:26:21,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-10 02:26:21,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:21,655 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 02:26:21,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 02:26:21,655 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:26:21,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:21,655 INFO L85 PathProgramCache]: Analyzing trace with hash 629243465, now seen corresponding path program 1 times [2025-01-10 02:26:21,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:21,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018379587] [2025-01-10 02:26:21,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:21,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:21,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-10 02:26:21,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-10 02:26:21,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:21,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:26:21,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1786714682] [2025-01-10 02:26:21,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:21,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:21,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:21,684 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-01-10 02:26:21,687 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-01-10 02:26:21,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-10 02:26:21,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-10 02:26:21,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:21,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:21,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 02:26:21,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:26:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:21,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:26:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:26:22,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:22,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018379587] [2025-01-10 02:26:22,078 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:26:22,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786714682] [2025-01-10 02:26:22,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786714682] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:26:22,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:26:22,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-01-10 02:26:22,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202527705] [2025-01-10 02:26:22,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:26:22,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:26:22,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:22,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:26:22,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:26:22,080 INFO L87 Difference]: Start difference. First operand 457 states and 520 transitions. Second operand has 8 states, 7 states have (on average 32.57142857142857) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:26:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:22,622 INFO L93 Difference]: Finished difference Result 483 states and 526 transitions. [2025-01-10 02:26:22,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:26:22,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 32.57142857142857) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 124 [2025-01-10 02:26:22,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:22,625 INFO L225 Difference]: With dead ends: 483 [2025-01-10 02:26:22,625 INFO L226 Difference]: Without dead ends: 453 [2025-01-10 02:26:22,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:26:22,626 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 313 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:22,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 173 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 02:26:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-01-10 02:26:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2025-01-10 02:26:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 402 states have (on average 1.1592039800995024) internal successors, (466), 437 states have internal predecessors, (466), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:26:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 484 transitions. [2025-01-10 02:26:22,643 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 484 transitions. Word has length 124 [2025-01-10 02:26:22,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:22,643 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 484 transitions. [2025-01-10 02:26:22,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 32.57142857142857) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:26:22,644 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 484 transitions. [2025-01-10 02:26:22,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-10 02:26:22,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:22,645 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:26:22,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 02:26:22,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-10 02:26:22,845 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:26:22,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:22,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1261627789, now seen corresponding path program 1 times [2025-01-10 02:26:22,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:22,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958421305] [2025-01-10 02:26:22,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:22,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:22,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-10 02:26:22,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-10 02:26:22,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:22,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:26:22,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1173956898] [2025-01-10 02:26:22,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:22,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:22,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:22,873 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:26:22,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 02:26:22,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-10 02:26:22,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-10 02:26:22,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:22,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:22,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:26:22,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:26:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:26:23,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:26:23,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:23,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958421305] [2025-01-10 02:26:23,582 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:26:23,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173956898] [2025-01-10 02:26:23,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173956898] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:26:23,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:26:23,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-01-10 02:26:23,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255960775] [2025-01-10 02:26:23,583 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:26:23,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:26:23,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:23,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:26:23,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:26:23,584 INFO L87 Difference]: Start difference. First operand 449 states and 484 transitions. Second operand has 5 states, 4 states have (on average 33.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:26:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:23,864 INFO L93 Difference]: Finished difference Result 451 states and 487 transitions. [2025-01-10 02:26:23,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:26:23,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 33.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 144 [2025-01-10 02:26:23,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:23,867 INFO L225 Difference]: With dead ends: 451 [2025-01-10 02:26:23,867 INFO L226 Difference]: Without dead ends: 437 [2025-01-10 02:26:23,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:26:23,868 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 65 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:23,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 59 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:26:23,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-01-10 02:26:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 435. [2025-01-10 02:26:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 402 states have (on average 1.092039800995025) internal successors, (439), 423 states have internal predecessors, (439), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:26:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 457 transitions. [2025-01-10 02:26:23,887 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 457 transitions. Word has length 144 [2025-01-10 02:26:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:23,888 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 457 transitions. [2025-01-10 02:26:23,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 33.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:26:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 457 transitions. [2025-01-10 02:26:23,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-10 02:26:23,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:23,891 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:26:23,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 02:26:24,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:24,092 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:26:24,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:24,093 INFO L85 PathProgramCache]: Analyzing trace with hash 455756022, now seen corresponding path program 1 times [2025-01-10 02:26:24,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:24,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038308190] [2025-01-10 02:26:24,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:24,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:24,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-10 02:26:24,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-10 02:26:24,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:24,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:26:24,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [261932074] [2025-01-10 02:26:24,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:24,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:24,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:24,120 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:26:24,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 02:26:24,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-10 02:26:24,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-10 02:26:24,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:24,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:24,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:26:24,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:26:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:26:24,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:26:24,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:24,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038308190] [2025-01-10 02:26:24,796 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:26:24,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261932074] [2025-01-10 02:26:24,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261932074] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:26:24,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:26:24,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-01-10 02:26:24,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968929686] [2025-01-10 02:26:24,796 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:26:24,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:26:24,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:24,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:26:24,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:26:24,797 INFO L87 Difference]: Start difference. First operand 435 states and 457 transitions. Second operand has 6 states, 5 states have (on average 26.6) internal successors, (133), 6 states have internal predecessors, (133), 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-01-10 02:26:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:25,114 INFO L93 Difference]: Finished difference Result 438 states and 459 transitions. [2025-01-10 02:26:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:26:25,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 26.6) internal successors, (133), 6 states have internal predecessors, (133), 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) Word has length 145 [2025-01-10 02:26:25,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:25,116 INFO L225 Difference]: With dead ends: 438 [2025-01-10 02:26:25,116 INFO L226 Difference]: Without dead ends: 400 [2025-01-10 02:26:25,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:26:25,117 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:25,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 136 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:26:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-01-10 02:26:25,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-01-10 02:26:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 368 states have (on average 1.0978260869565217) internal successors, (404), 388 states have internal predecessors, (404), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:26:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 420 transitions. [2025-01-10 02:26:25,131 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 420 transitions. Word has length 145 [2025-01-10 02:26:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:25,131 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 420 transitions. [2025-01-10 02:26:25,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.6) internal successors, (133), 6 states have internal predecessors, (133), 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-01-10 02:26:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 420 transitions. [2025-01-10 02:26:25,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-10 02:26:25,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:25,132 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 02:26:25,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 02:26:25,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:25,333 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:26:25,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:25,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1146664490, now seen corresponding path program 1 times [2025-01-10 02:26:25,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:25,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047000689] [2025-01-10 02:26:25,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:25,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:25,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-10 02:26:25,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-10 02:26:25,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:25,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:26:25,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [988019579] [2025-01-10 02:26:25,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:25,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:25,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:25,371 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:26:25,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 02:26:25,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-10 02:26:25,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-10 02:26:25,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:25,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:25,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:26:25,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:26:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:26:25,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:26:25,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:25,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047000689] [2025-01-10 02:26:25,668 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:26:25,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988019579] [2025-01-10 02:26:25,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988019579] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:26:25,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:26:25,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-01-10 02:26:25,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511701703] [2025-01-10 02:26:25,669 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:26:25,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:26:25,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:25,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:26:25,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:26:25,670 INFO L87 Difference]: Start difference. First operand 400 states and 420 transitions. Second operand has 6 states, 5 states have (on average 31.2) internal successors, (156), 6 states have internal predecessors, (156), 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-01-10 02:26:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:25,949 INFO L93 Difference]: Finished difference Result 445 states and 466 transitions. [2025-01-10 02:26:25,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:26:25,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 31.2) internal successors, (156), 6 states have internal predecessors, (156), 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) Word has length 168 [2025-01-10 02:26:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:25,950 INFO L225 Difference]: With dead ends: 445 [2025-01-10 02:26:25,950 INFO L226 Difference]: Without dead ends: 442 [2025-01-10 02:26:25,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:26:25,951 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 120 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:25,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 105 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:26:25,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-01-10 02:26:25,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 400. [2025-01-10 02:26:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 368 states have (on average 1.0896739130434783) internal successors, (401), 388 states have internal predecessors, (401), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:26:25,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 417 transitions. [2025-01-10 02:26:25,965 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 417 transitions. Word has length 168 [2025-01-10 02:26:25,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:25,965 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 417 transitions. [2025-01-10 02:26:25,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.2) internal successors, (156), 6 states have internal predecessors, (156), 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-01-10 02:26:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 417 transitions. [2025-01-10 02:26:25,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-10 02:26:25,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:25,966 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 02:26:25,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-10 02:26:26,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-10 02:26:26,167 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:26:26,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:26,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1862015540, now seen corresponding path program 1 times [2025-01-10 02:26:26,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:26,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010706489] [2025-01-10 02:26:26,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:26,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:26,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-10 02:26:26,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-10 02:26:26,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:26,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:26:26,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1921268009] [2025-01-10 02:26:26,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:26,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:26,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:26,190 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:26:26,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 02:26:26,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-10 02:26:26,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-10 02:26:26,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:26,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:26,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:26:26,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:26:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:26:26,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:26:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:26:26,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:26:26,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010706489] [2025-01-10 02:26:26,703 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:26:26,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921268009] [2025-01-10 02:26:26,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921268009] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:26:26,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:26:26,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-01-10 02:26:26,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870169465] [2025-01-10 02:26:26,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:26:26,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:26:26,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:26:26,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:26:26,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:26:26,706 INFO L87 Difference]: Start difference. First operand 400 states and 417 transitions. Second operand has 10 states, 9 states have (on average 34.44444444444444) internal successors, (310), 10 states have internal predecessors, (310), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:26:27,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:26:27,232 INFO L93 Difference]: Finished difference Result 474 states and 499 transitions. [2025-01-10 02:26:27,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:26:27,232 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 34.44444444444444) internal successors, (310), 10 states have internal predecessors, (310), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 170 [2025-01-10 02:26:27,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:26:27,234 INFO L225 Difference]: With dead ends: 474 [2025-01-10 02:26:27,235 INFO L226 Difference]: Without dead ends: 462 [2025-01-10 02:26:27,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:26:27,235 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 670 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 02:26:27,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 268 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 02:26:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-01-10 02:26:27,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 410. [2025-01-10 02:26:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 386 states have (on average 1.0466321243523315) internal successors, (404), 398 states have internal predecessors, (404), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:26:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 420 transitions. [2025-01-10 02:26:27,252 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 420 transitions. Word has length 170 [2025-01-10 02:26:27,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:26:27,252 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 420 transitions. [2025-01-10 02:26:27,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 34.44444444444444) internal successors, (310), 10 states have internal predecessors, (310), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:26:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 420 transitions. [2025-01-10 02:26:27,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-10 02:26:27,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:26:27,254 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-01-10 02:26:27,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-10 02:26:27,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-10 02:26:27,455 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:26:27,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:26:27,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1604433262, now seen corresponding path program 1 times [2025-01-10 02:26:27,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:26:27,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741594844] [2025-01-10 02:26:27,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:27,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:26:27,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-10 02:26:27,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-10 02:26:27,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:27,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:26:27,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1755677293] [2025-01-10 02:26:27,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:26:27,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:26:27,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:26:27,492 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:26:27,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 02:26:27,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-10 02:26:27,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-10 02:26:27,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:26:27,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:26:27,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 02:26:27,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:26:27,755 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 02:26:27,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:26:36,504 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 15)) (.cse1 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10)) (.cse2 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6))) (or (< (+ (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) 6) (* |c_ULTIMATE.start_main_~y~0#1| 4) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 4 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (div (+ .cse0 .cse1 .cse2 (* (- 1) |c_ULTIMATE.start_main_~y~0#1|)) 30)) 9223372036854775807) (not (= (mod (+ .cse0 .cse1 (* |c_ULTIMATE.start_main_~y~0#1| 29) .cse2) 30) 0)))) is different from false [2025-01-10 02:26:50,184 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)