./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.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/recursive-simple/id2_i5_o5-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c0fb6a0d32b99c9a776859d2bc15d9177dc584955a2c1baa8ac133e976f40f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:33:05,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:33:05,846 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:33:05,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:33:05,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:33:05,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:33:05,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:33:05,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:33:05,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:33:05,890 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:33:05,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:33:05,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:33:05,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:33:05,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:33:05,892 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:33:05,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:33:05,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:33:05,892 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:33:05,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:33:05,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:33:05,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:33:05,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:33:05,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:33:05,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:33:05,893 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:33:05,893 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:33:05,893 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:33:05,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:33:05,893 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:33:05,893 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:33:05,893 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:33:05,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:33:05,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:33:05,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:33:05,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:33:05,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:33:05,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:33:05,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:33:05,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:33:05,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:33:05,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:33:05,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:33:05,894 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:33:05,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:33:05,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:33:05,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:33:05,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:33:05,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:33:05,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:33:05,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:33:05,895 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 -> 9c0fb6a0d32b99c9a776859d2bc15d9177dc584955a2c1baa8ac133e976f40f7 [2025-01-10 02:33:06,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:33:06,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:33:06,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:33:06,185 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:33:06,186 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:33:06,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2025-01-10 02:33:07,458 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c394bab82/5bc4ffc493524fc7bad4585b00bf104a/FLAG3da1e849a [2025-01-10 02:33:07,689 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:33:07,690 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2025-01-10 02:33:07,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c394bab82/5bc4ffc493524fc7bad4585b00bf104a/FLAG3da1e849a [2025-01-10 02:33:08,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c394bab82/5bc4ffc493524fc7bad4585b00bf104a [2025-01-10 02:33:08,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:33:08,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:33:08,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:33:08,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:33:08,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:33:08,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:33:08" (1/1) ... [2025-01-10 02:33:08,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28de8d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:08, skipping insertion in model container [2025-01-10 02:33:08,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:33:08" (1/1) ... [2025-01-10 02:33:08,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:33:08,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:33:08,207 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:33:08,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:33:08,231 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:33:08,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:08 WrapperNode [2025-01-10 02:33:08,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:33:08,233 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:33:08,233 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:33:08,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:33:08,239 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:33:08" (1/1) ... [2025-01-10 02:33:08,246 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:33:08" (1/1) ... [2025-01-10 02:33:08,259 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 19 [2025-01-10 02:33:08,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:33:08,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:33:08,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:33:08,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:33:08,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:08" (1/1) ... [2025-01-10 02:33:08,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:08" (1/1) ... [2025-01-10 02:33:08,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:08" (1/1) ... [2025-01-10 02:33:08,283 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:33:08,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:08" (1/1) ... [2025-01-10 02:33:08,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:08" (1/1) ... [2025-01-10 02:33:08,286 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:08" (1/1) ... [2025-01-10 02:33:08,290 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:08" (1/1) ... [2025-01-10 02:33:08,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:08" (1/1) ... [2025-01-10 02:33:08,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:08" (1/1) ... [2025-01-10 02:33:08,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:08" (1/1) ... [2025-01-10 02:33:08,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:33:08,296 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:33:08,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:33:08,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:33:08,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:08" (1/1) ... [2025-01-10 02:33:08,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:33:08,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:33:08,328 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:33:08,334 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:33:08,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:33:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:33:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2025-01-10 02:33:08,358 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2025-01-10 02:33:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:33:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:33:08,359 INFO L130 BoogieDeclarations]: Found specification of procedure id [2025-01-10 02:33:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2025-01-10 02:33:08,414 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:33:08,416 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:33:08,535 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-10 02:33:08,535 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:33:08,543 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:33:08,544 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 02:33:08,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:33:08 BoogieIcfgContainer [2025-01-10 02:33:08,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:33:08,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:33:08,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:33:08,551 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:33:08,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:33:08" (1/3) ... [2025-01-10 02:33:08,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b081aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:33:08, skipping insertion in model container [2025-01-10 02:33:08,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:08" (2/3) ... [2025-01-10 02:33:08,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b081aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:33:08, skipping insertion in model container [2025-01-10 02:33:08,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:33:08" (3/3) ... [2025-01-10 02:33:08,554 INFO L128 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-2.c [2025-01-10 02:33:08,567 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:33:08,568 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG id2_i5_o5-2.c that has 3 procedures, 38 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-01-10 02:33:08,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:33:08,635 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;@7c08fc31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:33:08,636 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 02:33:08,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:33:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 02:33:08,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:08,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 02:33:08,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:08,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:08,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1363745714, now seen corresponding path program 1 times [2025-01-10 02:33:08,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:08,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712665823] [2025-01-10 02:33:08,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:08,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:08,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 02:33:08,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 02:33:08,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:08,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:08,843 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:33:08,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:08,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712665823] [2025-01-10 02:33:08,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712665823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:33:08,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:33:08,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:33:08,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738316237] [2025-01-10 02:33:08,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:33:08,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:33:08,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:08,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:33:08,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:33:08,863 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:08,935 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2025-01-10 02:33:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:33:08,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 02:33:08,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:08,941 INFO L225 Difference]: With dead ends: 60 [2025-01-10 02:33:08,941 INFO L226 Difference]: Without dead ends: 42 [2025-01-10 02:33:08,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:33:08,950 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:08,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 127 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:33:08,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-10 02:33:08,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2025-01-10 02:33:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.48) internal successors, (37), 32 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:33:08,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-01-10 02:33:08,984 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 6 [2025-01-10 02:33:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:08,985 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-01-10 02:33:08,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-01-10 02:33:08,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 02:33:08,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:08,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:33:08,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:33:08,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:08,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash -673555755, now seen corresponding path program 1 times [2025-01-10 02:33:08,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:08,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115807245] [2025-01-10 02:33:08,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:08,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:08,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 02:33:09,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 02:33:09,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:09,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:09,056 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:33:09,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:09,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115807245] [2025-01-10 02:33:09,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115807245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:33:09,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:33:09,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:33:09,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392521351] [2025-01-10 02:33:09,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:33:09,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:33:09,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:09,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:33:09,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:33:09,059 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:09,108 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2025-01-10 02:33:09,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:33:09,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 02:33:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:09,111 INFO L225 Difference]: With dead ends: 42 [2025-01-10 02:33:09,111 INFO L226 Difference]: Without dead ends: 41 [2025-01-10 02:33:09,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:33:09,112 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:09,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 113 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:33:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-10 02:33:09,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-01-10 02:33:09,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.44) internal successors, (36), 32 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:33:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-01-10 02:33:09,122 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 7 [2025-01-10 02:33:09,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:09,122 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-01-10 02:33:09,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:09,122 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2025-01-10 02:33:09,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 02:33:09,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:09,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:33:09,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:33:09,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:09,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:09,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1526536194, now seen corresponding path program 1 times [2025-01-10 02:33:09,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:09,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047501657] [2025-01-10 02:33:09,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:09,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:09,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 02:33:09,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 02:33:09,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:09,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:09,216 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:33:09,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:09,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047501657] [2025-01-10 02:33:09,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047501657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:33:09,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:33:09,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:33:09,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546062743] [2025-01-10 02:33:09,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:33:09,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:33:09,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:09,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:33:09,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:33:09,219 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:09,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:09,307 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2025-01-10 02:33:09,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:33:09,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 02:33:09,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:09,309 INFO L225 Difference]: With dead ends: 62 [2025-01-10 02:33:09,309 INFO L226 Difference]: Without dead ends: 54 [2025-01-10 02:33:09,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:33:09,310 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 31 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:09,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 138 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:33:09,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-10 02:33:09,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2025-01-10 02:33:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 40 states have internal predecessors, (47), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:33:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-01-10 02:33:09,323 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 11 [2025-01-10 02:33:09,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:09,324 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-01-10 02:33:09,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-01-10 02:33:09,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 02:33:09,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:09,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:33:09,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:33:09,326 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:09,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:09,326 INFO L85 PathProgramCache]: Analyzing trace with hash 77981796, now seen corresponding path program 1 times [2025-01-10 02:33:09,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:09,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116423751] [2025-01-10 02:33:09,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:09,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:09,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 02:33:09,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 02:33:09,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:09,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:09,449 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:33:09,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:09,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116423751] [2025-01-10 02:33:09,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116423751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:33:09,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:33:09,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:33:09,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235456167] [2025-01-10 02:33:09,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:33:09,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:33:09,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:09,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:33:09,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:33:09,452 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:09,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:09,554 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2025-01-10 02:33:09,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:33:09,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-10 02:33:09,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:09,557 INFO L225 Difference]: With dead ends: 53 [2025-01-10 02:33:09,557 INFO L226 Difference]: Without dead ends: 51 [2025-01-10 02:33:09,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:33:09,559 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:09,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 80 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:33:09,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-10 02:33:09,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2025-01-10 02:33:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 38 states have internal predecessors, (44), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:33:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-01-10 02:33:09,577 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 12 [2025-01-10 02:33:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:09,577 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-01-10 02:33:09,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-01-10 02:33:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 02:33:09,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:09,579 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:33:09,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:33:09,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:09,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:09,581 INFO L85 PathProgramCache]: Analyzing trace with hash -182979434, now seen corresponding path program 1 times [2025-01-10 02:33:09,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:09,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439957636] [2025-01-10 02:33:09,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:09,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:09,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 02:33:09,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 02:33:09,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:09,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:09,731 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:33:09,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:09,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439957636] [2025-01-10 02:33:09,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439957636] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:33:09,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703368888] [2025-01-10 02:33:09,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:09,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:33:09,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:33:09,736 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:33:09,738 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:33:09,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 02:33:09,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 02:33:09,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:09,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:09,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:33:09,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:33:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:33:09,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:33:10,000 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:33:10,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703368888] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:33:10,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:33:10,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-01-10 02:33:10,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049598685] [2025-01-10 02:33:10,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:33:10,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 02:33:10,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:10,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 02:33:10,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:33:10,002 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:10,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:10,202 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2025-01-10 02:33:10,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 02:33:10,203 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-10 02:33:10,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:10,204 INFO L225 Difference]: With dead ends: 109 [2025-01-10 02:33:10,204 INFO L226 Difference]: Without dead ends: 93 [2025-01-10 02:33:10,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-01-10 02:33:10,205 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 126 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:10,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 248 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:33:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-10 02:33:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2025-01-10 02:33:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 62 states have internal predecessors, (76), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 02:33:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2025-01-10 02:33:10,225 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 16 [2025-01-10 02:33:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:10,225 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2025-01-10 02:33:10,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2025-01-10 02:33:10,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 02:33:10,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:10,227 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:33:10,235 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:33:10,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:33:10,431 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:10,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:10,431 INFO L85 PathProgramCache]: Analyzing trace with hash 858638830, now seen corresponding path program 1 times [2025-01-10 02:33:10,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:10,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593187612] [2025-01-10 02:33:10,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:10,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:10,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:33:10,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:33:10,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:10,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:10,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:33:10,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:10,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593187612] [2025-01-10 02:33:10,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593187612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:33:10,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:33:10,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:33:10,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002018495] [2025-01-10 02:33:10,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:33:10,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:33:10,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:10,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:33:10,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:33:10,494 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:33:10,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:10,519 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2025-01-10 02:33:10,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:33:10,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-01-10 02:33:10,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:10,520 INFO L225 Difference]: With dead ends: 92 [2025-01-10 02:33:10,520 INFO L226 Difference]: Without dead ends: 90 [2025-01-10 02:33:10,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:33:10,521 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:10,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:33:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-10 02:33:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-10 02:33:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 72 states have internal predecessors, (87), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2025-01-10 02:33:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions. [2025-01-10 02:33:10,532 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 105 transitions. Word has length 24 [2025-01-10 02:33:10,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:10,532 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 105 transitions. [2025-01-10 02:33:10,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:33:10,532 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2025-01-10 02:33:10,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 02:33:10,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:10,533 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:33:10,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 02:33:10,533 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:10,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:10,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1790531986, now seen corresponding path program 1 times [2025-01-10 02:33:10,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:10,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260596560] [2025-01-10 02:33:10,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:10,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:10,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 02:33:10,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 02:33:10,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:10,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 02:33:10,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:10,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260596560] [2025-01-10 02:33:10,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260596560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:33:10,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:33:10,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:33:10,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061017465] [2025-01-10 02:33:10,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:33:10,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:33:10,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:10,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:33:10,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:33:10,589 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:33:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:10,615 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2025-01-10 02:33:10,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:33:10,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-01-10 02:33:10,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:10,617 INFO L225 Difference]: With dead ends: 102 [2025-01-10 02:33:10,617 INFO L226 Difference]: Without dead ends: 100 [2025-01-10 02:33:10,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:33:10,618 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:10,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:33:10,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-10 02:33:10,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-01-10 02:33:10,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.25) internal successors, (95), 80 states have internal predecessors, (95), 8 states have call successors, (8), 7 states have call predecessors, (8), 10 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2025-01-10 02:33:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2025-01-10 02:33:10,629 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 29 [2025-01-10 02:33:10,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:10,630 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2025-01-10 02:33:10,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:33:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2025-01-10 02:33:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 02:33:10,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:10,631 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:33:10,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:33:10,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:10,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:10,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1502278371, now seen corresponding path program 1 times [2025-01-10 02:33:10,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:10,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347001245] [2025-01-10 02:33:10,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:10,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:10,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 02:33:10,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 02:33:10,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:10,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:33:10,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:10,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347001245] [2025-01-10 02:33:10,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347001245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:33:10,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:33:10,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:33:10,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229017851] [2025-01-10 02:33:10,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:33:10,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:33:10,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:10,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:33:10,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:33:10,680 INFO L87 Difference]: Start difference. First operand 100 states and 115 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:33:10,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:10,690 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2025-01-10 02:33:10,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:33:10,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-01-10 02:33:10,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:10,692 INFO L225 Difference]: With dead ends: 100 [2025-01-10 02:33:10,692 INFO L226 Difference]: Without dead ends: 99 [2025-01-10 02:33:10,693 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:33:10,693 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:10,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:33:10,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-10 02:33:10,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-10 02:33:10,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 79 states have internal predecessors, (92), 8 states have call successors, (8), 7 states have call predecessors, (8), 10 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2025-01-10 02:33:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2025-01-10 02:33:10,713 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 29 [2025-01-10 02:33:10,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:10,713 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2025-01-10 02:33:10,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:33:10,717 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2025-01-10 02:33:10,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 02:33:10,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:10,718 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 02:33:10,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:33:10,719 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:10,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:10,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2091519942, now seen corresponding path program 1 times [2025-01-10 02:33:10,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:10,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380072823] [2025-01-10 02:33:10,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:10,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:10,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 02:33:10,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 02:33:10,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:10,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:10,935 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:33:10,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:10,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380072823] [2025-01-10 02:33:10,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380072823] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:33:10,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778742252] [2025-01-10 02:33:10,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:10,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:33:10,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:33:10,938 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:33:10,940 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:33:10,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 02:33:10,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 02:33:10,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:10,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:10,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 02:33:10,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:33:11,066 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:33:11,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:33:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:33:11,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778742252] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:33:11,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:33:11,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2025-01-10 02:33:11,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355073198] [2025-01-10 02:33:11,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:33:11,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 02:33:11,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:11,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 02:33:11,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2025-01-10 02:33:11,357 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 28 states, 25 states have (on average 1.96) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:11,792 INFO L93 Difference]: Finished difference Result 242 states and 260 transitions. [2025-01-10 02:33:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-10 02:33:11,792 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.96) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-01-10 02:33:11,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:11,794 INFO L225 Difference]: With dead ends: 242 [2025-01-10 02:33:11,794 INFO L226 Difference]: Without dead ends: 212 [2025-01-10 02:33:11,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2025-01-10 02:33:11,796 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 291 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:11,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 394 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:33:11,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-01-10 02:33:11,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 194. [2025-01-10 02:33:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 152 states have (on average 1.2039473684210527) internal successors, (183), 155 states have internal predecessors, (183), 15 states have call successors, (15), 14 states have call predecessors, (15), 22 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2025-01-10 02:33:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2025-01-10 02:33:11,826 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 31 [2025-01-10 02:33:11,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:11,826 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2025-01-10 02:33:11,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.96) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:11,826 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2025-01-10 02:33:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-10 02:33:11,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:11,827 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:33:11,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 02:33:12,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:33:12,028 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:12,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:12,028 INFO L85 PathProgramCache]: Analyzing trace with hash -308357491, now seen corresponding path program 1 times [2025-01-10 02:33:12,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:12,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138403965] [2025-01-10 02:33:12,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:12,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:12,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 02:33:12,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 02:33:12,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:12,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:33:12,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:12,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138403965] [2025-01-10 02:33:12,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138403965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:33:12,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:33:12,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:33:12,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068952917] [2025-01-10 02:33:12,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:33:12,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:33:12,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:12,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:33:12,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:33:12,131 INFO L87 Difference]: Start difference. First operand 194 states and 222 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:33:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:12,170 INFO L93 Difference]: Finished difference Result 223 states and 257 transitions. [2025-01-10 02:33:12,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:33:12,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2025-01-10 02:33:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:12,172 INFO L225 Difference]: With dead ends: 223 [2025-01-10 02:33:12,173 INFO L226 Difference]: Without dead ends: 222 [2025-01-10 02:33:12,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:33:12,174 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:12,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:33:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-01-10 02:33:12,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 199. [2025-01-10 02:33:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 156 states have (on average 1.1987179487179487) internal successors, (187), 159 states have internal predecessors, (187), 15 states have call successors, (15), 14 states have call predecessors, (15), 23 states have return successors, (25), 25 states have call predecessors, (25), 14 states have call successors, (25) [2025-01-10 02:33:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 227 transitions. [2025-01-10 02:33:12,199 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 227 transitions. Word has length 40 [2025-01-10 02:33:12,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:12,199 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 227 transitions. [2025-01-10 02:33:12,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:33:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 227 transitions. [2025-01-10 02:33:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 02:33:12,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:12,202 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:33:12,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 02:33:12,203 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:12,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:12,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1422197, now seen corresponding path program 1 times [2025-01-10 02:33:12,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:12,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939410053] [2025-01-10 02:33:12,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:12,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:12,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 02:33:12,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 02:33:12,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:12,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 02:33:12,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:12,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939410053] [2025-01-10 02:33:12,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939410053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:33:12,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:33:12,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:33:12,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550971633] [2025-01-10 02:33:12,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:33:12,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:33:12,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:12,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:33:12,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:33:12,259 INFO L87 Difference]: Start difference. First operand 199 states and 227 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:33:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:12,276 INFO L93 Difference]: Finished difference Result 199 states and 227 transitions. [2025-01-10 02:33:12,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:33:12,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-01-10 02:33:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:12,278 INFO L225 Difference]: With dead ends: 199 [2025-01-10 02:33:12,278 INFO L226 Difference]: Without dead ends: 198 [2025-01-10 02:33:12,278 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:33:12,279 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:12,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:33:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-01-10 02:33:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-01-10 02:33:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 156 states have (on average 1.1538461538461537) internal successors, (180), 158 states have internal predecessors, (180), 15 states have call successors, (15), 14 states have call predecessors, (15), 23 states have return successors, (25), 25 states have call predecessors, (25), 14 states have call successors, (25) [2025-01-10 02:33:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 220 transitions. [2025-01-10 02:33:12,299 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 220 transitions. Word has length 44 [2025-01-10 02:33:12,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:12,300 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 220 transitions. [2025-01-10 02:33:12,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:33:12,301 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2025-01-10 02:33:12,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-10 02:33:12,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:12,303 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:33:12,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 02:33:12,304 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:12,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:12,304 INFO L85 PathProgramCache]: Analyzing trace with hash -44088030, now seen corresponding path program 1 times [2025-01-10 02:33:12,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:12,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627052948] [2025-01-10 02:33:12,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:12,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:12,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 02:33:12,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 02:33:12,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:12,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 02:33:12,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:12,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627052948] [2025-01-10 02:33:12,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627052948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:33:12,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:33:12,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:33:12,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631567992] [2025-01-10 02:33:12,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:33:12,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:33:12,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:12,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:33:12,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:33:12,397 INFO L87 Difference]: Start difference. First operand 198 states and 220 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:33:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:12,431 INFO L93 Difference]: Finished difference Result 247 states and 274 transitions. [2025-01-10 02:33:12,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:33:12,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-01-10 02:33:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:12,434 INFO L225 Difference]: With dead ends: 247 [2025-01-10 02:33:12,434 INFO L226 Difference]: Without dead ends: 246 [2025-01-10 02:33:12,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:33:12,435 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:12,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:33:12,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-01-10 02:33:12,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-01-10 02:33:12,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 195 states have (on average 1.123076923076923) internal successors, (219), 196 states have internal predecessors, (219), 15 states have call successors, (15), 14 states have call predecessors, (15), 32 states have return successors, (35), 35 states have call predecessors, (35), 14 states have call successors, (35) [2025-01-10 02:33:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 269 transitions. [2025-01-10 02:33:12,456 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 269 transitions. Word has length 45 [2025-01-10 02:33:12,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:12,457 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 269 transitions. [2025-01-10 02:33:12,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:33:12,457 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 269 transitions. [2025-01-10 02:33:12,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-10 02:33:12,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:12,461 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:33:12,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 02:33:12,461 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:12,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:12,462 INFO L85 PathProgramCache]: Analyzing trace with hash 91465175, now seen corresponding path program 1 times [2025-01-10 02:33:12,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:12,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158384243] [2025-01-10 02:33:12,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:12,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:12,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 02:33:12,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 02:33:12,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:12,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:33:12,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:12,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158384243] [2025-01-10 02:33:12,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158384243] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:33:12,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60374722] [2025-01-10 02:33:12,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:12,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:33:12,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:33:12,566 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:33:12,569 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:33:12,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 02:33:12,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 02:33:12,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:12,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:12,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 02:33:12,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:33:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:33:12,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:33:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:33:12,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60374722] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:33:12,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:33:12,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-01-10 02:33:12,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431654010] [2025-01-10 02:33:12,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:33:12,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 02:33:12,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:12,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 02:33:12,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:33:12,873 INFO L87 Difference]: Start difference. First operand 246 states and 269 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 02:33:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:12,947 INFO L93 Difference]: Finished difference Result 346 states and 387 transitions. [2025-01-10 02:33:12,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:33:12,949 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2025-01-10 02:33:12,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:12,951 INFO L225 Difference]: With dead ends: 346 [2025-01-10 02:33:12,951 INFO L226 Difference]: Without dead ends: 319 [2025-01-10 02:33:12,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:33:12,954 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:12,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:33:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-01-10 02:33:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 271. [2025-01-10 02:33:12,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 215 states have (on average 1.1069767441860465) internal successors, (238), 216 states have internal predecessors, (238), 15 states have call successors, (15), 14 states have call predecessors, (15), 37 states have return successors, (40), 40 states have call predecessors, (40), 14 states have call successors, (40) [2025-01-10 02:33:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 293 transitions. [2025-01-10 02:33:12,978 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 293 transitions. Word has length 45 [2025-01-10 02:33:12,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:12,979 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 293 transitions. [2025-01-10 02:33:12,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 02:33:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 293 transitions. [2025-01-10 02:33:12,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 02:33:12,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:12,983 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 02:33:12,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 02:33:13,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:33:13,187 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:13,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:13,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1373606826, now seen corresponding path program 1 times [2025-01-10 02:33:13,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:13,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146794091] [2025-01-10 02:33:13,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:13,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:13,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 02:33:13,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 02:33:13,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:13,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 02:33:13,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:13,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146794091] [2025-01-10 02:33:13,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146794091] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:33:13,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705271973] [2025-01-10 02:33:13,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:13,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:33:13,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:33:13,453 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:33:13,456 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:33:13,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 02:33:13,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 02:33:13,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:13,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:13,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 02:33:13,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:33:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 02:33:13,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:33:14,480 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:33:14,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705271973] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:33:14,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:33:14,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 17] total 19 [2025-01-10 02:33:14,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508987506] [2025-01-10 02:33:14,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:33:14,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 02:33:14,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:14,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 02:33:14,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-01-10 02:33:14,484 INFO L87 Difference]: Start difference. First operand 271 states and 293 transitions. Second operand has 19 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-10 02:33:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:14,670 INFO L93 Difference]: Finished difference Result 459 states and 496 transitions. [2025-01-10 02:33:14,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:33:14,670 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 60 [2025-01-10 02:33:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:14,672 INFO L225 Difference]: With dead ends: 459 [2025-01-10 02:33:14,672 INFO L226 Difference]: Without dead ends: 271 [2025-01-10 02:33:14,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 108 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2025-01-10 02:33:14,676 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 90 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:14,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 190 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:33:14,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-10 02:33:14,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-01-10 02:33:14,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 215 states have (on average 1.0883720930232559) internal successors, (234), 216 states have internal predecessors, (234), 15 states have call successors, (15), 14 states have call predecessors, (15), 37 states have return successors, (40), 40 states have call predecessors, (40), 14 states have call successors, (40) [2025-01-10 02:33:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 289 transitions. [2025-01-10 02:33:14,700 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 289 transitions. Word has length 60 [2025-01-10 02:33:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:14,700 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 289 transitions. [2025-01-10 02:33:14,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-10 02:33:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 289 transitions. [2025-01-10 02:33:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 02:33:14,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:14,702 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2025-01-10 02:33:14,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 02:33:14,902 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,SelfDestructingSolverStorable13 [2025-01-10 02:33:14,903 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:14,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:14,904 INFO L85 PathProgramCache]: Analyzing trace with hash -944165366, now seen corresponding path program 2 times [2025-01-10 02:33:14,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:14,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421985101] [2025-01-10 02:33:14,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:33:14,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:14,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-01-10 02:33:14,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 02:33:14,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:33:14,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:33:15,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:15,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421985101] [2025-01-10 02:33:15,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421985101] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:33:15,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565564204] [2025-01-10 02:33:15,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:33:15,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:33:15,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:33:15,418 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:33:15,421 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:33:15,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-01-10 02:33:15,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 02:33:15,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:33:15,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:15,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 02:33:15,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:33:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:33:15,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:33:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:33:16,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565564204] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:33:16,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:33:16,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2025-01-10 02:33:16,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285008482] [2025-01-10 02:33:16,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:33:16,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-01-10 02:33:16,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:16,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-01-10 02:33:16,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=2656, Unknown=0, NotChecked=0, Total=3080 [2025-01-10 02:33:16,311 INFO L87 Difference]: Start difference. First operand 271 states and 289 transitions. Second operand has 56 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 30 states have internal predecessors, (105), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:17,251 INFO L93 Difference]: Finished difference Result 591 states and 615 transitions. [2025-01-10 02:33:17,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-01-10 02:33:17,252 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 30 states have internal predecessors, (105), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-10 02:33:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:17,255 INFO L225 Difference]: With dead ends: 591 [2025-01-10 02:33:17,255 INFO L226 Difference]: Without dead ends: 589 [2025-01-10 02:33:17,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=970, Invalid=5510, Unknown=0, NotChecked=0, Total=6480 [2025-01-10 02:33:17,262 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 873 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:17,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 588 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:33:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-01-10 02:33:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 564. [2025-01-10 02:33:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 450 states have (on average 1.0844444444444445) internal successors, (488), 450 states have internal predecessors, (488), 28 states have call successors, (28), 27 states have call predecessors, (28), 82 states have return successors, (86), 86 states have call predecessors, (86), 27 states have call successors, (86) [2025-01-10 02:33:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 602 transitions. [2025-01-10 02:33:17,323 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 602 transitions. Word has length 66 [2025-01-10 02:33:17,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:17,324 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 602 transitions. [2025-01-10 02:33:17,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 30 states have internal predecessors, (105), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:17,324 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 602 transitions. [2025-01-10 02:33:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-10 02:33:17,324 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:17,325 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-01-10 02:33:17,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 02:33:17,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 02:33:17,529 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:17,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:17,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1023813575, now seen corresponding path program 1 times [2025-01-10 02:33:17,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:17,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391015689] [2025-01-10 02:33:17,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:17,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:17,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 02:33:17,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 02:33:17,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:17,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-10 02:33:17,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:17,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391015689] [2025-01-10 02:33:17,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391015689] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:33:17,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520042400] [2025-01-10 02:33:17,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:33:17,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:33:17,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:33:17,716 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:33:17,718 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:33:17,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 02:33:17,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 02:33:17,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:33:17,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:17,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 02:33:17,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:33:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:33:18,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:33:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 02:33:19,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520042400] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:33:19,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:33:19,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 19] total 38 [2025-01-10 02:33:19,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262306338] [2025-01-10 02:33:19,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:33:19,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-10 02:33:19,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:19,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-10 02:33:19,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1292, Unknown=0, NotChecked=0, Total=1406 [2025-01-10 02:33:19,241 INFO L87 Difference]: Start difference. First operand 564 states and 602 transitions. Second operand has 38 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 14 states have call successors, (16), 5 states have call predecessors, (16), 12 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2025-01-10 02:33:19,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:19,668 INFO L93 Difference]: Finished difference Result 590 states and 628 transitions. [2025-01-10 02:33:19,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 02:33:19,670 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 14 states have call successors, (16), 5 states have call predecessors, (16), 12 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) Word has length 70 [2025-01-10 02:33:19,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:19,672 INFO L225 Difference]: With dead ends: 590 [2025-01-10 02:33:19,672 INFO L226 Difference]: Without dead ends: 140 [2025-01-10 02:33:19,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 109 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=295, Invalid=2255, Unknown=0, NotChecked=0, Total=2550 [2025-01-10 02:33:19,675 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 97 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:19,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 212 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:33:19,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-10 02:33:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2025-01-10 02:33:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2025-01-10 02:33:19,683 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 70 [2025-01-10 02:33:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:19,684 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2025-01-10 02:33:19,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 14 states have call successors, (16), 5 states have call predecessors, (16), 12 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2025-01-10 02:33:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2025-01-10 02:33:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-10 02:33:19,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:19,687 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1] [2025-01-10 02:33:19,696 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:33:19,891 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,SelfDestructingSolverStorable15 [2025-01-10 02:33:19,891 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:19,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:19,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1735112018, now seen corresponding path program 2 times [2025-01-10 02:33:19,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:19,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832101861] [2025-01-10 02:33:19,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:33:19,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:19,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 131 statements into 2 equivalence classes. [2025-01-10 02:33:19,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 131 of 131 statements. [2025-01-10 02:33:19,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:33:19,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:33:21,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:21,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832101861] [2025-01-10 02:33:21,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832101861] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:33:21,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670258714] [2025-01-10 02:33:21,274 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:33:21,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:33:21,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:33:21,280 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:33:21,281 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:33:21,323 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 131 statements into 2 equivalence classes. [2025-01-10 02:33:21,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 131 of 131 statements. [2025-01-10 02:33:21,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:33:21,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:21,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-10 02:33:21,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:33:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:33:21,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:33:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:33:23,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670258714] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:33:23,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:33:23,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2025-01-10 02:33:23,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659590115] [2025-01-10 02:33:23,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:33:23,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2025-01-10 02:33:23,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:23,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2025-01-10 02:33:23,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1514, Invalid=10042, Unknown=0, NotChecked=0, Total=11556 [2025-01-10 02:33:23,330 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand has 108 states, 105 states have (on average 1.9904761904761905) internal successors, (209), 56 states have internal predecessors, (209), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:25,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:25,092 INFO L93 Difference]: Finished difference Result 277 states and 302 transitions. [2025-01-10 02:33:25,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-01-10 02:33:25,092 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 105 states have (on average 1.9904761904761905) internal successors, (209), 56 states have internal predecessors, (209), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-01-10 02:33:25,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:25,094 INFO L225 Difference]: With dead ends: 277 [2025-01-10 02:33:25,094 INFO L226 Difference]: Without dead ends: 275 [2025-01-10 02:33:25,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7600 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3672, Invalid=21768, Unknown=0, NotChecked=0, Total=25440 [2025-01-10 02:33:25,101 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 681 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:25,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 87 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:33:25,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-01-10 02:33:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2025-01-10 02:33:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 217 states have (on average 1.0092165898617511) internal successors, (219), 218 states have internal predecessors, (219), 54 states have call successors, (54), 54 states have call predecessors, (54), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2025-01-10 02:33:25,115 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 131 [2025-01-10 02:33:25,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:25,115 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2025-01-10 02:33:25,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 105 states have (on average 1.9904761904761905) internal successors, (209), 56 states have internal predecessors, (209), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:25,116 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2025-01-10 02:33:25,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-01-10 02:33:25,118 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:25,118 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1] [2025-01-10 02:33:25,126 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:33:25,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:33:25,319 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:25,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:25,319 INFO L85 PathProgramCache]: Analyzing trace with hash -941956646, now seen corresponding path program 3 times [2025-01-10 02:33:25,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:25,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911094777] [2025-01-10 02:33:25,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:33:25,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:25,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 266 statements into 27 equivalence classes. [2025-01-10 02:33:25,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) and asserted 266 of 266 statements. [2025-01-10 02:33:25,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2025-01-10 02:33:25,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3328 backedges. 0 proven. 3328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:33:29,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:29,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911094777] [2025-01-10 02:33:29,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911094777] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:33:29,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699649585] [2025-01-10 02:33:29,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:33:29,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:33:29,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:33:29,867 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:33:29,869 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:33:29,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 266 statements into 27 equivalence classes. [2025-01-10 02:33:30,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) and asserted 266 of 266 statements. [2025-01-10 02:33:30,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2025-01-10 02:33:30,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:30,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-01-10 02:33:30,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:33:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3328 backedges. 0 proven. 3328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:33:30,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:33:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3328 backedges. 0 proven. 3328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:33:36,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699649585] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:33:36,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:33:36,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2025-01-10 02:33:36,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845675023] [2025-01-10 02:33:36,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:33:36,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 216 states [2025-01-10 02:33:36,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:36,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2025-01-10 02:33:36,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5944, Invalid=40496, Unknown=0, NotChecked=0, Total=46440 [2025-01-10 02:33:36,522 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand has 216 states, 213 states have (on average 1.9953051643192488) internal successors, (425), 110 states have internal predecessors, (425), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:42,577 INFO L93 Difference]: Finished difference Result 542 states and 593 transitions. [2025-01-10 02:33:42,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2025-01-10 02:33:42,578 INFO L78 Accepts]: Start accepts. Automaton has has 216 states, 213 states have (on average 1.9953051643192488) internal successors, (425), 110 states have internal predecessors, (425), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 266 [2025-01-10 02:33:42,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:42,581 INFO L225 Difference]: With dead ends: 542 [2025-01-10 02:33:42,581 INFO L226 Difference]: Without dead ends: 540 [2025-01-10 02:33:42,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32497 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=14530, Invalid=88190, Unknown=0, NotChecked=0, Total=102720 [2025-01-10 02:33:42,589 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1585 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:42,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 105 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 02:33:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-01-10 02:33:42,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 538. [2025-01-10 02:33:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 429 states have (on average 1.0046620046620047) internal successors, (431), 430 states have internal predecessors, (431), 107 states have call successors, (107), 107 states have call predecessors, (107), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 538 transitions. [2025-01-10 02:33:42,613 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 538 transitions. Word has length 266 [2025-01-10 02:33:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:42,614 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 538 transitions. [2025-01-10 02:33:42,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 216 states, 213 states have (on average 1.9953051643192488) internal successors, (425), 110 states have internal predecessors, (425), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 538 transitions. [2025-01-10 02:33:42,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-01-10 02:33:42,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:33:42,621 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 52, 52, 52, 1, 1, 1, 1] [2025-01-10 02:33:42,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 02:33:42,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 02:33:42,822 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 02:33:42,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:33:42,823 INFO L85 PathProgramCache]: Analyzing trace with hash -640380494, now seen corresponding path program 3 times [2025-01-10 02:33:42,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:33:42,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926169473] [2025-01-10 02:33:42,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:33:42,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:33:42,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 531 statements into 53 equivalence classes. [2025-01-10 02:33:42,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) and asserted 281 of 531 statements. [2025-01-10 02:33:42,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2025-01-10 02:33:42,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:43,202 INFO L134 CoverageAnalysis]: Checked inductivity of 13676 backedges. 1352 proven. 24 refuted. 0 times theorem prover too weak. 12300 trivial. 0 not checked. [2025-01-10 02:33:43,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:33:43,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926169473] [2025-01-10 02:33:43,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926169473] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:33:43,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410605809] [2025-01-10 02:33:43,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:33:43,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:33:43,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:33:43,205 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:33:43,207 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:33:43,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 531 statements into 53 equivalence classes. [2025-01-10 02:33:43,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) and asserted 281 of 531 statements. [2025-01-10 02:33:43,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2025-01-10 02:33:43,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:33:43,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 02:33:43,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:33:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 13676 backedges. 1352 proven. 24 refuted. 0 times theorem prover too weak. 12300 trivial. 0 not checked. [2025-01-10 02:33:43,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:33:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 13676 backedges. 1352 proven. 24 refuted. 0 times theorem prover too weak. 12300 trivial. 0 not checked. [2025-01-10 02:33:43,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410605809] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:33:43,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:33:43,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2025-01-10 02:33:43,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767328206] [2025-01-10 02:33:43,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:33:43,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 02:33:43,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:33:43,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 02:33:43,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-01-10 02:33:43,549 INFO L87 Difference]: Start difference. First operand 538 states and 538 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 7 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:33:43,703 INFO L93 Difference]: Finished difference Result 538 states and 538 transitions. [2025-01-10 02:33:43,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 02:33:43,704 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 7 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 531 [2025-01-10 02:33:43,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:33:43,704 INFO L225 Difference]: With dead ends: 538 [2025-01-10 02:33:43,705 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:33:43,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1081 GetRequests, 1062 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2025-01-10 02:33:43,706 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:33:43,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 93 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:33:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:33:43,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:33:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:33:43,707 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 531 [2025-01-10 02:33:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:33:43,707 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:33:43,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 7 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:33:43,707 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:33:43,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:33:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-01-10 02:33:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-01-10 02:33:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 02:33:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 02:33:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 02:33:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 02:33:43,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 02:33:43,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 02:33:43,719 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:33:43,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:33:43,917 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:33:43,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:33:44,815 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:33:44,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:33:44 BoogieIcfgContainer [2025-01-10 02:33:44,820 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:33:44,821 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:33:44,821 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:33:44,821 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:33:44,822 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:33:08" (3/4) ... [2025-01-10 02:33:44,824 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 02:33:44,830 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2025-01-10 02:33:44,830 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2025-01-10 02:33:44,833 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-10 02:33:44,833 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 02:33:44,834 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 02:33:44,834 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 02:33:44,897 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:33:44,897 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:33:44,897 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:33:44,898 INFO L158 Benchmark]: Toolchain (without parser) took 36875.79ms. Allocated memory was 167.8MB in the beginning and 528.5MB in the end (delta: 360.7MB). Free memory was 123.3MB in the beginning and 322.3MB in the end (delta: -199.0MB). Peak memory consumption was 156.4MB. Max. memory is 16.1GB. [2025-01-10 02:33:44,898 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:33:44,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.20ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 112.9MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:33:44,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.63ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 112.0MB in the end (delta: 896.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:33:44,899 INFO L158 Benchmark]: Boogie Preprocessor took 34.36ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 110.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:33:44,900 INFO L158 Benchmark]: RCFGBuilder took 248.57ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 99.4MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 02:33:44,900 INFO L158 Benchmark]: TraceAbstraction took 36274.24ms. Allocated memory was 167.8MB in the beginning and 528.5MB in the end (delta: 360.7MB). Free memory was 98.9MB in the beginning and 330.5MB in the end (delta: -231.5MB). Peak memory consumption was 272.1MB. Max. memory is 16.1GB. [2025-01-10 02:33:44,901 INFO L158 Benchmark]: Witness Printer took 76.43ms. Allocated memory is still 528.5MB. Free memory was 330.5MB in the beginning and 322.3MB in the end (delta: 8.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:33:44,902 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.25ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.20ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 112.9MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.63ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 112.0MB in the end (delta: 896.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.36ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 110.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 248.57ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 99.4MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 36274.24ms. Allocated memory was 167.8MB in the beginning and 528.5MB in the end (delta: 360.7MB). Free memory was 98.9MB in the beginning and 330.5MB in the end (delta: -231.5MB). Peak memory consumption was 272.1MB. Max. memory is 16.1GB. * Witness Printer took 76.43ms. Allocated memory is still 528.5MB. Free memory was 330.5MB in the beginning and 322.3MB in the end (delta: 8.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 35.3s, OverallIterations: 19, TraceHistogramMax: 53, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3876 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3872 mSDsluCounter, 3052 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2611 mSDsCounter, 273 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3690 IncrementalHoareTripleChecker+Invalid, 3963 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 273 mSolverCounterUnsat, 441 mSDtfsCounter, 3690 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2949 GetRequests, 2178 SyntacticMatches, 16 SemanticMatches, 755 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42848 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=564occurred in iteration=15, InterpolantAutomatonStates: 525, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 150 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 20.9s InterpolantComputationTime, 2679 NumberOfCodeBlocks, 2179 NumberOfCodeBlocksAsserted, 138 NumberOfCheckSat, 3858 ConstructedInterpolants, 0 QuantifiedInterpolants, 10444 SizeOfPredicates, 120 NumberOfNonLiveVariables, 1926 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 37 InterpolantComputations, 10 PerfectInterpolantSequences, 41385/54493 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 02:33:44,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE