./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound2.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_unwindbound2.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 402079e1c7de243c4e41f5ffecd6596c904161a3f8e591ee220484899b186d55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:25:17,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:25:17,664 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:17,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:25:17,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:25:17,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:25:17,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:25:17,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:25:17,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:25:17,691 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:25:17,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:25:17,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:25:17,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:25:17,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:25:17,693 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:25:17,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:25:17,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:25:17,693 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:25:17,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:25:17,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:25:17,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:25:17,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:25:17,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:25:17,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:25:17,694 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:25:17,694 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:25:17,694 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:25:17,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:25:17,694 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:25:17,694 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:25:17,694 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:25:17,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:25:17,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:25:17,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:25:17,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:25:17,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:25:17,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:25:17,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:25:17,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:25:17,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:25:17,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:25:17,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:25:17,695 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:25:17,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:25:17,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:25:17,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:25:17,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:25:17,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:25:17,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:25:17,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:25:17,696 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 -> 402079e1c7de243c4e41f5ffecd6596c904161a3f8e591ee220484899b186d55 [2025-01-10 02:25:17,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:25:17,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:25:17,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:25:17,930 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:25:17,930 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:25:17,931 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_unwindbound2.c [2025-01-10 02:25:19,026 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b2e8d37d/341caedfd1f94ea087fe23e64df3565b/FLAG25d7db926 [2025-01-10 02:25:19,251 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:25:19,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound2.c [2025-01-10 02:25:19,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b2e8d37d/341caedfd1f94ea087fe23e64df3565b/FLAG25d7db926 [2025-01-10 02:25:19,269 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b2e8d37d/341caedfd1f94ea087fe23e64df3565b [2025-01-10 02:25:19,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:25:19,272 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:25:19,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:25:19,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:25:19,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:25:19,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:25:19" (1/1) ... [2025-01-10 02:25:19,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dd75b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:19, skipping insertion in model container [2025-01-10 02:25:19,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:25:19" (1/1) ... [2025-01-10 02:25:19,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:25:19,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:25:19,401 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:25:19,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:25:19,429 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:25:19,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:19 WrapperNode [2025-01-10 02:25:19,431 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:25:19,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:25:19,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:25:19,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:25:19,435 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:19" (1/1) ... [2025-01-10 02:25:19,440 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:19" (1/1) ... [2025-01-10 02:25:19,461 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 134 [2025-01-10 02:25:19,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:25:19,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:25:19,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:25:19,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:25:19,473 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:19" (1/1) ... [2025-01-10 02:25:19,473 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:19" (1/1) ... [2025-01-10 02:25:19,475 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:19" (1/1) ... [2025-01-10 02:25:19,488 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:19,488 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:19" (1/1) ... [2025-01-10 02:25:19,489 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:19" (1/1) ... [2025-01-10 02:25:19,491 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:19" (1/1) ... [2025-01-10 02:25:19,491 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:19" (1/1) ... [2025-01-10 02:25:19,497 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:19" (1/1) ... [2025-01-10 02:25:19,497 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:19" (1/1) ... [2025-01-10 02:25:19,500 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:19" (1/1) ... [2025-01-10 02:25:19,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:25:19,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:25:19,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:25:19,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:25:19,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:19" (1/1) ... [2025-01-10 02:25:19,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:25:19,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:19,525 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:19,529 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:19,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:25:19,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:25:19,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:25:19,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:25:19,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:25:19,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:25:19,583 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:25:19,585 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:25:19,917 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2025-01-10 02:25:19,918 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:25:19,930 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:25:19,930 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 02:25:19,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:25:19 BoogieIcfgContainer [2025-01-10 02:25:19,930 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:25:19,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:25:19,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:25:19,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:25:19,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:25:19" (1/3) ... [2025-01-10 02:25:19,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b44316e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:25:19, skipping insertion in model container [2025-01-10 02:25:19,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:25:19" (2/3) ... [2025-01-10 02:25:19,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b44316e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:25:19, skipping insertion in model container [2025-01-10 02:25:19,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:25:19" (3/3) ... [2025-01-10 02:25:19,937 INFO L128 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound2.c [2025-01-10 02:25:19,946 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:25:19,947 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps5-ll_unwindbound2.c that has 2 procedures, 192 locations, 1 initial locations, 1 loop locations, and 86 error locations. [2025-01-10 02:25:19,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:25:19,986 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;@52c1a058, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:25:19,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2025-01-10 02:25:19,988 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:19,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 02:25:19,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:19,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 02:25:19,991 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:19,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:19,994 INFO L85 PathProgramCache]: Analyzing trace with hash 889512265, now seen corresponding path program 1 times [2025-01-10 02:25:19,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:19,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510889389] [2025-01-10 02:25:19,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:19,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:20,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 02:25:20,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 02:25:20,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:20,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:20,063 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:20,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:20,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510889389] [2025-01-10 02:25:20,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510889389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:20,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:20,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:25:20,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280758653] [2025-01-10 02:25:20,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:20,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 02:25:20,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:20,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 02:25:20,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:25:20,079 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:20,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:20,096 INFO L93 Difference]: Finished difference Result 367 states and 394 transitions. [2025-01-10 02:25:20,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 02:25:20,097 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:20,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:20,100 INFO L225 Difference]: With dead ends: 367 [2025-01-10 02:25:20,100 INFO L226 Difference]: Without dead ends: 172 [2025-01-10 02:25:20,102 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:20,104 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:20,104 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:20,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-10 02:25:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-01-10 02:25:20,126 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:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 174 transitions. [2025-01-10 02:25:20,130 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 174 transitions. Word has length 6 [2025-01-10 02:25:20,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:20,130 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 174 transitions. [2025-01-10 02:25:20,130 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:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 174 transitions. [2025-01-10 02:25:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 02:25:20,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:20,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 02:25:20,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:25:20,131 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:20,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash 889568326, now seen corresponding path program 1 times [2025-01-10 02:25:20,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:20,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906057344] [2025-01-10 02:25:20,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:20,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:20,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 02:25:20,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 02:25:20,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:20,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:20,186 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:20,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:20,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906057344] [2025-01-10 02:25:20,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906057344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:20,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:20,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:25:20,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005472240] [2025-01-10 02:25:20,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:20,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:25:20,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:20,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:25:20,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:25:20,188 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:20,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:20,217 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2025-01-10 02:25:20,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:25:20,217 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:20,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:20,218 INFO L225 Difference]: With dead ends: 172 [2025-01-10 02:25:20,218 INFO L226 Difference]: Without dead ends: 171 [2025-01-10 02:25:20,218 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:20,219 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:20,219 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:20,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-10 02:25:20,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-01-10 02:25:20,224 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:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2025-01-10 02:25:20,226 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 6 [2025-01-10 02:25:20,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:20,226 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2025-01-10 02:25:20,226 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:20,226 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2025-01-10 02:25:20,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 02:25:20,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:20,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:25:20,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:25:20,226 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:20,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:20,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1806814377, now seen corresponding path program 1 times [2025-01-10 02:25:20,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:20,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637277712] [2025-01-10 02:25:20,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:20,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:20,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 02:25:20,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 02:25:20,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:20,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:20,262 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:20,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:20,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637277712] [2025-01-10 02:25:20,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637277712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:20,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:20,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:25:20,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382257226] [2025-01-10 02:25:20,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:20,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:25:20,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:20,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:25:20,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:25:20,264 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:20,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:20,300 INFO L93 Difference]: Finished difference Result 251 states and 253 transitions. [2025-01-10 02:25:20,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:25:20,302 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:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:20,306 INFO L225 Difference]: With dead ends: 251 [2025-01-10 02:25:20,306 INFO L226 Difference]: Without dead ends: 175 [2025-01-10 02:25:20,306 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:20,307 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:20,307 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:20,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-10 02:25:20,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-01-10 02:25:20,318 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:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2025-01-10 02:25:20,322 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 7 [2025-01-10 02:25:20,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:20,323 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2025-01-10 02:25:20,323 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:20,323 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2025-01-10 02:25:20,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 02:25:20,323 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:20,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:25:20,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:25:20,323 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:20,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:20,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1181830318, now seen corresponding path program 1 times [2025-01-10 02:25:20,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:20,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047978024] [2025-01-10 02:25:20,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:20,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:20,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 02:25:20,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 02:25:20,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:20,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:20,372 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:20,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:20,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047978024] [2025-01-10 02:25:20,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047978024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:20,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:20,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:25:20,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206580312] [2025-01-10 02:25:20,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:20,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:25:20,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:20,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:25:20,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:25:20,375 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:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:20,699 INFO L93 Difference]: Finished difference Result 311 states and 323 transitions. [2025-01-10 02:25:20,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:25:20,700 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:20,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:20,701 INFO L225 Difference]: With dead ends: 311 [2025-01-10 02:25:20,702 INFO L226 Difference]: Without dead ends: 255 [2025-01-10 02:25:20,702 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:20,703 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.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:20,703 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.3s Time] [2025-01-10 02:25:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-01-10 02:25:20,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 249. [2025-01-10 02:25:20,719 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:20,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 266 transitions. [2025-01-10 02:25:20,720 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 266 transitions. Word has length 9 [2025-01-10 02:25:20,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:20,720 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 266 transitions. [2025-01-10 02:25:20,723 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:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 266 transitions. [2025-01-10 02:25:20,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 02:25:20,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:20,723 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:20,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:25:20,723 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:20,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:20,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1504231542, now seen corresponding path program 1 times [2025-01-10 02:25:20,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:20,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901245673] [2025-01-10 02:25:20,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:20,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:20,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 02:25:20,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 02:25:20,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:20,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:20,797 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:20,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:20,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901245673] [2025-01-10 02:25:20,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901245673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:20,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:20,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:25:20,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011386612] [2025-01-10 02:25:20,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:20,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:25:20,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:20,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:25:20,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:25:20,798 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:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:20,855 INFO L93 Difference]: Finished difference Result 268 states and 280 transitions. [2025-01-10 02:25:20,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:25:20,856 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:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:20,857 INFO L225 Difference]: With dead ends: 268 [2025-01-10 02:25:20,857 INFO L226 Difference]: Without dead ends: 263 [2025-01-10 02:25:20,857 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:20,857 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 58 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:20,858 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:20,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-10 02:25:20,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 256. [2025-01-10 02:25:20,863 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:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 273 transitions. [2025-01-10 02:25:20,864 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 273 transitions. Word has length 37 [2025-01-10 02:25:20,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:20,865 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 273 transitions. [2025-01-10 02:25:20,865 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:20,865 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 273 transitions. [2025-01-10 02:25:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-10 02:25:20,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:20,865 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:20,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:25:20,866 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:20,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:20,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1837470508, now seen corresponding path program 1 times [2025-01-10 02:25:20,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:20,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360034456] [2025-01-10 02:25:20,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:20,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:20,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 02:25:20,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 02:25:20,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:20,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:20,953 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:20,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:20,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360034456] [2025-01-10 02:25:20,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360034456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:20,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:20,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:25:20,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703661682] [2025-01-10 02:25:20,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:20,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:25:20,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:20,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:25:20,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:25:20,955 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:21,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:21,244 INFO L93 Difference]: Finished difference Result 267 states and 275 transitions. [2025-01-10 02:25:21,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:25:21,244 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:21,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:21,245 INFO L225 Difference]: With dead ends: 267 [2025-01-10 02:25:21,245 INFO L226 Difference]: Without dead ends: 262 [2025-01-10 02:25:21,246 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:21,247 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 84 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:21,247 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.3s Time] [2025-01-10 02:25:21,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-01-10 02:25:21,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 256. [2025-01-10 02:25:21,258 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:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 268 transitions. [2025-01-10 02:25:21,259 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 268 transitions. Word has length 39 [2025-01-10 02:25:21,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:21,259 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 268 transitions. [2025-01-10 02:25:21,259 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:21,261 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 268 transitions. [2025-01-10 02:25:21,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-10 02:25:21,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:21,262 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:21,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 02:25:21,262 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:21,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:21,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1127011017, now seen corresponding path program 1 times [2025-01-10 02:25:21,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:21,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723554468] [2025-01-10 02:25:21,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:21,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:21,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 02:25:21,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 02:25:21,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:21,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:21,324 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:21,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:21,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723554468] [2025-01-10 02:25:21,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723554468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:21,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:21,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:25:21,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608996301] [2025-01-10 02:25:21,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:21,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:25:21,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:21,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:25:21,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:25:21,326 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:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:21,610 INFO L93 Difference]: Finished difference Result 266 states and 270 transitions. [2025-01-10 02:25:21,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:25:21,611 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:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:21,612 INFO L225 Difference]: With dead ends: 266 [2025-01-10 02:25:21,612 INFO L226 Difference]: Without dead ends: 228 [2025-01-10 02:25:21,612 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:21,613 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 85 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:21,613 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:21,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-01-10 02:25:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 222. [2025-01-10 02:25:21,618 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:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 230 transitions. [2025-01-10 02:25:21,618 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 230 transitions. Word has length 40 [2025-01-10 02:25:21,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:21,619 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 230 transitions. [2025-01-10 02:25:21,619 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:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 230 transitions. [2025-01-10 02:25:21,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 02:25:21,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:21,619 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:21,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:25:21,619 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:21,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:21,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1235073029, now seen corresponding path program 1 times [2025-01-10 02:25:21,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:21,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524958215] [2025-01-10 02:25:21,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:21,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:21,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 02:25:21,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 02:25:21,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:21,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:21,664 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:21,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:21,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524958215] [2025-01-10 02:25:21,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524958215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:21,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:21,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:25:21,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975800977] [2025-01-10 02:25:21,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:21,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:25:21,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:21,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:25:21,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:25:21,666 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:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:21,677 INFO L93 Difference]: Finished difference Result 224 states and 230 transitions. [2025-01-10 02:25:21,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:25:21,678 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:21,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:21,679 INFO L225 Difference]: With dead ends: 224 [2025-01-10 02:25:21,679 INFO L226 Difference]: Without dead ends: 222 [2025-01-10 02:25:21,679 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:21,679 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:21,679 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:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-01-10 02:25:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-01-10 02:25:21,684 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:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 228 transitions. [2025-01-10 02:25:21,685 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 228 transitions. Word has length 49 [2025-01-10 02:25:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:21,685 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 228 transitions. [2025-01-10 02:25:21,690 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:21,690 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 228 transitions. [2025-01-10 02:25:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-10 02:25:21,690 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:21,690 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:21,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:25:21,691 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:21,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:21,691 INFO L85 PathProgramCache]: Analyzing trace with hash -759757524, now seen corresponding path program 1 times [2025-01-10 02:25:21,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:21,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506890334] [2025-01-10 02:25:21,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:21,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:21,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 02:25:21,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 02:25:21,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:21,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:25:21,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705275787] [2025-01-10 02:25:21,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:21,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:21,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:21,719 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:21,721 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:21,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 02:25:21,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 02:25:21,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:21,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:21,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:25:21,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:21,852 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:21,852 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:25:21,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:21,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506890334] [2025-01-10 02:25:21,852 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:25:21,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705275787] [2025-01-10 02:25:21,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705275787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:21,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:21,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:25:21,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466661160] [2025-01-10 02:25:21,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:21,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:25:21,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:21,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:25:21,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:25:21,853 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:22,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:22,156 INFO L93 Difference]: Finished difference Result 365 states and 382 transitions. [2025-01-10 02:25:22,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:25:22,156 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:22,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:22,157 INFO L225 Difference]: With dead ends: 365 [2025-01-10 02:25:22,157 INFO L226 Difference]: Without dead ends: 311 [2025-01-10 02:25:22,157 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:22,158 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 95 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:22,158 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.3s Time] [2025-01-10 02:25:22,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-01-10 02:25:22,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 304. [2025-01-10 02:25:22,165 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:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 328 transitions. [2025-01-10 02:25:22,166 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 328 transitions. Word has length 54 [2025-01-10 02:25:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:22,166 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 328 transitions. [2025-01-10 02:25:22,166 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:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 328 transitions. [2025-01-10 02:25:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 02:25:22,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:22,169 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:22,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 02:25:22,369 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:22,370 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:22,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:22,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1022363922, now seen corresponding path program 1 times [2025-01-10 02:25:22,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:22,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44994153] [2025-01-10 02:25:22,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:22,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:22,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 02:25:22,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 02:25:22,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:22,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:22,457 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:22,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:22,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44994153] [2025-01-10 02:25:22,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44994153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:22,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:22,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:25:22,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056614291] [2025-01-10 02:25:22,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:22,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:25:22,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:22,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:25:22,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:25:22,458 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:22,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:22,526 INFO L93 Difference]: Finished difference Result 305 states and 328 transitions. [2025-01-10 02:25:22,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:25:22,526 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:22,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:22,527 INFO L225 Difference]: With dead ends: 305 [2025-01-10 02:25:22,527 INFO L226 Difference]: Without dead ends: 304 [2025-01-10 02:25:22,528 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:22,528 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 42 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:22,528 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:22,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-01-10 02:25:22,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-01-10 02:25:22,534 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:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 327 transitions. [2025-01-10 02:25:22,535 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 327 transitions. Word has length 60 [2025-01-10 02:25:22,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:22,535 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 327 transitions. [2025-01-10 02:25:22,535 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:22,535 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 327 transitions. [2025-01-10 02:25:22,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 02:25:22,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:22,536 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:22,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 02:25:22,536 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:22,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:22,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1630547131, now seen corresponding path program 1 times [2025-01-10 02:25:22,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:22,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547170887] [2025-01-10 02:25:22,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:22,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:22,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 02:25:22,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 02:25:22,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:22,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:22,603 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:22,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:22,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547170887] [2025-01-10 02:25:22,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547170887] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:25:22,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483323930] [2025-01-10 02:25:22,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:22,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:22,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:22,605 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:22,607 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:22,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 02:25:22,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 02:25:22,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:22,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:22,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:25:22,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:22,719 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:22,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:25:22,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483323930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:22,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:25:22,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-10 02:25:22,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993951000] [2025-01-10 02:25:22,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:22,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:25:22,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:22,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:25:22,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:25:22,720 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:22,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:22,754 INFO L93 Difference]: Finished difference Result 416 states and 446 transitions. [2025-01-10 02:25:22,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:25:22,754 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:22,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:22,756 INFO L225 Difference]: With dead ends: 416 [2025-01-10 02:25:22,756 INFO L226 Difference]: Without dead ends: 415 [2025-01-10 02:25:22,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:25:22,756 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:22,756 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:22,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-01-10 02:25:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 377. [2025-01-10 02:25:22,763 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:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 435 transitions. [2025-01-10 02:25:22,765 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 435 transitions. Word has length 63 [2025-01-10 02:25:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:22,765 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 435 transitions. [2025-01-10 02:25:22,765 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:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 435 transitions. [2025-01-10 02:25:22,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-10 02:25:22,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:22,765 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:22,771 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:22,970 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:22,970 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:22,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:22,970 INFO L85 PathProgramCache]: Analyzing trace with hash 785101852, now seen corresponding path program 1 times [2025-01-10 02:25:22,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:22,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658836930] [2025-01-10 02:25:22,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:22,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:22,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 02:25:22,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 02:25:22,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:22,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:25:23,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2129307660] [2025-01-10 02:25:23,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:23,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:23,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:23,005 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:23,007 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:23,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-10 02:25:23,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-10 02:25:23,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:23,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:23,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:25:23,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:23,150 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:23,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:25:23,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:23,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658836930] [2025-01-10 02:25:23,151 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:25:23,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129307660] [2025-01-10 02:25:23,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129307660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:23,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:23,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:25:23,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034745125] [2025-01-10 02:25:23,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:23,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:25:23,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:23,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:25:23,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:25:23,152 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:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:23,192 INFO L93 Difference]: Finished difference Result 377 states and 435 transitions. [2025-01-10 02:25:23,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:25:23,193 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:23,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:23,195 INFO L225 Difference]: With dead ends: 377 [2025-01-10 02:25:23,195 INFO L226 Difference]: Without dead ends: 374 [2025-01-10 02:25:23,195 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:23,195 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:23,196 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:23,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-01-10 02:25:23,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2025-01-10 02:25:23,202 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:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 428 transitions. [2025-01-10 02:25:23,203 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 428 transitions. Word has length 93 [2025-01-10 02:25:23,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:23,203 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 428 transitions. [2025-01-10 02:25:23,204 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:23,204 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 428 transitions. [2025-01-10 02:25:23,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-10 02:25:23,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:23,205 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:23,210 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:23,409 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:23,409 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:23,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:23,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1431646251, now seen corresponding path program 1 times [2025-01-10 02:25:23,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:23,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137706703] [2025-01-10 02:25:23,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:23,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:23,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 02:25:23,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 02:25:23,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:23,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:25:23,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1766381705] [2025-01-10 02:25:23,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:23,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:23,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:23,426 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:23,443 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:23,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-10 02:25:23,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-10 02:25:23,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:23,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:23,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:25:23,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:23,693 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:23,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:25:23,871 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:23,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:23,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137706703] [2025-01-10 02:25:23,871 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:25:23,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766381705] [2025-01-10 02:25:23,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766381705] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:25:23,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:25:23,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-01-10 02:25:23,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184337525] [2025-01-10 02:25:23,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:25:23,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:25:23,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:23,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:25:23,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:25:23,872 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:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:24,481 INFO L93 Difference]: Finished difference Result 503 states and 554 transitions. [2025-01-10 02:25:24,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:25:24,481 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:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:24,484 INFO L225 Difference]: With dead ends: 503 [2025-01-10 02:25:24,484 INFO L226 Difference]: Without dead ends: 496 [2025-01-10 02:25:24,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:25:24,484 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 291 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:24,484 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.6s Time] [2025-01-10 02:25:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-10 02:25:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 446. [2025-01-10 02:25:24,493 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:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 543 transitions. [2025-01-10 02:25:24,496 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 543 transitions. Word has length 94 [2025-01-10 02:25:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:24,497 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 543 transitions. [2025-01-10 02:25:24,497 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:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 543 transitions. [2025-01-10 02:25:24,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-10 02:25:24,498 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:24,498 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:24,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 02:25:24,698 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:24,699 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:24,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:24,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1431360706, now seen corresponding path program 1 times [2025-01-10 02:25:24,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:24,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307517748] [2025-01-10 02:25:24,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:24,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:24,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 02:25:24,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 02:25:24,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:24,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:25:24,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2065899471] [2025-01-10 02:25:24,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:24,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:24,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:24,735 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:24,736 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:24,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-10 02:25:24,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-10 02:25:24,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:24,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:24,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:25:24,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:24,972 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:24,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:25:25,320 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:25,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:25,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307517748] [2025-01-10 02:25:25,320 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:25:25,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065899471] [2025-01-10 02:25:25,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065899471] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 02:25:25,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:25:25,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-01-10 02:25:25,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014792177] [2025-01-10 02:25:25,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:25,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:25:25,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:25,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:25:25,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:25:25,322 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:25:28,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:25:31,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:25:34,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:25:34,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:34,306 INFO L93 Difference]: Finished difference Result 446 states and 543 transitions. [2025-01-10 02:25:34,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:25:34,306 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:25:34,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:34,309 INFO L225 Difference]: With dead ends: 446 [2025-01-10 02:25:34,309 INFO L226 Difference]: Without dead ends: 444 [2025-01-10 02:25:34,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:25:34,309 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 91 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s 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, 9.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:34,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 54 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2025-01-10 02:25:34,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-01-10 02:25:34,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-01-10 02:25:34,319 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:25:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 537 transitions. [2025-01-10 02:25:34,321 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 537 transitions. Word has length 95 [2025-01-10 02:25:34,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:34,321 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 537 transitions. [2025-01-10 02:25:34,321 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:25:34,321 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 537 transitions. [2025-01-10 02:25:34,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-10 02:25:34,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:34,322 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:25:34,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 02:25:34,526 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:25:34,526 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:25:34,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:34,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1422508809, now seen corresponding path program 1 times [2025-01-10 02:25:34,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:34,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796337376] [2025-01-10 02:25:34,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:34,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:34,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 02:25:34,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 02:25:34,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:34,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:25:34,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [479494312] [2025-01-10 02:25:34,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:34,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:34,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:34,557 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:25:34,561 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:25:34,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 02:25:34,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 02:25:34,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:34,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:34,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:25:34,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:34,734 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:25:34,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:25:34,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:34,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796337376] [2025-01-10 02:25:34,734 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:25:34,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479494312] [2025-01-10 02:25:34,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479494312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:34,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:34,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:25:34,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123255042] [2025-01-10 02:25:34,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:34,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:25:34,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:34,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:25:34,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:25:34,736 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:25:35,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:35,335 INFO L93 Difference]: Finished difference Result 447 states and 537 transitions. [2025-01-10 02:25:35,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:25:35,335 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:25:35,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:35,337 INFO L225 Difference]: With dead ends: 447 [2025-01-10 02:25:35,337 INFO L226 Difference]: Without dead ends: 427 [2025-01-10 02:25:35,337 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:25:35,337 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 139 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:35,338 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.6s Time] [2025-01-10 02:25:35,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-01-10 02:25:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2025-01-10 02:25:35,346 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:25:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 491 transitions. [2025-01-10 02:25:35,347 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 491 transitions. Word has length 96 [2025-01-10 02:25:35,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:35,347 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 491 transitions. [2025-01-10 02:25:35,347 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:25:35,347 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 491 transitions. [2025-01-10 02:25:35,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 02:25:35,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:35,348 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:25:35,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 02:25:35,548 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:25:35,549 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:25:35,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:35,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1148100000, now seen corresponding path program 1 times [2025-01-10 02:25:35,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:35,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877349255] [2025-01-10 02:25:35,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:35,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:35,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 02:25:35,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 02:25:35,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:35,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:25:35,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1440196051] [2025-01-10 02:25:35,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:35,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:35,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:35,576 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:25:35,577 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:25:35,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 02:25:35,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 02:25:35,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:35,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:35,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:25:35,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:35,850 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:25:35,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:25:36,030 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:25:36,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:36,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877349255] [2025-01-10 02:25:36,030 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:25:36,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440196051] [2025-01-10 02:25:36,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440196051] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 02:25:36,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:25:36,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-10 02:25:36,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069376641] [2025-01-10 02:25:36,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:36,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:25:36,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:36,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:25:36,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:25:36,031 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:25:39,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:25:43,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:25:45,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:25:47,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:47,467 INFO L93 Difference]: Finished difference Result 427 states and 491 transitions. [2025-01-10 02:25:47,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:25:47,468 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:25:47,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:47,469 INFO L225 Difference]: With dead ends: 427 [2025-01-10 02:25:47,469 INFO L226 Difference]: Without dead ends: 425 [2025-01-10 02:25:47,470 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:25:47,470 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 83 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s 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, 11.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:47,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 47 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 292 Invalid, 1 Unknown, 0 Unchecked, 11.4s Time] [2025-01-10 02:25:47,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-10 02:25:47,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-01-10 02:25:47,480 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:25:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 485 transitions. [2025-01-10 02:25:47,482 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 485 transitions. Word has length 97 [2025-01-10 02:25:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:47,482 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 485 transitions. [2025-01-10 02:25:47,482 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:25:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 485 transitions. [2025-01-10 02:25:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-10 02:25:47,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:47,483 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:25:47,489 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:25:47,687 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:25:47,687 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:25:47,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:47,687 INFO L85 PathProgramCache]: Analyzing trace with hash 769876980, now seen corresponding path program 1 times [2025-01-10 02:25:47,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:47,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122212307] [2025-01-10 02:25:47,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:47,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:47,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 02:25:47,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 02:25:47,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:47,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:47,785 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:25:47,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:47,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122212307] [2025-01-10 02:25:47,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122212307] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:25:47,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152133441] [2025-01-10 02:25:47,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:47,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:47,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:47,787 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:25:47,789 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:25:47,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 02:25:47,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 02:25:47,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:47,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:47,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:25:47,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:47,874 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:25:47,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:25:47,936 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:25:47,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152133441] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:25:47,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:25:47,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 6 [2025-01-10 02:25:47,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817181334] [2025-01-10 02:25:47,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:25:47,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:25:47,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:47,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:25:47,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:25:47,937 INFO L87 Difference]: Start difference. First operand 425 states and 485 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:25:47,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:47,967 INFO L93 Difference]: Finished difference Result 437 states and 494 transitions. [2025-01-10 02:25:47,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:25:47,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 104 [2025-01-10 02:25:47,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:47,968 INFO L225 Difference]: With dead ends: 437 [2025-01-10 02:25:47,968 INFO L226 Difference]: Without dead ends: 394 [2025-01-10 02:25:47,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 204 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:25:47,969 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 7 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:47,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 477 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:25:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-01-10 02:25:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-01-10 02:25:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 338 states have (on average 1.2988165680473374) internal successors, (439), 385 states have internal predecessors, (439), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:25:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 451 transitions. [2025-01-10 02:25:47,977 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 451 transitions. Word has length 104 [2025-01-10 02:25:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:47,978 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 451 transitions. [2025-01-10 02:25:47,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:25:47,978 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 451 transitions. [2025-01-10 02:25:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-10 02:25:47,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:47,978 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:25:47,984 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:25:48,179 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:25:48,179 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:25:48,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:48,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1769836147, now seen corresponding path program 1 times [2025-01-10 02:25:48,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:48,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831022147] [2025-01-10 02:25:48,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:48,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:48,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 02:25:48,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 02:25:48,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:48,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:48,285 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:25:48,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:48,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831022147] [2025-01-10 02:25:48,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831022147] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:25:48,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283895282] [2025-01-10 02:25:48,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:48,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:48,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:48,289 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:25:48,290 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:25:48,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 02:25:48,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 02:25:48,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:48,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:48,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:25:48,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:48,398 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:25:48,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:25:48,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283895282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:48,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:25:48,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:25:48,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006941651] [2025-01-10 02:25:48,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:48,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:25:48,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:48,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:25:48,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:25:48,400 INFO L87 Difference]: Start difference. First operand 394 states and 451 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:25:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:48,417 INFO L93 Difference]: Finished difference Result 415 states and 457 transitions. [2025-01-10 02:25:48,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:25:48,418 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:25:48,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:48,419 INFO L225 Difference]: With dead ends: 415 [2025-01-10 02:25:48,419 INFO L226 Difference]: Without dead ends: 414 [2025-01-10 02:25:48,419 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:25:48,420 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 167 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:48,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 319 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:25:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-01-10 02:25:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 393. [2025-01-10 02:25:48,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 338 states have (on average 1.2928994082840237) internal successors, (437), 384 states have internal predecessors, (437), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:25:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 449 transitions. [2025-01-10 02:25:48,429 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 449 transitions. Word has length 105 [2025-01-10 02:25:48,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:48,430 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 449 transitions. [2025-01-10 02:25:48,430 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:25:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 449 transitions. [2025-01-10 02:25:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-10 02:25:48,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:48,431 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:25:48,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 02:25:48,631 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:25:48,631 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:25:48,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:48,631 INFO L85 PathProgramCache]: Analyzing trace with hash 969654422, now seen corresponding path program 1 times [2025-01-10 02:25:48,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:48,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729764031] [2025-01-10 02:25:48,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:48,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:48,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-10 02:25:48,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-10 02:25:48,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:48,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:48,695 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:25:48,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:48,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729764031] [2025-01-10 02:25:48,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729764031] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:25:48,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222193273] [2025-01-10 02:25:48,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:48,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:48,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:48,698 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:25:48,700 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:25:48,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-10 02:25:48,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-10 02:25:48,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:48,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:48,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:25:48,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:48,815 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:25:48,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:25:48,909 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:25:48,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222193273] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:25:48,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:25:48,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 02:25:48,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951289010] [2025-01-10 02:25:48,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:25:48,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:25:48,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:48,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:25:48,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:25:48,912 INFO L87 Difference]: Start difference. First operand 393 states and 449 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:25:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:48,968 INFO L93 Difference]: Finished difference Result 584 states and 612 transitions. [2025-01-10 02:25:48,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:25:48,969 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:25:48,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:48,970 INFO L225 Difference]: With dead ends: 584 [2025-01-10 02:25:48,970 INFO L226 Difference]: Without dead ends: 583 [2025-01-10 02:25:48,970 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:25:48,971 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 168 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:48,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 882 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:25:48,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-01-10 02:25:48,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 453. [2025-01-10 02:25:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 396 states have (on average 1.3156565656565657) internal successors, (521), 442 states have internal predecessors, (521), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:25:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 537 transitions. [2025-01-10 02:25:48,981 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 537 transitions. Word has length 106 [2025-01-10 02:25:48,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:48,981 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 537 transitions. [2025-01-10 02:25:48,981 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:25:48,981 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 537 transitions. [2025-01-10 02:25:48,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-10 02:25:48,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:48,982 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:25:48,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 02:25:49,182 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:25:49,183 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:25:49,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:49,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1419332142, now seen corresponding path program 1 times [2025-01-10 02:25:49,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:49,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784081209] [2025-01-10 02:25:49,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:49,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:49,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-10 02:25:49,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-10 02:25:49,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:49,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:49,236 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:25:49,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:49,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784081209] [2025-01-10 02:25:49,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784081209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:49,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:49,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:25:49,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860432088] [2025-01-10 02:25:49,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:49,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:25:49,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:49,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:25:49,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:25:49,237 INFO L87 Difference]: Start difference. First operand 453 states and 537 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:25:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:49,378 INFO L93 Difference]: Finished difference Result 453 states and 537 transitions. [2025-01-10 02:25:49,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:25:49,379 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:25:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:49,380 INFO L225 Difference]: With dead ends: 453 [2025-01-10 02:25:49,380 INFO L226 Difference]: Without dead ends: 446 [2025-01-10 02:25:49,380 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:49,380 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 80 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:49,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 41 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:25:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-01-10 02:25:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2025-01-10 02:25:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 396 states have (on average 1.2651515151515151) internal successors, (501), 435 states have internal predecessors, (501), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:25:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 517 transitions. [2025-01-10 02:25:49,390 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 517 transitions. Word has length 121 [2025-01-10 02:25:49,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:49,390 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 517 transitions. [2025-01-10 02:25:49,390 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:25:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 517 transitions. [2025-01-10 02:25:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-10 02:25:49,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:49,391 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:25:49,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 02:25:49,391 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:25:49,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:49,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1049623385, now seen corresponding path program 1 times [2025-01-10 02:25:49,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:49,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899598954] [2025-01-10 02:25:49,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:49,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:49,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-10 02:25:49,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-10 02:25:49,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:49,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:49,437 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:25:49,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:49,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899598954] [2025-01-10 02:25:49,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899598954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:25:49,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:25:49,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:25:49,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632903019] [2025-01-10 02:25:49,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:25:49,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:25:49,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:49,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:25:49,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:25:49,439 INFO L87 Difference]: Start difference. First operand 446 states and 517 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:25:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:49,550 INFO L93 Difference]: Finished difference Result 446 states and 517 transitions. [2025-01-10 02:25:49,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:25:49,550 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:25:49,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:49,551 INFO L225 Difference]: With dead ends: 446 [2025-01-10 02:25:49,551 INFO L226 Difference]: Without dead ends: 444 [2025-01-10 02:25:49,551 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:49,551 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:25:49,552 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:25:49,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-01-10 02:25:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-01-10 02:25:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 396 states have (on average 1.2525252525252526) internal successors, (496), 433 states have internal predecessors, (496), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:25:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 512 transitions. [2025-01-10 02:25:49,561 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 512 transitions. Word has length 122 [2025-01-10 02:25:49,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:49,561 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 512 transitions. [2025-01-10 02:25:49,561 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:25:49,561 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 512 transitions. [2025-01-10 02:25:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-10 02:25:49,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:49,562 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:25:49,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 02:25:49,562 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:25:49,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:49,562 INFO L85 PathProgramCache]: Analyzing trace with hash 629243465, now seen corresponding path program 1 times [2025-01-10 02:25:49,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:49,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290855394] [2025-01-10 02:25:49,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:49,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:49,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-10 02:25:49,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-10 02:25:49,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:49,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:25:49,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:49,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290855394] [2025-01-10 02:25:49,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290855394] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:25:49,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518017320] [2025-01-10 02:25:49,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:49,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:49,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:49,665 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:25:49,669 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:25:49,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-10 02:25:49,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-10 02:25:49,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:49,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:49,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 02:25:49,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:25:49,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:25:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:25:49,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518017320] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:25:49,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:25:49,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 8 [2025-01-10 02:25:49,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810286083] [2025-01-10 02:25:49,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:25:49,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:25:49,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:49,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:25:49,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:25:49,906 INFO L87 Difference]: Start difference. First operand 444 states and 512 transitions. Second operand has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:25:49,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:49,961 INFO L93 Difference]: Finished difference Result 477 states and 530 transitions. [2025-01-10 02:25:49,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 02:25:49,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 124 [2025-01-10 02:25:49,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:49,962 INFO L225 Difference]: With dead ends: 477 [2025-01-10 02:25:49,962 INFO L226 Difference]: Without dead ends: 216 [2025-01-10 02:25:49,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 243 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:25:49,964 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 120 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:49,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 380 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:25:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-01-10 02:25:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2025-01-10 02:25:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 193 states have (on average 1.0880829015544042) internal successors, (210), 208 states have internal predecessors, (210), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:25:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 218 transitions. [2025-01-10 02:25:49,969 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 218 transitions. Word has length 124 [2025-01-10 02:25:49,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:49,970 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 218 transitions. [2025-01-10 02:25:49,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:25:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 218 transitions. [2025-01-10 02:25:49,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-10 02:25:49,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:49,971 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:25:49,980 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:25:50,171 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:25:50,171 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:25:50,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash 634199691, now seen corresponding path program 1 times [2025-01-10 02:25:50,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:50,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792098513] [2025-01-10 02:25:50,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:50,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:50,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-10 02:25:50,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-10 02:25:50,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:50,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:25:50,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1080614585] [2025-01-10 02:25:50,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:50,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:50,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:50,195 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:25:50,199 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:25:50,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-10 02:25:50,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-10 02:25:50,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:50,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:50,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 02:25:50,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:25:50,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:25:50,665 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:25:50,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:50,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792098513] [2025-01-10 02:25:50,665 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:25:50,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080614585] [2025-01-10 02:25:50,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080614585] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:25:50,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:25:50,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-01-10 02:25:50,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611744147] [2025-01-10 02:25:50,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:25:50,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:25:50,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:50,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:25:50,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:25:50,666 INFO L87 Difference]: Start difference. First operand 216 states and 218 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:25:50,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:50,893 INFO L93 Difference]: Finished difference Result 216 states and 218 transitions. [2025-01-10 02:25:50,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:25:50,893 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:25:50,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:50,894 INFO L225 Difference]: With dead ends: 216 [2025-01-10 02:25:50,894 INFO L226 Difference]: Without dead ends: 200 [2025-01-10 02:25:50,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:25:50,895 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 174 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:50,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 123 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:25:50,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-01-10 02:25:50,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2025-01-10 02:25:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 189 states have (on average 1.0105820105820107) internal successors, (191), 191 states have internal predecessors, (191), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:25:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2025-01-10 02:25:50,901 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 124 [2025-01-10 02:25:50,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:50,901 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2025-01-10 02:25:50,901 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:25:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2025-01-10 02:25:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-10 02:25:50,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:50,902 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:25:50,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 02:25:51,102 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:25:51,103 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:25:51,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:51,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1261627789, now seen corresponding path program 1 times [2025-01-10 02:25:51,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:51,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138555734] [2025-01-10 02:25:51,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:51,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:51,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-10 02:25:51,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-10 02:25:51,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:51,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:25:51,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1237659290] [2025-01-10 02:25:51,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:51,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:51,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:51,127 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:25:51,127 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:25:51,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-10 02:25:51,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-10 02:25:51,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:51,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:51,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:25:51,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:51,452 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:25:51,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:25:51,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:51,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138555734] [2025-01-10 02:25:51,660 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:25:51,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237659290] [2025-01-10 02:25:51,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237659290] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:25:51,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:25:51,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-01-10 02:25:51,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207423144] [2025-01-10 02:25:51,661 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:25:51,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:25:51,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:51,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:25:51,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:25:51,661 INFO L87 Difference]: Start difference. First operand 198 states and 199 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:25:51,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:51,844 INFO L93 Difference]: Finished difference Result 200 states and 202 transitions. [2025-01-10 02:25:51,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:25:51,845 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:25:51,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:51,846 INFO L225 Difference]: With dead ends: 200 [2025-01-10 02:25:51,846 INFO L226 Difference]: Without dead ends: 199 [2025-01-10 02:25:51,846 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:25:51,847 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:51,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 72 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:25:51,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-01-10 02:25:51,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2025-01-10 02:25:51,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 189 states have (on average 1.0052910052910053) internal successors, (190), 190 states have internal predecessors, (190), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:25:51,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2025-01-10 02:25:51,858 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 144 [2025-01-10 02:25:51,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:51,858 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2025-01-10 02:25:51,858 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:25:51,858 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2025-01-10 02:25:51,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-10 02:25:51,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:51,859 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:25:51,865 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:25:52,059 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:25:52,060 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:25:52,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:52,060 INFO L85 PathProgramCache]: Analyzing trace with hash 455756022, now seen corresponding path program 1 times [2025-01-10 02:25:52,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:52,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642018529] [2025-01-10 02:25:52,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:52,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:52,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-10 02:25:52,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-10 02:25:52,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:52,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:25:52,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [488327264] [2025-01-10 02:25:52,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:52,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:52,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:52,076 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:25:52,077 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:25:52,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-10 02:25:52,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-10 02:25:52,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:52,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:52,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:25:52,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:52,417 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:25:52,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:25:52,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:52,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642018529] [2025-01-10 02:25:52,748 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:25:52,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488327264] [2025-01-10 02:25:52,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488327264] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:25:52,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:25:52,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-01-10 02:25:52,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652047917] [2025-01-10 02:25:52,748 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:25:52,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:25:52,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:52,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:25:52,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:25:52,749 INFO L87 Difference]: Start difference. First operand 197 states and 198 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:25:52,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:52,959 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2025-01-10 02:25:52,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:25:52,959 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:25:52,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:52,960 INFO L225 Difference]: With dead ends: 200 [2025-01-10 02:25:52,960 INFO L226 Difference]: Without dead ends: 162 [2025-01-10 02:25:52,960 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:25:52,961 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:52,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 91 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:25:52,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-01-10 02:25:52,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-01-10 02:25:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 155 states have (on average 1.0) internal successors, (155), 155 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:25:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 161 transitions. [2025-01-10 02:25:52,966 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 161 transitions. Word has length 145 [2025-01-10 02:25:52,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:52,966 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 161 transitions. [2025-01-10 02:25:52,966 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:25:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 161 transitions. [2025-01-10 02:25:52,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-10 02:25:52,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:25:52,970 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-01-10 02:25:52,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 02:25:53,175 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:25:53,175 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-01-10 02:25:53,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:25:53,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1299749119, now seen corresponding path program 1 times [2025-01-10 02:25:53,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:25:53,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243931042] [2025-01-10 02:25:53,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:53,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:25:53,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-10 02:25:53,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-10 02:25:53,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:53,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:25:53,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [68286853] [2025-01-10 02:25:53,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:25:53,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:25:53,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:25:53,198 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:25:53,199 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:25:53,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-10 02:25:53,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-10 02:25:53,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:25:53,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:25:53,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 02:25:53,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:25:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:25:53,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:25:54,211 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:25:54,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:25:54,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243931042] [2025-01-10 02:25:54,211 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:25:54,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68286853] [2025-01-10 02:25:54,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68286853] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:25:54,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:25:54,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-01-10 02:25:54,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675633957] [2025-01-10 02:25:54,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:25:54,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 02:25:54,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:25:54,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 02:25:54,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:25:54,213 INFO L87 Difference]: Start difference. First operand 162 states and 161 transitions. Second operand has 12 states, 11 states have (on average 26.727272727272727) internal successors, (294), 12 states have internal predecessors, (294), 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:25:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:25:54,496 INFO L93 Difference]: Finished difference Result 162 states and 161 transitions. [2025-01-10 02:25:54,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:25:54,496 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 26.727272727272727) internal successors, (294), 12 states have internal predecessors, (294), 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 161 [2025-01-10 02:25:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:25:54,497 INFO L225 Difference]: With dead ends: 162 [2025-01-10 02:25:54,497 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:25:54,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:25:54,501 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:25:54,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:25:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:25:54,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:25:54,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:25:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:25:54,502 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2025-01-10 02:25:54,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:25:54,502 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:25:54,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 26.727272727272727) internal successors, (294), 12 states have internal predecessors, (294), 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:25:54,502 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:25:54,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 86 remaining) [2025-01-10 02:25:54,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 86 remaining) [2025-01-10 02:25:54,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 86 remaining) [2025-01-10 02:25:54,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 86 remaining) [2025-01-10 02:25:54,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 86 remaining) [2025-01-10 02:25:54,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 86 remaining) [2025-01-10 02:25:54,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 86 remaining) [2025-01-10 02:25:54,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 86 remaining) [2025-01-10 02:25:54,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 86 remaining) [2025-01-10 02:25:54,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 86 remaining) [2025-01-10 02:25:54,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 86 remaining) [2025-01-10 02:25:54,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 86 remaining) [2025-01-10 02:25:54,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 86 remaining) [2025-01-10 02:25:54,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 86 remaining) [2025-01-10 02:25:54,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 86 remaining) [2025-01-10 02:25:54,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 86 remaining) [2025-01-10 02:25:54,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 86 remaining) [2025-01-10 02:25:54,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 86 remaining) [2025-01-10 02:25:54,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 86 remaining) [2025-01-10 02:25:54,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 86 remaining) [2025-01-10 02:25:54,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 86 remaining) [2025-01-10 02:25:54,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 86 remaining) [2025-01-10 02:25:54,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 86 remaining) [2025-01-10 02:25:54,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 86 remaining) [2025-01-10 02:25:54,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 86 remaining) [2025-01-10 02:25:54,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 02:25:54,711 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:25:54,715 INFO L422 BasicCegarLoop]: Path program 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] [2025-01-10 02:25:54,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:25:54,840 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:25:54,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:25:54 BoogieIcfgContainer [2025-01-10 02:25:54,849 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:25:54,849 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:25:54,849 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:25:54,849 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:25:54,850 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:25:19" (3/4) ... [2025-01-10 02:25:54,851 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 02:25:54,859 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 02:25:54,865 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 02:25:54,865 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 02:25:54,865 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 02:25:54,866 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 02:25:54,936 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:25:54,937 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:25:54,937 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:25:54,937 INFO L158 Benchmark]: Toolchain (without parser) took 35665.57ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 129.4MB in the beginning and 105.7MB in the end (delta: 23.6MB). Peak memory consumption was 99.5MB. Max. memory is 16.1GB. [2025-01-10 02:25:54,937 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:25:54,938 INFO L158 Benchmark]: CACSL2BoogieTranslator took 158.47ms. Allocated memory is still 167.8MB. Free memory was 129.4MB in the beginning and 117.8MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:25:54,938 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.11ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 116.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:25:54,938 INFO L158 Benchmark]: Boogie Preprocessor took 37.79ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 114.7MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:25:54,939 INFO L158 Benchmark]: RCFGBuilder took 427.91ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 85.7MB in the end (delta: 29.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 02:25:54,940 INFO L158 Benchmark]: TraceAbstraction took 34917.20ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 84.8MB in the beginning and 114.0MB in the end (delta: -29.2MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2025-01-10 02:25:54,940 INFO L158 Benchmark]: Witness Printer took 87.45ms. Allocated memory is still 243.3MB. Free memory was 114.0MB in the beginning and 105.7MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:25:54,941 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 158.47ms. Allocated memory is still 167.8MB. Free memory was 129.4MB in the beginning and 117.8MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.11ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 116.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.79ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 114.7MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 427.91ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 85.7MB in the end (delta: 29.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 34917.20ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 84.8MB in the beginning and 114.0MB in the end (delta: -29.2MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * Witness Printer took 87.45ms. Allocated memory is still 243.3MB. Free memory was 114.0MB in the beginning and 105.7MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 192 locations, 86 error locations. Started 1 CEGAR loops. OverallTime: 34.7s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 2351 SdHoareTripleChecker+Valid, 24.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2325 mSDsluCounter, 6742 SdHoareTripleChecker+Invalid, 23.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3943 mSDsCounter, 201 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5211 IncrementalHoareTripleChecker+Invalid, 5413 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 201 mSolverCounterUnsat, 2799 mSDtfsCounter, 5211 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2697 GetRequests, 2576 SyntacticMatches, 11 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=453occurred in iteration=19, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 275 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 3706 NumberOfCodeBlocks, 3706 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3469 ConstructedInterpolants, 0 QuantifiedInterpolants, 18909 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2389 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 39 InterpolantComputations, 18 PerfectInterpolantSequences, 617/1265 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 86 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((((c == 1) && (x == 1)) && (y == 1)) && (1 <= k)) && (k <= 256)) && (counter == 1)) || (((((c == 0) && (y == 0)) && (counter == 0)) && (k <= 256)) && (x == 0))) || ((((((((1 <= c) && (2 == y)) && (x <= 307445734561825860)) && (c <= 9223372036854775805)) && (1 <= k)) && (k <= 256)) && (counter == 2)) && (16 <= x))) RESULT: Ultimate proved your program to be correct! [2025-01-10 02:25:54,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE