./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo2-ll2_unwindbound100.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/geo2-ll2_unwindbound100.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 9f50ec725f2d0539a1605de94af398ab61749c1d8954e8100cb71d8e6cff2c9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:09:50,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:09:50,127 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:09:50,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:09:50,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:09:50,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:09:50,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:09:50,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:09:50,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:09:50,163 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:09:50,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:09:50,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:09:50,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:09:50,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:09:50,165 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:09:50,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:09:50,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:09:50,165 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:09:50,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:09:50,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:09:50,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:09:50,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:09:50,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:09:50,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:09:50,166 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:09:50,166 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:09:50,166 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:09:50,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:09:50,166 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:09:50,167 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:09:50,167 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:09:50,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:09:50,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:09:50,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:09:50,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:09:50,167 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:09:50,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:09:50,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:09:50,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:09:50,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:09:50,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:09:50,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:09:50,168 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:09:50,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:09:50,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:09:50,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:09:50,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:09:50,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:09:50,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:09:50,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:09:50,169 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 -> 9f50ec725f2d0539a1605de94af398ab61749c1d8954e8100cb71d8e6cff2c9e [2025-01-10 02:09:50,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:09:50,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:09:50,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:09:50,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:09:50,437 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:09:50,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo2-ll2_unwindbound100.c [2025-01-10 02:09:51,650 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/baa1cbece/1e54f1490d1d4ce3880505ded92f69c5/FLAG61ca9d76f [2025-01-10 02:09:51,916 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:09:51,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo2-ll2_unwindbound100.c [2025-01-10 02:09:51,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/baa1cbece/1e54f1490d1d4ce3880505ded92f69c5/FLAG61ca9d76f [2025-01-10 02:09:51,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/baa1cbece/1e54f1490d1d4ce3880505ded92f69c5 [2025-01-10 02:09:51,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:09:51,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:09:51,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:09:51,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:09:51,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:09:51,981 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:09:51" (1/1) ... [2025-01-10 02:09:51,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@135af510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:09:51, skipping insertion in model container [2025-01-10 02:09:51,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:09:51" (1/1) ... [2025-01-10 02:09:51,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:09:52,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:09:52,157 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:09:52,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:09:52,184 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:09:52,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:09:52 WrapperNode [2025-01-10 02:09:52,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:09:52,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:09:52,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:09:52,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:09:52,193 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:09:52" (1/1) ... [2025-01-10 02:09:52,198 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:09:52" (1/1) ... [2025-01-10 02:09:52,215 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2025-01-10 02:09:52,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:09:52,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:09:52,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:09:52,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:09:52,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:09:52" (1/1) ... [2025-01-10 02:09:52,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:09:52" (1/1) ... [2025-01-10 02:09:52,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:09:52" (1/1) ... [2025-01-10 02:09:52,243 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:09:52,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:09:52" (1/1) ... [2025-01-10 02:09:52,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:09:52" (1/1) ... [2025-01-10 02:09:52,248 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:09:52" (1/1) ... [2025-01-10 02:09:52,250 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:09:52" (1/1) ... [2025-01-10 02:09:52,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:09:52" (1/1) ... [2025-01-10 02:09:52,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:09:52" (1/1) ... [2025-01-10 02:09:52,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:09:52" (1/1) ... [2025-01-10 02:09:52,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:09:52,260 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:09:52,260 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:09:52,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:09:52,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:09:52" (1/1) ... [2025-01-10 02:09:52,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:09:52,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:09:52,291 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:09:52,293 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:09:52,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:09:52,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:09:52,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:09:52,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:09:52,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:09:52,316 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:09:52,362 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:09:52,364 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:09:52,630 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-01-10 02:09:52,630 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:09:52,642 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:09:52,643 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 02:09:52,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:09:52 BoogieIcfgContainer [2025-01-10 02:09:52,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:09:52,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:09:52,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:09:52,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:09:52,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:09:51" (1/3) ... [2025-01-10 02:09:52,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5900f23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:09:52, skipping insertion in model container [2025-01-10 02:09:52,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:09:52" (2/3) ... [2025-01-10 02:09:52,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5900f23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:09:52, skipping insertion in model container [2025-01-10 02:09:52,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:09:52" (3/3) ... [2025-01-10 02:09:52,650 INFO L128 eAbstractionObserver]: Analyzing ICFG geo2-ll2_unwindbound100.c [2025-01-10 02:09:52,662 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:09:52,663 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG geo2-ll2_unwindbound100.c that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 30 error locations. [2025-01-10 02:09:52,711 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:09:52,722 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;@6825956e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:09:52,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-01-10 02:09:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 73 states have internal predecessors, (77), 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:09:52,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 02:09:52,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:09:52,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 02:09:52,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-01-10 02:09:52,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:09:52,734 INFO L85 PathProgramCache]: Analyzing trace with hash 925636, now seen corresponding path program 1 times [2025-01-10 02:09:52,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:09:52,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404539307] [2025-01-10 02:09:52,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:52,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:09:52,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 02:09:52,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 02:09:52,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:52,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:09:52,891 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:09:52,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:09:52,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404539307] [2025-01-10 02:09:52,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404539307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:09:52,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:09:52,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:09:52,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424940688] [2025-01-10 02:09:52,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:09:52,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:09:52,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:09:52,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:09:52,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:09:52,916 INFO L87 Difference]: Start difference. First operand has 77 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 73 states have internal predecessors, (77), 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) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:09:52,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:09:52,987 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2025-01-10 02:09:52,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:09:52,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-01-10 02:09:52,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:09:52,995 INFO L225 Difference]: With dead ends: 150 [2025-01-10 02:09:52,995 INFO L226 Difference]: Without dead ends: 69 [2025-01-10 02:09:52,998 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:09:53,000 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 76 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:09:53,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 140 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:09:53,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-10 02:09:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-01-10 02:09:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 66 states have internal predecessors, (68), 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:09:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2025-01-10 02:09:53,045 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 4 [2025-01-10 02:09:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:09:53,045 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2025-01-10 02:09:53,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:09:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2025-01-10 02:09:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 02:09:53,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:09:53,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 02:09:53,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:09:53,048 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-01-10 02:09:53,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:09:53,049 INFO L85 PathProgramCache]: Analyzing trace with hash 28694756, now seen corresponding path program 1 times [2025-01-10 02:09:53,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:09:53,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957425363] [2025-01-10 02:09:53,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:53,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:09:53,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 02:09:53,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 02:09:53,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:53,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:09:53,128 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:09:53,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:09:53,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957425363] [2025-01-10 02:09:53,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957425363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:09:53,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:09:53,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:09:53,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832723341] [2025-01-10 02:09:53,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:09:53,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:09:53,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:09:53,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:09:53,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:09:53,133 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:09:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:09:53,172 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2025-01-10 02:09:53,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:09:53,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-01-10 02:09:53,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:09:53,175 INFO L225 Difference]: With dead ends: 94 [2025-01-10 02:09:53,175 INFO L226 Difference]: Without dead ends: 73 [2025-01-10 02:09:53,176 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:09:53,176 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 3 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 194 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:09:53,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 194 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:09:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-10 02:09:53,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-01-10 02:09:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 70 states have internal predecessors, (72), 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:09:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2025-01-10 02:09:53,191 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 5 [2025-01-10 02:09:53,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:09:53,191 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2025-01-10 02:09:53,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:09:53,191 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2025-01-10 02:09:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 02:09:53,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:09:53,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:09:53,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:09:53,192 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-01-10 02:09:53,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:09:53,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1805858121, now seen corresponding path program 1 times [2025-01-10 02:09:53,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:09:53,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427778151] [2025-01-10 02:09:53,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:53,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:09:53,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 02:09:53,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 02:09:53,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:53,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:09:53,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1158850677] [2025-01-10 02:09:53,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:53,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:09:53,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:09:53,218 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:09:53,220 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:09:53,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 02:09:53,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 02:09:53,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:53,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:09:53,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:09:53,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:09:53,340 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:09:53,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:09:53,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:09:53,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427778151] [2025-01-10 02:09:53,342 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:09:53,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158850677] [2025-01-10 02:09:53,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158850677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:09:53,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:09:53,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:09:53,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343219249] [2025-01-10 02:09:53,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:09:53,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:09:53,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:09:53,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:09:53,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:09:53,343 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 3 states, 2 states have (on average 3.5) 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:09:53,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:09:53,508 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2025-01-10 02:09:53,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:09:53,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) 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:09:53,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:09:53,510 INFO L225 Difference]: With dead ends: 111 [2025-01-10 02:09:53,510 INFO L226 Difference]: Without dead ends: 103 [2025-01-10 02:09:53,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:09:53,511 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 28 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:09:53,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 49 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:09:53,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-10 02:09:53,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2025-01-10 02:09:53,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 91 states have internal predecessors, (106), 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:09:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2025-01-10 02:09:53,519 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 7 [2025-01-10 02:09:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:09:53,519 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2025-01-10 02:09:53,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) 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:09:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2025-01-10 02:09:53,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 02:09:53,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:09:53,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:09:53,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 02:09:53,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:09:53,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-01-10 02:09:53,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:09:53,722 INFO L85 PathProgramCache]: Analyzing trace with hash 147026953, now seen corresponding path program 1 times [2025-01-10 02:09:53,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:09:53,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144799189] [2025-01-10 02:09:53,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:53,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:09:53,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:09:53,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:09:53,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:53,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:09:53,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [43177221] [2025-01-10 02:09:53,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:53,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:09:53,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:09:53,734 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:09:53,736 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:09:53,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:09:53,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:09:53,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:53,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:09:53,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:09:53,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:09:53,826 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:09:53,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:09:53,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:09:53,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144799189] [2025-01-10 02:09:53,826 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:09:53,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43177221] [2025-01-10 02:09:53,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43177221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:09:53,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:09:53,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:09:53,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382952815] [2025-01-10 02:09:53,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:09:53,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:09:53,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:09:53,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:09:53,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:09:53,828 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:09:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:09:53,982 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2025-01-10 02:09:53,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:09:53,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-01-10 02:09:53,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:09:53,983 INFO L225 Difference]: With dead ends: 111 [2025-01-10 02:09:53,983 INFO L226 Difference]: Without dead ends: 103 [2025-01-10 02:09:53,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:09:53,984 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 27 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:09:53,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 57 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:09:53,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-10 02:09:53,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2025-01-10 02:09:53,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 93 states have internal predecessors, (102), 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:09:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2025-01-10 02:09:53,997 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 8 [2025-01-10 02:09:53,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:09:53,997 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2025-01-10 02:09:53,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:09:53,998 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2025-01-10 02:09:53,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 02:09:53,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:09:53,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:09:54,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 02:09:54,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:09:54,199 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-01-10 02:09:54,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:09:54,200 INFO L85 PathProgramCache]: Analyzing trace with hash -40446641, now seen corresponding path program 1 times [2025-01-10 02:09:54,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:09:54,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751619778] [2025-01-10 02:09:54,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:54,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:09:54,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 02:09:54,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 02:09:54,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:54,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:09:54,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1647996856] [2025-01-10 02:09:54,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:54,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:09:54,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:09:54,213 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:09:54,216 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:09:54,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 02:09:54,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 02:09:54,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:54,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:09:54,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:09:54,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:09:54,327 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:09:54,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:09:54,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:09:54,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751619778] [2025-01-10 02:09:54,331 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:09:54,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647996856] [2025-01-10 02:09:54,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647996856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:09:54,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:09:54,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:09:54,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381460785] [2025-01-10 02:09:54,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:09:54,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:09:54,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:09:54,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:09:54,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:09:54,333 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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:09:54,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:09:54,436 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2025-01-10 02:09:54,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:09:54,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2025-01-10 02:09:54,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:09:54,437 INFO L225 Difference]: With dead ends: 108 [2025-01-10 02:09:54,437 INFO L226 Difference]: Without dead ends: 105 [2025-01-10 02:09:54,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:09:54,438 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 24 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:09:54,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 56 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:09:54,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-10 02:09:54,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2025-01-10 02:09:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.537313432835821) internal successors, (103), 95 states have internal predecessors, (103), 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:09:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2025-01-10 02:09:54,448 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 13 [2025-01-10 02:09:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:09:54,448 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2025-01-10 02:09:54,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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:09:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2025-01-10 02:09:54,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 02:09:54,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:09:54,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:09:54,458 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:09:54,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:09:54,649 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-01-10 02:09:54,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:09:54,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1253845809, now seen corresponding path program 1 times [2025-01-10 02:09:54,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:09:54,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499503228] [2025-01-10 02:09:54,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:54,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:09:54,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 02:09:54,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 02:09:54,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:54,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:09:54,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1899113552] [2025-01-10 02:09:54,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:54,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:09:54,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:09:54,663 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:09:54,666 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:09:54,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 02:09:54,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 02:09:54,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:54,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:09:54,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:09:54,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:09:54,753 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:09:54,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:09:54,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:09:54,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499503228] [2025-01-10 02:09:54,753 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:09:54,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899113552] [2025-01-10 02:09:54,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899113552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:09:54,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:09:54,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:09:54,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750377899] [2025-01-10 02:09:54,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:09:54,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:09:54,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:09:54,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:09:54,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:09:54,755 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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:09:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:09:54,903 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2025-01-10 02:09:54,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:09:54,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2025-01-10 02:09:54,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:09:54,904 INFO L225 Difference]: With dead ends: 108 [2025-01-10 02:09:54,904 INFO L226 Difference]: Without dead ends: 105 [2025-01-10 02:09:54,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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:09:54,905 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 23 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:09:54,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 59 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:09:54,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-10 02:09:54,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2025-01-10 02:09:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 97 states have internal predecessors, (104), 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:09:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2025-01-10 02:09:54,915 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 14 [2025-01-10 02:09:54,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:09:54,915 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2025-01-10 02:09:54,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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:09:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2025-01-10 02:09:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 02:09:54,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:09:54,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:09:54,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 02:09:55,116 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,SelfDestructingSolverStorable5 [2025-01-10 02:09:55,117 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-01-10 02:09:55,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:09:55,117 INFO L85 PathProgramCache]: Analyzing trace with hash -214514351, now seen corresponding path program 1 times [2025-01-10 02:09:55,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:09:55,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355432391] [2025-01-10 02:09:55,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:55,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:09:55,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:09:55,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:09:55,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:55,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:09:55,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1771501394] [2025-01-10 02:09:55,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:55,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:09:55,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:09:55,137 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:09:55,139 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:09:55,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:09:55,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:09:55,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:55,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:09:55,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:09:55,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:09:55,225 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:09:55,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:09:55,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:09:55,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355432391] [2025-01-10 02:09:55,226 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:09:55,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771501394] [2025-01-10 02:09:55,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771501394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:09:55,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:09:55,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:09:55,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223701292] [2025-01-10 02:09:55,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:09:55,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:09:55,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:09:55,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:09:55,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:09:55,227 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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:09:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:09:55,371 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2025-01-10 02:09:55,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:09:55,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2025-01-10 02:09:55,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:09:55,372 INFO L225 Difference]: With dead ends: 109 [2025-01-10 02:09:55,372 INFO L226 Difference]: Without dead ends: 95 [2025-01-10 02:09:55,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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:09:55,373 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 20 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:09:55,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 65 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:09:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-10 02:09:55,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2025-01-10 02:09:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 89 states have internal predecessors, (93), 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:09:55,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2025-01-10 02:09:55,380 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 15 [2025-01-10 02:09:55,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:09:55,380 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2025-01-10 02:09:55,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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:09:55,380 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2025-01-10 02:09:55,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 02:09:55,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:09:55,380 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] [2025-01-10 02:09:55,387 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:09:55,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:09:55,581 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-01-10 02:09:55,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:09:55,581 INFO L85 PathProgramCache]: Analyzing trace with hash 791479357, now seen corresponding path program 1 times [2025-01-10 02:09:55,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:09:55,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824622595] [2025-01-10 02:09:55,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:55,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:09:55,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 02:09:55,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 02:09:55,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:55,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:09:55,668 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:09:55,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:09:55,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824622595] [2025-01-10 02:09:55,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824622595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:09:55,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:09:55,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:09:55,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637209710] [2025-01-10 02:09:55,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:09:55,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:09:55,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:09:55,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:09:55,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:09:55,669 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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:09:55,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:09:55,687 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2025-01-10 02:09:55,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:09:55,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 23 [2025-01-10 02:09:55,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:09:55,688 INFO L225 Difference]: With dead ends: 95 [2025-01-10 02:09:55,689 INFO L226 Difference]: Without dead ends: 93 [2025-01-10 02:09:55,689 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:09:55,690 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:09:55,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 130 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:09:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-10 02:09:55,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-10 02:09:55,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 89 states have internal predecessors, (91), 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:09:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2025-01-10 02:09:55,696 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 23 [2025-01-10 02:09:55,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:09:55,698 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2025-01-10 02:09:55,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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:09:55,698 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2025-01-10 02:09:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-10 02:09:55,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:09:55,700 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] [2025-01-10 02:09:55,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:09:55,700 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-01-10 02:09:55,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:09:55,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1758033391, now seen corresponding path program 1 times [2025-01-10 02:09:55,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:09:55,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134291735] [2025-01-10 02:09:55,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:55,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:09:55,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 02:09:55,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 02:09:55,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:55,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:09:55,858 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:09:55,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:09:55,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134291735] [2025-01-10 02:09:55,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134291735] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:09:55,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711145636] [2025-01-10 02:09:55,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:55,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:09:55,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:09:55,861 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:09:55,863 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:09:55,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 02:09:55,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 02:09:55,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:55,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:09:55,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:09:55,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:09:55,967 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:09:55,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:09:56,047 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:09:56,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711145636] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:09:56,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:09:56,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 9 [2025-01-10 02:09:56,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865536602] [2025-01-10 02:09:56,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:09:56,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:09:56,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:09:56,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:09:56,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:09:56,050 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:09:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:09:56,179 INFO L93 Difference]: Finished difference Result 253 states and 257 transitions. [2025-01-10 02:09:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 02:09:56,180 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-01-10 02:09:56,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:09:56,181 INFO L225 Difference]: With dead ends: 253 [2025-01-10 02:09:56,181 INFO L226 Difference]: Without dead ends: 232 [2025-01-10 02:09:56,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-01-10 02:09:56,182 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 122 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:09:56,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 399 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:09:56,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-01-10 02:09:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 156. [2025-01-10 02:09:56,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 119 states have (on average 1.5798319327731092) internal successors, (188), 147 states have internal predecessors, (188), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:09:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 196 transitions. [2025-01-10 02:09:56,193 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 196 transitions. Word has length 33 [2025-01-10 02:09:56,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:09:56,193 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 196 transitions. [2025-01-10 02:09:56,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 02:09:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 196 transitions. [2025-01-10 02:09:56,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-10 02:09:56,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:09:56,196 INFO L218 NwaCegarLoop]: trace histogram [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:09:56,204 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:09:56,396 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,SelfDestructingSolverStorable8 [2025-01-10 02:09:56,397 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-01-10 02:09:56,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:09:56,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1547940042, now seen corresponding path program 1 times [2025-01-10 02:09:56,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:09:56,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870600590] [2025-01-10 02:09:56,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:56,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:09:56,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 02:09:56,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 02:09:56,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:56,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:09:56,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1008371821] [2025-01-10 02:09:56,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:56,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:09:56,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:09:56,419 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:09:56,421 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:09:56,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 02:09:56,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 02:09:56,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:56,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:09:56,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 02:09:56,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:09:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:09:56,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:09:56,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:09:56,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870600590] [2025-01-10 02:09:56,948 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:09:56,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008371821] [2025-01-10 02:09:56,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008371821] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:09:56,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:09:56,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-01-10 02:09:56,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962402788] [2025-01-10 02:09:56,950 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:09:56,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:09:56,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:09:56,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:09:56,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:09:56,951 INFO L87 Difference]: Start difference. First operand 156 states and 196 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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:09:57,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:09:57,473 INFO L93 Difference]: Finished difference Result 176 states and 215 transitions. [2025-01-10 02:09:57,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:09:57,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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 35 [2025-01-10 02:09:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:09:57,477 INFO L225 Difference]: With dead ends: 176 [2025-01-10 02:09:57,477 INFO L226 Difference]: Without dead ends: 168 [2025-01-10 02:09:57,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:09:57,478 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 49 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 02:09:57,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 145 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 02:09:57,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-10 02:09:57,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 161. [2025-01-10 02:09:57,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 124 states have (on average 1.532258064516129) internal successors, (190), 152 states have internal predecessors, (190), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:09:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 198 transitions. [2025-01-10 02:09:57,497 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 198 transitions. Word has length 35 [2025-01-10 02:09:57,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:09:57,497 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 198 transitions. [2025-01-10 02:09:57,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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:09:57,497 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 198 transitions. [2025-01-10 02:09:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 02:09:57,498 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:09:57,498 INFO L218 NwaCegarLoop]: trace histogram [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:09:57,507 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:09:57,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:09:57,699 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-01-10 02:09:57,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:09:57,700 INFO L85 PathProgramCache]: Analyzing trace with hash -741500996, now seen corresponding path program 1 times [2025-01-10 02:09:57,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:09:57,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378092206] [2025-01-10 02:09:57,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:57,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:09:57,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 02:09:57,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:09:57,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:57,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:09:57,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1299028541] [2025-01-10 02:09:57,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:09:57,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:09:57,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:09:57,723 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:09:57,725 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:09:57,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 02:09:57,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:09:57,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:09:57,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:09:57,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 02:09:57,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:09:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:09:58,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:09:58,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:09:58,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:09:58,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378092206] [2025-01-10 02:09:58,489 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:09:58,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299028541] [2025-01-10 02:09:58,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299028541] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:09:58,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:09:58,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-10 02:09:58,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569582262] [2025-01-10 02:09:58,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:09:58,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 02:09:58,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:09:58,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 02:09:58,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:09:58,491 INFO L87 Difference]: Start difference. First operand 161 states and 198 transitions. Second operand has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 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:10:00,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:10:03,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-10 02:10:03,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:10:03,839 INFO L93 Difference]: Finished difference Result 177 states and 211 transitions. [2025-01-10 02:10:03,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:10:03,841 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 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 36 [2025-01-10 02:10:03,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:10:03,842 INFO L225 Difference]: With dead ends: 177 [2025-01-10 02:10:03,842 INFO L226 Difference]: Without dead ends: 169 [2025-01-10 02:10:03,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:10:03,843 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 60 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:10:03,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 127 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-01-10 02:10:03,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-10 02:10:03,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2025-01-10 02:10:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 154 states have internal predecessors, (185), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:10:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 193 transitions. [2025-01-10 02:10:03,851 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 193 transitions. Word has length 36 [2025-01-10 02:10:03,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:10:03,852 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 193 transitions. [2025-01-10 02:10:03,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 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:10:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions. [2025-01-10 02:10:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-10 02:10:03,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:10:03,853 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:10:03,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 02:10:04,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:10:04,058 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-01-10 02:10:04,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:10:04,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1943931260, now seen corresponding path program 1 times [2025-01-10 02:10:04,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:10:04,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119700625] [2025-01-10 02:10:04,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:10:04,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:10:04,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 02:10:04,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 02:10:04,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:10:04,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:10:04,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [453465123] [2025-01-10 02:10:04,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:10:04,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:10:04,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:10:04,080 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:10:04,082 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:10:04,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 02:10:04,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 02:10:04,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:10:04,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:10:04,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:10:04,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:10:04,170 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:10:04,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:10:07,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:10:07,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119700625] [2025-01-10 02:10:07,542 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:10:07,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453465123] [2025-01-10 02:10:07,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453465123] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:10:07,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:10:07,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2025-01-10 02:10:07,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476696176] [2025-01-10 02:10:07,542 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:10:07,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:10:07,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:10:07,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:10:07,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=18, Unknown=1, NotChecked=0, Total=30 [2025-01-10 02:10:07,543 INFO L87 Difference]: Start difference. First operand 163 states and 193 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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:10:07,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:10:07,731 INFO L93 Difference]: Finished difference Result 172 states and 200 transitions. [2025-01-10 02:10:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:10:07,731 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), 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 41 [2025-01-10 02:10:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:10:07,733 INFO L225 Difference]: With dead ends: 172 [2025-01-10 02:10:07,733 INFO L226 Difference]: Without dead ends: 169 [2025-01-10 02:10:07,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=11, Invalid=18, Unknown=1, NotChecked=0, Total=30 [2025-01-10 02:10:07,734 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:10:07,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:10:07,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-10 02:10:07,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2025-01-10 02:10:07,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 128 states have (on average 1.4375) internal successors, (184), 155 states have internal predecessors, (184), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:10:07,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 192 transitions. [2025-01-10 02:10:07,743 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 192 transitions. Word has length 41 [2025-01-10 02:10:07,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:10:07,743 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 192 transitions. [2025-01-10 02:10:07,743 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), 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:10:07,743 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 192 transitions. [2025-01-10 02:10:07,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 02:10:07,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:10:07,744 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:10:07,753 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:10:07,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:10:07,945 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-01-10 02:10:07,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:10:07,945 INFO L85 PathProgramCache]: Analyzing trace with hash 132326978, now seen corresponding path program 1 times [2025-01-10 02:10:07,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:10:07,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467680721] [2025-01-10 02:10:07,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:10:07,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:10:07,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 02:10:07,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 02:10:07,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:10:07,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:10:07,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2014064483] [2025-01-10 02:10:07,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:10:07,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:10:07,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:10:07,963 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:10:07,965 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:10:07,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 02:10:08,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 02:10:08,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:10:08,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:10:08,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 02:10:08,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:10:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:10:08,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:10:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:10:08,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:10:08,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467680721] [2025-01-10 02:10:08,865 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:10:08,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014064483] [2025-01-10 02:10:08,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014064483] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:10:08,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:10:08,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-10 02:10:08,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872310653] [2025-01-10 02:10:08,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:10:08,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 02:10:08,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:10:08,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 02:10:08,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:10:08,868 INFO L87 Difference]: Start difference. First operand 164 states and 192 transitions. Second operand has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 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:10:09,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:10:09,804 INFO L93 Difference]: Finished difference Result 177 states and 209 transitions. [2025-01-10 02:10:09,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:10:09,804 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 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 42 [2025-01-10 02:10:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:10:09,805 INFO L225 Difference]: With dead ends: 177 [2025-01-10 02:10:09,805 INFO L226 Difference]: Without dead ends: 174 [2025-01-10 02:10:09,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:10:09,806 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 51 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 02:10:09,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 210 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 02:10:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-01-10 02:10:09,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2025-01-10 02:10:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 160 states have internal predecessors, (191), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:10:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 199 transitions. [2025-01-10 02:10:09,814 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 199 transitions. Word has length 42 [2025-01-10 02:10:09,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:10:09,815 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 199 transitions. [2025-01-10 02:10:09,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 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:10:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 199 transitions. [2025-01-10 02:10:09,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-10 02:10:09,815 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:10:09,816 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:10:09,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 02:10:10,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 02:10:10,016 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-01-10 02:10:10,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:10:10,017 INFO L85 PathProgramCache]: Analyzing trace with hash -192830914, now seen corresponding path program 1 times [2025-01-10 02:10:10,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:10:10,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720184730] [2025-01-10 02:10:10,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:10:10,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:10:10,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 02:10:10,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 02:10:10,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:10:10,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:10:10,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [857862445] [2025-01-10 02:10:10,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:10:10,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:10:10,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:10:10,031 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:10:10,033 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:10:10,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 02:10:10,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 02:10:10,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:10:10,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:10:10,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:10:10,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:10:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:10:10,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:10:10,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:10:10,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720184730] [2025-01-10 02:10:10,345 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:10:10,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857862445] [2025-01-10 02:10:10,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857862445] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:10:10,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:10:10,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-01-10 02:10:10,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996427353] [2025-01-10 02:10:10,345 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:10:10,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:10:10,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:10:10,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:10:10,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:10:10,346 INFO L87 Difference]: Start difference. First operand 169 states and 199 transitions. Second operand has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 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:10:10,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:10:10,566 INFO L93 Difference]: Finished difference Result 178 states and 203 transitions. [2025-01-10 02:10:10,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:10:10,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 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 43 [2025-01-10 02:10:10,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:10:10,568 INFO L225 Difference]: With dead ends: 178 [2025-01-10 02:10:10,568 INFO L226 Difference]: Without dead ends: 164 [2025-01-10 02:10:10,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:10:10,569 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 20 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:10:10,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 113 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:10:10,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-01-10 02:10:10,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2025-01-10 02:10:10,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 127 states have (on average 1.4251968503937007) internal successors, (181), 153 states have internal predecessors, (181), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:10:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 189 transitions. [2025-01-10 02:10:10,575 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 189 transitions. Word has length 43 [2025-01-10 02:10:10,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:10:10,575 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 189 transitions. [2025-01-10 02:10:10,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 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:10:10,576 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 189 transitions. [2025-01-10 02:10:10,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-10 02:10:10,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:10:10,576 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:10:10,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 02:10:10,777 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,SelfDestructingSolverStorable13 [2025-01-10 02:10:10,777 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-01-10 02:10:10,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:10:10,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1496753194, now seen corresponding path program 1 times [2025-01-10 02:10:10,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:10:10,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741872549] [2025-01-10 02:10:10,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:10:10,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:10:10,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 02:10:10,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 02:10:10,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:10:10,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:10:10,866 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:10:10,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:10:10,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741872549] [2025-01-10 02:10:10,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741872549] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:10:10,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652573380] [2025-01-10 02:10:10,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:10:10,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:10:10,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:10:10,869 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:10:10,871 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:10:10,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 02:10:10,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 02:10:10,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:10:10,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:10:10,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:10:10,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:10:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:10:10,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:10:10,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652573380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:10:10,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:10:10,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:10:10,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119802183] [2025-01-10 02:10:10,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:10:10,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:10:10,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:10:10,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:10:10,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:10:10,961 INFO L87 Difference]: Start difference. First operand 162 states and 189 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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:10:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:10:10,981 INFO L93 Difference]: Finished difference Result 172 states and 192 transitions. [2025-01-10 02:10:10,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:10:10,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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 51 [2025-01-10 02:10:10,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:10:10,983 INFO L225 Difference]: With dead ends: 172 [2025-01-10 02:10:10,983 INFO L226 Difference]: Without dead ends: 171 [2025-01-10 02:10:10,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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:10:10,983 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 71 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:10:10,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 115 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:10:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-10 02:10:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 161. [2025-01-10 02:10:10,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 127 states have (on average 1.4015748031496063) internal successors, (178), 152 states have internal predecessors, (178), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:10:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2025-01-10 02:10:10,993 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 51 [2025-01-10 02:10:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:10:10,993 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2025-01-10 02:10:10,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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:10:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2025-01-10 02:10:10,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-10 02:10:10,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:10:10,996 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:10:11,004 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:10:11,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:10:11,197 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-01-10 02:10:11,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:10:11,197 INFO L85 PathProgramCache]: Analyzing trace with hash -845291166, now seen corresponding path program 1 times [2025-01-10 02:10:11,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:10:11,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601157581] [2025-01-10 02:10:11,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:10:11,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:10:11,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 02:10:11,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 02:10:11,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:10:11,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:10:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:10:11,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:10:11,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601157581] [2025-01-10 02:10:11,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601157581] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:10:11,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372693806] [2025-01-10 02:10:11,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:10:11,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:10:11,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:10:11,271 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:10:11,273 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:10:11,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 02:10:11,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 02:10:11,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:10:11,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:10:11,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:10:11,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:10:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:10:11,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:10:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:10:11,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372693806] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:10:11,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:10:11,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 02:10:11,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406779214] [2025-01-10 02:10:11,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:10:11,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:10:11,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:10:11,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:10:11,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:10:11,428 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 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:10:11,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:10:11,463 INFO L93 Difference]: Finished difference Result 241 states and 253 transitions. [2025-01-10 02:10:11,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:10:11,464 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 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 52 [2025-01-10 02:10:11,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:10:11,465 INFO L225 Difference]: With dead ends: 241 [2025-01-10 02:10:11,465 INFO L226 Difference]: Without dead ends: 240 [2025-01-10 02:10:11,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 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:10:11,466 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 100 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:10:11,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 252 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:10:11,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-01-10 02:10:11,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 176. [2025-01-10 02:10:11,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 141 states have (on average 1.4326241134751774) internal successors, (202), 166 states have internal predecessors, (202), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:10:11,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 212 transitions. [2025-01-10 02:10:11,472 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 212 transitions. Word has length 52 [2025-01-10 02:10:11,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:10:11,473 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 212 transitions. [2025-01-10 02:10:11,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 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:10:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 212 transitions. [2025-01-10 02:10:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 02:10:11,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:10:11,474 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, 1, 1, 1] [2025-01-10 02:10:11,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 02:10:11,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:10:11,674 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-01-10 02:10:11,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:10:11,674 INFO L85 PathProgramCache]: Analyzing trace with hash 949777315, now seen corresponding path program 2 times [2025-01-10 02:10:11,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:10:11,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757669959] [2025-01-10 02:10:11,675 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:10:11,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:10:11,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-01-10 02:10:11,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 02:10:11,699 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:10:11,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:10:11,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [491655746] [2025-01-10 02:10:11,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:10:11,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:10:11,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:10:11,703 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:10:11,705 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:10:11,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-01-10 02:10:11,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 02:10:11,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:10:11,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 02:10:11,748 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 02:10:11,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 02:10:11,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 02:10:11,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:10:11,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 02:10:11,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 02:10:11,786 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 02:10:11,787 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2025-01-10 02:10:11,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2025-01-10 02:10:11,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2025-01-10 02:10:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2025-01-10 02:10:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2025-01-10 02:10:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2025-01-10 02:10:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2025-01-10 02:10:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2025-01-10 02:10:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2025-01-10 02:10:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2025-01-10 02:10:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2025-01-10 02:10:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2025-01-10 02:10:11,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2025-01-10 02:10:11,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2025-01-10 02:10:11,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2025-01-10 02:10:11,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2025-01-10 02:10:11,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2025-01-10 02:10:11,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2025-01-10 02:10:11,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2025-01-10 02:10:11,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2025-01-10 02:10:11,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2025-01-10 02:10:11,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2025-01-10 02:10:11,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2025-01-10 02:10:11,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2025-01-10 02:10:11,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2025-01-10 02:10:11,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2025-01-10 02:10:11,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2025-01-10 02:10:11,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2025-01-10 02:10:11,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2025-01-10 02:10:11,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2025-01-10 02:10:11,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-10 02:10:11,992 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,SelfDestructingSolverStorable16 [2025-01-10 02:10:11,995 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:10:12,035 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:10:12,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:10:12 BoogieIcfgContainer [2025-01-10 02:10:12,038 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:10:12,039 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:10:12,039 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:10:12,039 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:10:12,039 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:09:52" (3/4) ... [2025-01-10 02:10:12,040 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-10 02:10:12,085 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-01-10 02:10:12,128 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:10:12,130 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:10:12,130 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:10:12,130 INFO L158 Benchmark]: Toolchain (without parser) took 20162.07ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 95.4MB in the end (delta: 17.6MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2025-01-10 02:10:12,131 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:10:12,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.13ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 102.4MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:10:12,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.37ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:10:12,131 INFO L158 Benchmark]: Boogie Preprocessor took 41.25ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:10:12,131 INFO L158 Benchmark]: RCFGBuilder took 383.27ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 84.5MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 02:10:12,132 INFO L158 Benchmark]: TraceAbstraction took 19393.17ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 102.4MB in the end (delta: -18.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:10:12,132 INFO L158 Benchmark]: Witness Printer took 91.30ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 95.4MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:10:12,133 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.13ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 102.4MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.37ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.25ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 383.27ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 84.5MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19393.17ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 102.4MB in the end (delta: -18.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 91.30ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 95.4MB in the end (delta: 7.0MB). 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 - CounterExampleResult [Line: 35]: integer overflow possible integer overflow possible We found a FailurePath: [L23] int counter = 0; VAL [counter=0] [L25] int z, k; [L26] long long x, y, c; [L27] z = __VERIFIER_nondet_int() [L28] k = __VERIFIER_nondet_int() [L30] x = 1 [L31] y = 1 [L32] c = 1 VAL [c=1, counter=0, k=3, x=1, y=1, z=-2147483647] [L34] EXPR counter++ VAL [c=1, counter=1, k=3, x=1, y=1, z=-2147483647] [L34] COND TRUE counter++<100 [L35] EXPR x*z VAL [c=1, counter=1, k=3, x=1, y=1, z=-2147483647] [L35] EXPR 1 + x*z VAL [c=1, counter=1, k=3, x=1, y=1, z=-2147483647] [L35] EXPR 1 + x*z - x VAL [c=1, counter=1, k=3, x=1, y=1, z=-2147483647] [L35] EXPR z*y VAL [c=1, counter=1, k=3, x=1, y=1, z=-2147483647] [L35] EXPR 1 + x*z - x - z*y VAL [c=1, counter=1, k=3, x=1, y=1, z=-2147483647] [L35] CALL __VERIFIER_assert(1 + x*z - x - z*y == 0) VAL [counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(1 + x*z - x - z*y == 0) VAL [c=1, counter=1, k=3, x=1, y=1, z=-2147483647] [L37] COND FALSE !(!(c < k)) VAL [c=1, counter=1, k=3, x=1, y=1, z=-2147483647] [L40] EXPR c + 1 [L40] c = c + 1 VAL [c=2, counter=1, k=3, x=1, y=1, z=-2147483647] [L41] EXPR x * z VAL [c=2, counter=1, k=3, x=1, y=1, z=-2147483647] [L41] EXPR x * z + 1 [L41] x = x * z + 1 VAL [c=2, counter=1, k=3, x=-2147483646, y=1, z=-2147483647] [L42] EXPR y * z [L42] y = y * z VAL [c=2, counter=1, k=3, x=-2147483646, y=-2147483647, z=-2147483647] [L34] EXPR counter++ VAL [c=2, counter=2, k=3, x=-2147483646, y=-2147483647, z=-2147483647] [L34] COND TRUE counter++<100 [L35] EXPR x*z VAL [c=2, counter=2, k=3, x=-2147483646, y=-2147483647, z=-2147483647] [L35] EXPR 1 + x*z VAL [c=2, counter=2, k=3, x=-2147483646, y=-2147483647, z=-2147483647] [L35] EXPR 1 + x*z - x VAL [c=2, counter=2, k=3, x=-2147483646, y=-2147483647, z=-2147483647] [L35] EXPR z*y VAL [c=2, counter=2, k=3, x=-2147483646, y=-2147483647, z=-2147483647] [L35] EXPR 1 + x*z - x - z*y VAL [c=2, counter=2, k=3, x=-2147483646, y=-2147483647, z=-2147483647] [L35] CALL __VERIFIER_assert(1 + x*z - x - z*y == 0) VAL [counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(1 + x*z - x - z*y == 0) VAL [c=2, counter=2, k=3, x=-2147483646, y=-2147483647, z=-2147483647] [L37] COND FALSE !(!(c < k)) VAL [c=2, counter=2, k=3, x=-2147483646, y=-2147483647, z=-2147483647] [L40] EXPR c + 1 [L40] c = c + 1 VAL [c=3, counter=2, k=3, x=-2147483646, y=-2147483647, z=-2147483647] [L41] EXPR x * z VAL [c=3, counter=2, k=3, x=-2147483646, y=-2147483647, z=-2147483647] [L41] EXPR x * z + 1 [L41] x = x * z + 1 VAL [c=3, counter=2, k=3, x=4611686011984936963, y=-2147483647, z=-2147483647] [L42] EXPR y * z [L42] y = y * z VAL [c=3, counter=2, k=3, x=4611686011984936963, y=4611686014132420609, z=-2147483647] [L34] EXPR counter++ VAL [c=3, counter=3, k=3, x=4611686011984936963, y=4611686014132420609, z=-2147483647] [L34] COND TRUE counter++<100 [L35] x*z VAL [c=3, counter=3, k=3, y=4611686014132420609] - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 19.3s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 713 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 699 mSDsluCounter, 2218 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1400 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2011 IncrementalHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 818 mSDtfsCounter, 2011 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 626 GetRequests, 550 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=16, InterpolantAutomatonStates: 85, 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, 16 MinimizatonAttempts, 201 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 698 ConstructedInterpolants, 7 QuantifiedInterpolants, 3914 SizeOfPredicates, 6 NumberOfNonLiveVariables, 942 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 23 InterpolantComputations, 9 PerfectInterpolantSequences, 37/182 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 RESULT: Ultimate proved your program to be incorrect! [2025-01-10 02:10:12,156 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)