./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-lit/gcnr2008.i --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/loop-lit/gcnr2008.i -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 fdb248ef49e1ab3b05d5b0ae73a340b38ef25b27662d8a5cd45744a1950a5101 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:44:05,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:44:05,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:44:05,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:44:05,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:44:05,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:44:05,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:44:05,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:44:05,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:44:05,911 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:44:05,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:44:05,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:44:05,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:44:05,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:44:05,911 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:44:05,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:44:05,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:44:05,912 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:44:05,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:44:05,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:44:05,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:44:05,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:44:05,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:44:05,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:44:05,913 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:44:05,913 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:44:05,913 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:44:05,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:44:05,913 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:44:05,913 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:44:05,913 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:44:05,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:44:05,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:44:05,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:44:05,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:44:05,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:44:05,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:44:05,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:44:05,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:44:05,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:44:05,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:44:05,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:44:05,918 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:44:05,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:44:05,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:44:05,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:44:05,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:44:05,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:44:05,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:44:05,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:44:05,918 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 -> fdb248ef49e1ab3b05d5b0ae73a340b38ef25b27662d8a5cd45744a1950a5101 [2025-01-10 01:44:06,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:44:06,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:44:06,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:44:06,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:44:06,188 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:44:06,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/gcnr2008.i [2025-01-10 01:44:07,448 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ef4cf013/78b6441d1b7543de8bc267c25d7d1678/FLAG4d328abe8 [2025-01-10 01:44:07,668 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:44:07,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/gcnr2008.i [2025-01-10 01:44:07,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ef4cf013/78b6441d1b7543de8bc267c25d7d1678/FLAG4d328abe8 [2025-01-10 01:44:07,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ef4cf013/78b6441d1b7543de8bc267c25d7d1678 [2025-01-10 01:44:07,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:44:07,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:44:07,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:44:07,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:44:07,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:44:07,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:44:07" (1/1) ... [2025-01-10 01:44:07,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50edfa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:07, skipping insertion in model container [2025-01-10 01:44:07,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:44:07" (1/1) ... [2025-01-10 01:44:07,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:44:07,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:44:07,892 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:44:07,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:44:07,922 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:44:07,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:07 WrapperNode [2025-01-10 01:44:07,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:44:07,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:44:07,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:44:07,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:44:07,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:07" (1/1) ... [2025-01-10 01:44:07,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:07" (1/1) ... [2025-01-10 01:44:07,952 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2025-01-10 01:44:07,954 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:44:07,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:44:07,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:44:07,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:44:07,962 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:07" (1/1) ... [2025-01-10 01:44:07,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:07" (1/1) ... [2025-01-10 01:44:07,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:07" (1/1) ... [2025-01-10 01:44:07,976 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 01:44:07,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:07" (1/1) ... [2025-01-10 01:44:07,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:07" (1/1) ... [2025-01-10 01:44:07,982 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:07" (1/1) ... [2025-01-10 01:44:07,983 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:07" (1/1) ... [2025-01-10 01:44:07,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:07" (1/1) ... [2025-01-10 01:44:07,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:07" (1/1) ... [2025-01-10 01:44:07,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:07" (1/1) ... [2025-01-10 01:44:07,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:44:07,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:44:07,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:44:07,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:44:07,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:07" (1/1) ... [2025-01-10 01:44:07,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:44:08,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:08,019 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 01:44:08,026 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 01:44:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:44:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:44:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:44:08,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:44:08,086 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:44:08,087 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:44:08,241 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-01-10 01:44:08,241 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:44:08,250 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:44:08,251 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 01:44:08,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:44:08 BoogieIcfgContainer [2025-01-10 01:44:08,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:44:08,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:44:08,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:44:08,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:44:08,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:44:07" (1/3) ... [2025-01-10 01:44:08,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a4ab01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:44:08, skipping insertion in model container [2025-01-10 01:44:08,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:44:07" (2/3) ... [2025-01-10 01:44:08,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a4ab01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:44:08, skipping insertion in model container [2025-01-10 01:44:08,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:44:08" (3/3) ... [2025-01-10 01:44:08,262 INFO L128 eAbstractionObserver]: Analyzing ICFG gcnr2008.i [2025-01-10 01:44:08,278 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:44:08,279 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcnr2008.i that has 1 procedures, 55 locations, 1 initial locations, 1 loop locations, and 18 error locations. [2025-01-10 01:44:08,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:44:08,334 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;@66e9f9de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:44:08,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-10 01:44:08,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 36 states have (on average 1.75) internal successors, (63), 54 states have internal predecessors, (63), 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 01:44:08,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:44:08,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:08,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:08,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:08,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:08,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1805890888, now seen corresponding path program 1 times [2025-01-10 01:44:08,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:08,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326156161] [2025-01-10 01:44:08,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:08,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:44:08,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:44:08,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:08,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:08,613 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 01:44:08,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:08,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326156161] [2025-01-10 01:44:08,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326156161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:08,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:08,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:44:08,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022969550] [2025-01-10 01:44:08,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:08,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:44:08,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:08,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:44:08,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:44:08,646 INFO L87 Difference]: Start difference. First operand has 55 states, 36 states have (on average 1.75) internal successors, (63), 54 states have internal predecessors, (63), 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) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:44:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:08,773 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2025-01-10 01:44:08,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:44:08,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:44:08,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:08,783 INFO L225 Difference]: With dead ends: 131 [2025-01-10 01:44:08,783 INFO L226 Difference]: Without dead ends: 69 [2025-01-10 01:44:08,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:44:08,790 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 94 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:08,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 66 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:44:08,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-10 01:44:08,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2025-01-10 01:44:08,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.625) internal successors, (78), 62 states have internal predecessors, (78), 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 01:44:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2025-01-10 01:44:08,815 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 7 [2025-01-10 01:44:08,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:08,815 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2025-01-10 01:44:08,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:44:08,816 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2025-01-10 01:44:08,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:44:08,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:08,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:08,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:44:08,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:08,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:08,818 INFO L85 PathProgramCache]: Analyzing trace with hash 148053204, now seen corresponding path program 1 times [2025-01-10 01:44:08,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:08,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579369944] [2025-01-10 01:44:08,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:08,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:08,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:44:08,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:44:08,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:08,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:08,901 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 01:44:08,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:08,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579369944] [2025-01-10 01:44:08,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579369944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:08,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:08,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:44:08,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729623125] [2025-01-10 01:44:08,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:08,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:44:08,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:08,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:44:08,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:44:08,903 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:44:08,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:08,969 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2025-01-10 01:44:08,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:44:08,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:44:08,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:08,971 INFO L225 Difference]: With dead ends: 87 [2025-01-10 01:44:08,971 INFO L226 Difference]: Without dead ends: 81 [2025-01-10 01:44:08,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:44:08,972 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 59 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:08,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 62 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:44:08,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-10 01:44:08,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-10 01:44:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 80 states have internal predecessors, (98), 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 01:44:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2025-01-10 01:44:08,980 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 8 [2025-01-10 01:44:08,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:08,981 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2025-01-10 01:44:08,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:44:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2025-01-10 01:44:08,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:44:08,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:08,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:08,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:44:08,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:08,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:08,984 INFO L85 PathProgramCache]: Analyzing trace with hash -293237560, now seen corresponding path program 1 times [2025-01-10 01:44:08,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:08,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784825814] [2025-01-10 01:44:08,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:08,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:08,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:44:08,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:44:08,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:08,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:09,095 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 01:44:09,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:09,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784825814] [2025-01-10 01:44:09,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784825814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:09,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:09,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:44:09,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008052850] [2025-01-10 01:44:09,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:09,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:44:09,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:09,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:44:09,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:44:09,097 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 01:44:09,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:09,143 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2025-01-10 01:44:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:44:09,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 01:44:09,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:09,145 INFO L225 Difference]: With dead ends: 83 [2025-01-10 01:44:09,145 INFO L226 Difference]: Without dead ends: 82 [2025-01-10 01:44:09,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:44:09,146 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 64 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:09,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 105 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:09,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-10 01:44:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2025-01-10 01:44:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 68 states have (on average 1.411764705882353) internal successors, (96), 79 states have internal predecessors, (96), 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 01:44:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2025-01-10 01:44:09,157 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 11 [2025-01-10 01:44:09,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:09,157 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2025-01-10 01:44:09,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 01:44:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2025-01-10 01:44:09,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:44:09,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:09,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:09,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:44:09,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:09,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:09,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1122276978, now seen corresponding path program 1 times [2025-01-10 01:44:09,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:09,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973448759] [2025-01-10 01:44:09,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:09,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:09,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:44:09,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:44:09,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:09,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:09,221 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 01:44:09,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:09,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973448759] [2025-01-10 01:44:09,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973448759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:09,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:09,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:44:09,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171722752] [2025-01-10 01:44:09,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:09,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:44:09,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:09,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:44:09,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:44:09,224 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 01:44:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:09,273 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2025-01-10 01:44:09,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:44:09,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-10 01:44:09,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:09,277 INFO L225 Difference]: With dead ends: 85 [2025-01-10 01:44:09,277 INFO L226 Difference]: Without dead ends: 84 [2025-01-10 01:44:09,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:44:09,278 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 45 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:09,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 90 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-10 01:44:09,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2025-01-10 01:44:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.40625) internal successors, (90), 75 states have internal predecessors, (90), 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 01:44:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2025-01-10 01:44:09,285 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 12 [2025-01-10 01:44:09,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:09,285 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-01-10 01:44:09,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 01:44:09,285 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2025-01-10 01:44:09,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:44:09,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:09,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:09,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:44:09,286 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:09,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:09,286 INFO L85 PathProgramCache]: Analyzing trace with hash -500429661, now seen corresponding path program 1 times [2025-01-10 01:44:09,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:09,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372839647] [2025-01-10 01:44:09,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:09,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:09,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:44:09,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:44:09,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:09,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:09,407 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 01:44:09,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:09,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372839647] [2025-01-10 01:44:09,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372839647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:09,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:09,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:44:09,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384510592] [2025-01-10 01:44:09,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:09,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:44:09,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:09,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:44:09,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:44:09,412 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 01:44:09,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:09,523 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2025-01-10 01:44:09,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:44:09,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-10 01:44:09,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:09,527 INFO L225 Difference]: With dead ends: 91 [2025-01-10 01:44:09,528 INFO L226 Difference]: Without dead ends: 90 [2025-01-10 01:44:09,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:44:09,529 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:09,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 140 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:44:09,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-10 01:44:09,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-10 01:44:09,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.358974358974359) internal successors, (106), 89 states have internal predecessors, (106), 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 01:44:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2025-01-10 01:44:09,541 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 12 [2025-01-10 01:44:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:09,541 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2025-01-10 01:44:09,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 01:44:09,542 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2025-01-10 01:44:09,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 01:44:09,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:09,542 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:09,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:44:09,542 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:09,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:09,543 INFO L85 PathProgramCache]: Analyzing trace with hash -64032375, now seen corresponding path program 1 times [2025-01-10 01:44:09,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:09,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140009044] [2025-01-10 01:44:09,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:09,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:09,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:44:09,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:44:09,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:09,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:44:09,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:09,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140009044] [2025-01-10 01:44:09,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140009044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:09,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:09,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:44:09,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279705599] [2025-01-10 01:44:09,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:09,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:44:09,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:09,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:44:09,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:44:09,623 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 01:44:09,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:09,658 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2025-01-10 01:44:09,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:44:09,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-10 01:44:09,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:09,660 INFO L225 Difference]: With dead ends: 97 [2025-01-10 01:44:09,660 INFO L226 Difference]: Without dead ends: 95 [2025-01-10 01:44:09,661 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 01:44:09,662 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:09,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 69 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-10 01:44:09,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2025-01-10 01:44:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.35) internal successors, (108), 91 states have internal predecessors, (108), 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 01:44:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 108 transitions. [2025-01-10 01:44:09,675 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 108 transitions. Word has length 19 [2025-01-10 01:44:09,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:09,676 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 108 transitions. [2025-01-10 01:44:09,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 01:44:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2025-01-10 01:44:09,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 01:44:09,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:09,676 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:09,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:44:09,677 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:09,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:09,677 INFO L85 PathProgramCache]: Analyzing trace with hash -63707654, now seen corresponding path program 1 times [2025-01-10 01:44:09,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:09,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024310551] [2025-01-10 01:44:09,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:09,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:09,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:44:09,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:44:09,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:09,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:09,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:09,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024310551] [2025-01-10 01:44:09,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024310551] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:09,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26524191] [2025-01-10 01:44:09,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:09,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:09,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:09,817 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 01:44:09,819 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 01:44:09,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:44:09,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:44:09,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:09,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:09,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:44:09,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:09,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:09,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26524191] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:44:09,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:44:09,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2025-01-10 01:44:09,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79038807] [2025-01-10 01:44:09,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:44:09,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:44:09,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:09,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:44:09,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:44:09,985 INFO L87 Difference]: Start difference. First operand 92 states and 108 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 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 01:44:10,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:10,076 INFO L93 Difference]: Finished difference Result 256 states and 307 transitions. [2025-01-10 01:44:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:44:10,076 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-10 01:44:10,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:10,078 INFO L225 Difference]: With dead ends: 256 [2025-01-10 01:44:10,078 INFO L226 Difference]: Without dead ends: 254 [2025-01-10 01:44:10,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:44:10,080 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 204 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:10,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 191 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:44:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-01-10 01:44:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 216. [2025-01-10 01:44:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 204 states have (on average 1.3872549019607843) internal successors, (283), 215 states have internal predecessors, (283), 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 01:44:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 283 transitions. [2025-01-10 01:44:10,093 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 283 transitions. Word has length 19 [2025-01-10 01:44:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:10,093 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 283 transitions. [2025-01-10 01:44:10,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 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 01:44:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 283 transitions. [2025-01-10 01:44:10,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 01:44:10,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:10,094 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:10,103 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 01:44:10,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:10,295 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:10,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:10,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1193905960, now seen corresponding path program 1 times [2025-01-10 01:44:10,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:10,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293794118] [2025-01-10 01:44:10,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:10,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:10,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:44:10,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:44:10,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:10,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:10,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:10,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293794118] [2025-01-10 01:44:10,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293794118] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:10,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123955963] [2025-01-10 01:44:10,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:10,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:10,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:10,377 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 01:44:10,379 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 01:44:10,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:44:10,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:44:10,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:10,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:10,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:44:10,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:10,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:10,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123955963] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:44:10,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:44:10,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 01:44:10,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690394765] [2025-01-10 01:44:10,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:44:10,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:44:10,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:10,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:44:10,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:44:10,567 INFO L87 Difference]: Start difference. First operand 216 states and 283 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 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 01:44:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:10,791 INFO L93 Difference]: Finished difference Result 593 states and 779 transitions. [2025-01-10 01:44:10,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:44:10,792 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-10 01:44:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:10,794 INFO L225 Difference]: With dead ends: 593 [2025-01-10 01:44:10,794 INFO L226 Difference]: Without dead ends: 503 [2025-01-10 01:44:10,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:44:10,796 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 501 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:10,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 226 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:44:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-01-10 01:44:10,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 398. [2025-01-10 01:44:10,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 386 states have (on average 1.3963730569948187) internal successors, (539), 397 states have internal predecessors, (539), 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 01:44:10,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 539 transitions. [2025-01-10 01:44:10,821 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 539 transitions. Word has length 20 [2025-01-10 01:44:10,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:10,822 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 539 transitions. [2025-01-10 01:44:10,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 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 01:44:10,822 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 539 transitions. [2025-01-10 01:44:10,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:44:10,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:10,823 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:10,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:44:11,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:11,024 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:11,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:11,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1643620956, now seen corresponding path program 1 times [2025-01-10 01:44:11,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:11,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157136369] [2025-01-10 01:44:11,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:11,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:11,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:44:11,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:44:11,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:11,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:11,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:11,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157136369] [2025-01-10 01:44:11,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157136369] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:11,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405972836] [2025-01-10 01:44:11,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:11,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:11,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:11,071 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 01:44:11,074 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 01:44:11,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:44:11,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:44:11,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:11,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:11,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:44:11,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:11,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:44:11,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405972836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:11,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:44:11,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-10 01:44:11,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363869007] [2025-01-10 01:44:11,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:11,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:44:11,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:11,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:44:11,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:44:11,161 INFO L87 Difference]: Start difference. First operand 398 states and 539 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 01:44:11,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:11,214 INFO L93 Difference]: Finished difference Result 826 states and 1131 transitions. [2025-01-10 01:44:11,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:44:11,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-10 01:44:11,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:11,218 INFO L225 Difference]: With dead ends: 826 [2025-01-10 01:44:11,219 INFO L226 Difference]: Without dead ends: 824 [2025-01-10 01:44:11,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:44:11,220 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 79 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:11,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 92 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-01-10 01:44:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 668. [2025-01-10 01:44:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 656 states have (on average 1.3841463414634145) internal successors, (908), 667 states have internal predecessors, (908), 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 01:44:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 908 transitions. [2025-01-10 01:44:11,241 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 908 transitions. Word has length 21 [2025-01-10 01:44:11,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:11,242 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 908 transitions. [2025-01-10 01:44:11,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 01:44:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 908 transitions. [2025-01-10 01:44:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 01:44:11,244 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:11,244 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:11,253 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 01:44:11,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:11,446 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:11,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:11,446 INFO L85 PathProgramCache]: Analyzing trace with hash -587357862, now seen corresponding path program 1 times [2025-01-10 01:44:11,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:11,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494765490] [2025-01-10 01:44:11,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:11,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:11,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:44:11,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:44:11,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:11,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:44:11,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:11,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494765490] [2025-01-10 01:44:11,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494765490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:11,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:11,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:44:11,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564322941] [2025-01-10 01:44:11,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:11,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:44:11,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:11,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:44:11,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:44:11,471 INFO L87 Difference]: Start difference. First operand 668 states and 908 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 01:44:11,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:11,506 INFO L93 Difference]: Finished difference Result 808 states and 1071 transitions. [2025-01-10 01:44:11,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:44:11,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-10 01:44:11,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:11,510 INFO L225 Difference]: With dead ends: 808 [2025-01-10 01:44:11,510 INFO L226 Difference]: Without dead ends: 805 [2025-01-10 01:44:11,511 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 01:44:11,511 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 28 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:11,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 39 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:11,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-01-10 01:44:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 665. [2025-01-10 01:44:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 656 states have (on average 1.3353658536585367) internal successors, (876), 664 states have internal predecessors, (876), 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 01:44:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 876 transitions. [2025-01-10 01:44:11,543 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 876 transitions. Word has length 22 [2025-01-10 01:44:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:11,543 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 876 transitions. [2025-01-10 01:44:11,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 01:44:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 876 transitions. [2025-01-10 01:44:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 01:44:11,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:11,545 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:44:11,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:44:11,545 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:11,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:11,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1101756, now seen corresponding path program 1 times [2025-01-10 01:44:11,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:11,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078824283] [2025-01-10 01:44:11,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:11,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:11,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:44:11,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:44:11,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:11,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:11,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:11,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078824283] [2025-01-10 01:44:11,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078824283] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:11,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451570683] [2025-01-10 01:44:11,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:11,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:11,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:11,654 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 01:44:11,656 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 01:44:11,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:44:11,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:44:11,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:11,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:11,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:44:11,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:11,747 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:11,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:11,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451570683] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:44:11,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:44:11,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-01-10 01:44:11,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775833566] [2025-01-10 01:44:11,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:44:11,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:44:11,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:11,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:44:11,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=73, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:44:11,812 INFO L87 Difference]: Start difference. First operand 665 states and 876 transitions. Second operand has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 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 01:44:11,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:11,962 INFO L93 Difference]: Finished difference Result 1200 states and 1570 transitions. [2025-01-10 01:44:11,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:44:11,962 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-10 01:44:11,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:11,966 INFO L225 Difference]: With dead ends: 1200 [2025-01-10 01:44:11,966 INFO L226 Difference]: Without dead ends: 1199 [2025-01-10 01:44:11,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=86, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:44:11,967 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 171 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:11,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 269 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:44:11,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2025-01-10 01:44:12,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1185. [2025-01-10 01:44:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1176 states have (on average 1.2993197278911566) internal successors, (1528), 1184 states have internal predecessors, (1528), 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 01:44:12,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1528 transitions. [2025-01-10 01:44:12,007 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1528 transitions. Word has length 22 [2025-01-10 01:44:12,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:12,007 INFO L471 AbstractCegarLoop]: Abstraction has 1185 states and 1528 transitions. [2025-01-10 01:44:12,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 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 01:44:12,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1528 transitions. [2025-01-10 01:44:12,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 01:44:12,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:12,008 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:12,016 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 01:44:12,209 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,SelfDestructingSolverStorable10 [2025-01-10 01:44:12,210 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:12,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:12,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1041246701, now seen corresponding path program 1 times [2025-01-10 01:44:12,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:12,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792928693] [2025-01-10 01:44:12,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:12,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:12,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:44:12,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:44:12,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:12,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:44:12,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:12,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792928693] [2025-01-10 01:44:12,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792928693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:12,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:12,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:44:12,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675810430] [2025-01-10 01:44:12,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:12,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:44:12,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:12,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:44:12,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:44:12,252 INFO L87 Difference]: Start difference. First operand 1185 states and 1528 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 01:44:12,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:12,300 INFO L93 Difference]: Finished difference Result 2254 states and 2939 transitions. [2025-01-10 01:44:12,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:44:12,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-10 01:44:12,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:12,306 INFO L225 Difference]: With dead ends: 2254 [2025-01-10 01:44:12,306 INFO L226 Difference]: Without dead ends: 1187 [2025-01-10 01:44:12,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 01:44:12,309 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:12,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:12,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-01-10 01:44:12,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1187. [2025-01-10 01:44:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1178 states have (on average 1.2801358234295417) internal successors, (1508), 1186 states have internal predecessors, (1508), 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 01:44:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1508 transitions. [2025-01-10 01:44:12,349 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1508 transitions. Word has length 25 [2025-01-10 01:44:12,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:12,349 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1508 transitions. [2025-01-10 01:44:12,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 01:44:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1508 transitions. [2025-01-10 01:44:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 01:44:12,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:12,350 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:12,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:44:12,350 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:12,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:12,351 INFO L85 PathProgramCache]: Analyzing trace with hash -90101929, now seen corresponding path program 1 times [2025-01-10 01:44:12,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:12,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283808396] [2025-01-10 01:44:12,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:12,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:12,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:44:12,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:44:12,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:12,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:12,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:12,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283808396] [2025-01-10 01:44:12,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283808396] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:12,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071738263] [2025-01-10 01:44:12,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:12,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:12,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:12,399 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 01:44:12,401 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 01:44:12,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:44:12,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:44:12,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:12,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:12,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:44:12,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:12,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:12,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:12,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071738263] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:12,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:44:12,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 9 [2025-01-10 01:44:12,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874815667] [2025-01-10 01:44:12,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:12,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:44:12,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:12,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:44:12,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:44:12,606 INFO L87 Difference]: Start difference. First operand 1187 states and 1508 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 01:44:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:12,669 INFO L93 Difference]: Finished difference Result 1864 states and 2353 transitions. [2025-01-10 01:44:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:44:12,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-10 01:44:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:12,677 INFO L225 Difference]: With dead ends: 1864 [2025-01-10 01:44:12,677 INFO L226 Difference]: Without dead ends: 1863 [2025-01-10 01:44:12,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:44:12,678 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 56 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:12,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 63 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:12,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2025-01-10 01:44:12,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1791. [2025-01-10 01:44:12,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1782 states have (on average 1.2654320987654322) internal successors, (2255), 1790 states have internal predecessors, (2255), 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 01:44:12,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2255 transitions. [2025-01-10 01:44:12,744 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2255 transitions. Word has length 27 [2025-01-10 01:44:12,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:12,744 INFO L471 AbstractCegarLoop]: Abstraction has 1791 states and 2255 transitions. [2025-01-10 01:44:12,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 01:44:12,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2255 transitions. [2025-01-10 01:44:12,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-10 01:44:12,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:12,746 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:12,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:44:12,946 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,SelfDestructingSolverStorable12 [2025-01-10 01:44:12,947 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:12,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:12,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1822878225, now seen corresponding path program 1 times [2025-01-10 01:44:12,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:12,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393025533] [2025-01-10 01:44:12,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:12,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:12,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 01:44:12,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:44:12,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:12,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:44:12,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:12,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393025533] [2025-01-10 01:44:12,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393025533] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:12,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071185696] [2025-01-10 01:44:12,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:12,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:12,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:12,991 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 01:44:12,993 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 01:44:13,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 01:44:13,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:44:13,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:13,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:13,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:44:13,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:13,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:13,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071185696] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:13,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:44:13,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [3, 6] total 11 [2025-01-10 01:44:13,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045671631] [2025-01-10 01:44:13,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:13,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:44:13,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:13,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:44:13,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:44:13,267 INFO L87 Difference]: Start difference. First operand 1791 states and 2255 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 01:44:13,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:13,385 INFO L93 Difference]: Finished difference Result 2781 states and 3534 transitions. [2025-01-10 01:44:13,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:44:13,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-01-10 01:44:13,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:13,395 INFO L225 Difference]: With dead ends: 2781 [2025-01-10 01:44:13,395 INFO L226 Difference]: Without dead ends: 2142 [2025-01-10 01:44:13,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:44:13,397 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 45 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:13,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 143 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:44:13,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2025-01-10 01:44:13,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 1985. [2025-01-10 01:44:13,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1985 states, 1976 states have (on average 1.270748987854251) internal successors, (2511), 1984 states have internal predecessors, (2511), 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 01:44:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2511 transitions. [2025-01-10 01:44:13,453 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2511 transitions. Word has length 38 [2025-01-10 01:44:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:13,453 INFO L471 AbstractCegarLoop]: Abstraction has 1985 states and 2511 transitions. [2025-01-10 01:44:13,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 01:44:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2511 transitions. [2025-01-10 01:44:13,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 01:44:13,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:13,455 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:13,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:44:13,659 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,SelfDestructingSolverStorable13 [2025-01-10 01:44:13,659 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:13,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:13,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2088634832, now seen corresponding path program 1 times [2025-01-10 01:44:13,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:13,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107847491] [2025-01-10 01:44:13,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:13,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:13,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 01:44:13,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 01:44:13,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:13,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:13,759 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:44:13,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:13,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107847491] [2025-01-10 01:44:13,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107847491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:44:13,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:44:13,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:44:13,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339182273] [2025-01-10 01:44:13,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:44:13,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:44:13,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:13,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:44:13,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:44:13,761 INFO L87 Difference]: Start difference. First operand 1985 states and 2511 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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 01:44:13,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:13,854 INFO L93 Difference]: Finished difference Result 2627 states and 3334 transitions. [2025-01-10 01:44:13,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:44:13,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-01-10 01:44:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:13,864 INFO L225 Difference]: With dead ends: 2627 [2025-01-10 01:44:13,864 INFO L226 Difference]: Without dead ends: 2624 [2025-01-10 01:44:13,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:44:13,866 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 120 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:13,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 47 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:44:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2025-01-10 01:44:13,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1361. [2025-01-10 01:44:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1353 states have (on average 1.2682926829268293) internal successors, (1716), 1360 states have internal predecessors, (1716), 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 01:44:13,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1716 transitions. [2025-01-10 01:44:13,915 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1716 transitions. Word has length 44 [2025-01-10 01:44:13,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:13,915 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 1716 transitions. [2025-01-10 01:44:13,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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 01:44:13,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1716 transitions. [2025-01-10 01:44:13,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 01:44:13,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:13,917 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:13,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:44:13,917 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:13,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:13,917 INFO L85 PathProgramCache]: Analyzing trace with hash 589508210, now seen corresponding path program 1 times [2025-01-10 01:44:13,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:13,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118481245] [2025-01-10 01:44:13,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:13,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:13,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:44:13,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:44:13,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:13,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:44:13,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:13,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118481245] [2025-01-10 01:44:13,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118481245] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:13,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349952910] [2025-01-10 01:44:13,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:13,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:13,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:13,962 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 01:44:13,964 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 01:44:13,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:44:13,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:44:13,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:13,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:14,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:44:14,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:14,160 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:14,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 31 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:14,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349952910] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:44:14,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:44:14,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 13 [2025-01-10 01:44:14,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706826207] [2025-01-10 01:44:14,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:44:14,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:44:14,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:14,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:44:14,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:44:14,289 INFO L87 Difference]: Start difference. First operand 1361 states and 1716 transitions. Second operand has 13 states, 13 states have (on average 9.615384615384615) internal successors, (125), 13 states have internal predecessors, (125), 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 01:44:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:14,851 INFO L93 Difference]: Finished difference Result 2740 states and 3483 transitions. [2025-01-10 01:44:14,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-10 01:44:14,852 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.615384615384615) internal successors, (125), 13 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-10 01:44:14,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:14,859 INFO L225 Difference]: With dead ends: 2740 [2025-01-10 01:44:14,859 INFO L226 Difference]: Without dead ends: 2055 [2025-01-10 01:44:14,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=337, Invalid=853, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 01:44:14,861 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 288 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:14,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 201 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:44:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2025-01-10 01:44:14,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1237. [2025-01-10 01:44:14,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1231 states have (on average 1.2534524776604388) internal successors, (1543), 1236 states have internal predecessors, (1543), 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 01:44:14,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1543 transitions. [2025-01-10 01:44:14,906 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1543 transitions. Word has length 48 [2025-01-10 01:44:14,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:14,907 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1543 transitions. [2025-01-10 01:44:14,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.615384615384615) internal successors, (125), 13 states have internal predecessors, (125), 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 01:44:14,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1543 transitions. [2025-01-10 01:44:14,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 01:44:14,909 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:14,909 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-01-10 01:44:14,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:44:15,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:15,119 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:15,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:15,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1156296055, now seen corresponding path program 2 times [2025-01-10 01:44:15,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:15,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806390505] [2025-01-10 01:44:15,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:44:15,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:15,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-01-10 01:44:15,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:44:15,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:44:15,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:15,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:15,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806390505] [2025-01-10 01:44:15,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806390505] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:15,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337536501] [2025-01-10 01:44:15,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:44:15,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:15,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:15,318 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 01:44:15,320 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 01:44:15,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-01-10 01:44:15,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:44:15,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:44:15,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:15,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:44:15,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:15,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:15,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337536501] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:44:15,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:44:15,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2025-01-10 01:44:15,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185650221] [2025-01-10 01:44:15,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:44:15,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:44:15,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:15,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:44:15,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=166, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:44:15,585 INFO L87 Difference]: Start difference. First operand 1237 states and 1543 transitions. Second operand has 18 states, 17 states have (on average 8.235294117647058) internal successors, (140), 18 states have internal predecessors, (140), 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 01:44:15,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:15,825 INFO L93 Difference]: Finished difference Result 2923 states and 3766 transitions. [2025-01-10 01:44:15,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 01:44:15,826 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 8.235294117647058) internal successors, (140), 18 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-01-10 01:44:15,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:15,834 INFO L225 Difference]: With dead ends: 2923 [2025-01-10 01:44:15,834 INFO L226 Difference]: Without dead ends: 2921 [2025-01-10 01:44:15,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=232, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:44:15,836 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 736 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:15,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 348 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:44:15,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2025-01-10 01:44:15,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2810. [2025-01-10 01:44:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2810 states, 2804 states have (on average 1.2475035663338088) internal successors, (3498), 2809 states have internal predecessors, (3498), 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 01:44:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 3498 transitions. [2025-01-10 01:44:15,944 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 3498 transitions. Word has length 49 [2025-01-10 01:44:15,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:15,944 INFO L471 AbstractCegarLoop]: Abstraction has 2810 states and 3498 transitions. [2025-01-10 01:44:15,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 8.235294117647058) internal successors, (140), 18 states have internal predecessors, (140), 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 01:44:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 3498 transitions. [2025-01-10 01:44:15,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 01:44:15,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:15,946 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:15,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:44:16,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:44:16,148 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:16,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:16,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1600410673, now seen corresponding path program 1 times [2025-01-10 01:44:16,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:16,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290874465] [2025-01-10 01:44:16,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:16,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:16,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 01:44:16,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 01:44:16,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:16,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:16,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:16,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290874465] [2025-01-10 01:44:16,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290874465] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:16,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016554549] [2025-01-10 01:44:16,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:16,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:16,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:16,283 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 01:44:16,285 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 01:44:16,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 01:44:16,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 01:44:16,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:16,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:16,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:44:16,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:16,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:16,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016554549] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:44:16,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:44:16,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-01-10 01:44:16,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119890893] [2025-01-10 01:44:16,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:44:16,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 01:44:16,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:16,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 01:44:16,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=209, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:44:16,607 INFO L87 Difference]: Start difference. First operand 2810 states and 3498 transitions. Second operand has 20 states, 19 states have (on average 9.368421052631579) internal successors, (178), 20 states have internal predecessors, (178), 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 01:44:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:16,994 INFO L93 Difference]: Finished difference Result 8275 states and 10581 transitions. [2025-01-10 01:44:16,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 01:44:16,995 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 9.368421052631579) internal successors, (178), 20 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-01-10 01:44:16,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:17,014 INFO L225 Difference]: With dead ends: 8275 [2025-01-10 01:44:17,014 INFO L226 Difference]: Without dead ends: 6270 [2025-01-10 01:44:17,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=230, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:44:17,020 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 743 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:17,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 437 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:44:17,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6270 states. [2025-01-10 01:44:17,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6270 to 3710. [2025-01-10 01:44:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3710 states, 3704 states have (on average 1.2435205183585314) internal successors, (4606), 3709 states have internal predecessors, (4606), 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 01:44:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 4606 transitions. [2025-01-10 01:44:17,183 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 4606 transitions. Word has length 60 [2025-01-10 01:44:17,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:17,183 INFO L471 AbstractCegarLoop]: Abstraction has 3710 states and 4606 transitions. [2025-01-10 01:44:17,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 9.368421052631579) internal successors, (178), 20 states have internal predecessors, (178), 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 01:44:17,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 4606 transitions. [2025-01-10 01:44:17,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-10 01:44:17,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:17,185 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:17,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:44:17,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:44:17,390 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:17,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:17,391 INFO L85 PathProgramCache]: Analyzing trace with hash -642438251, now seen corresponding path program 1 times [2025-01-10 01:44:17,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:17,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675363242] [2025-01-10 01:44:17,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:17,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:17,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 01:44:17,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 01:44:17,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:17,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:17,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:17,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675363242] [2025-01-10 01:44:17,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675363242] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:17,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172351419] [2025-01-10 01:44:17,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:17,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:17,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:17,612 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:44:17,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:44:17,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 01:44:17,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 01:44:17,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:17,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:17,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:44:17,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:17,824 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:17,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:18,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172351419] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:44:18,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:44:18,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-01-10 01:44:18,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426920260] [2025-01-10 01:44:18,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:44:18,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 01:44:18,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:18,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 01:44:18,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=324, Unknown=0, NotChecked=0, Total=600 [2025-01-10 01:44:18,045 INFO L87 Difference]: Start difference. First operand 3710 states and 4606 transitions. Second operand has 25 states, 24 states have (on average 7.916666666666667) internal successors, (190), 25 states have internal predecessors, (190), 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 01:44:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:18,437 INFO L93 Difference]: Finished difference Result 11046 states and 14213 transitions. [2025-01-10 01:44:18,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 01:44:18,437 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.916666666666667) internal successors, (190), 25 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-10 01:44:18,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:18,463 INFO L225 Difference]: With dead ends: 11046 [2025-01-10 01:44:18,463 INFO L226 Difference]: Without dead ends: 11045 [2025-01-10 01:44:18,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=326, Invalid=376, Unknown=0, NotChecked=0, Total=702 [2025-01-10 01:44:18,468 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 915 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:18,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 602 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:44:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11045 states. [2025-01-10 01:44:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11045 to 10840. [2025-01-10 01:44:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10840 states, 10834 states have (on average 1.2474616946649437) internal successors, (13515), 10839 states have internal predecessors, (13515), 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 01:44:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10840 states to 10840 states and 13515 transitions. [2025-01-10 01:44:18,862 INFO L78 Accepts]: Start accepts. Automaton has 10840 states and 13515 transitions. Word has length 64 [2025-01-10 01:44:18,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:18,862 INFO L471 AbstractCegarLoop]: Abstraction has 10840 states and 13515 transitions. [2025-01-10 01:44:18,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.916666666666667) internal successors, (190), 25 states have internal predecessors, (190), 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 01:44:18,863 INFO L276 IsEmpty]: Start isEmpty. Operand 10840 states and 13515 transitions. [2025-01-10 01:44:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-10 01:44:18,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:18,868 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-01-10 01:44:18,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 01:44:19,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:19,068 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:19,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:19,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1545708081, now seen corresponding path program 3 times [2025-01-10 01:44:19,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:19,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851383066] [2025-01-10 01:44:19,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:44:19,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:19,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 109 statements into 11 equivalence classes. [2025-01-10 01:44:19,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 109 of 109 statements. [2025-01-10 01:44:19,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:44:19,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:19,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:19,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851383066] [2025-01-10 01:44:19,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851383066] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:19,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364842753] [2025-01-10 01:44:19,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:44:19,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:19,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:19,343 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:44:19,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:44:19,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 109 statements into 11 equivalence classes. [2025-01-10 01:44:19,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 109 of 109 statements. [2025-01-10 01:44:19,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:44:19,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:19,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:44:19,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:19,537 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:19,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:19,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364842753] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:44:19,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:44:19,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-01-10 01:44:19,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109221335] [2025-01-10 01:44:19,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:44:19,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-10 01:44:19,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:19,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-10 01:44:19,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-10 01:44:19,857 INFO L87 Difference]: Start difference. First operand 10840 states and 13515 transitions. Second operand has 25 states, 24 states have (on average 9.416666666666666) internal successors, (226), 25 states have internal predecessors, (226), 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 01:44:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:20,387 INFO L93 Difference]: Finished difference Result 15117 states and 19158 transitions. [2025-01-10 01:44:20,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:44:20,389 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 9.416666666666666) internal successors, (226), 25 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-01-10 01:44:20,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:20,418 INFO L225 Difference]: With dead ends: 15117 [2025-01-10 01:44:20,418 INFO L226 Difference]: Without dead ends: 15115 [2025-01-10 01:44:20,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-10 01:44:20,423 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1480 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:20,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 645 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:44:20,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15115 states. [2025-01-10 01:44:20,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15115 to 14730. [2025-01-10 01:44:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14730 states, 14724 states have (on average 1.2223580548763924) internal successors, (17998), 14729 states have internal predecessors, (17998), 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 01:44:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14730 states to 14730 states and 17998 transitions. [2025-01-10 01:44:20,935 INFO L78 Accepts]: Start accepts. Automaton has 14730 states and 17998 transitions. Word has length 109 [2025-01-10 01:44:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:20,936 INFO L471 AbstractCegarLoop]: Abstraction has 14730 states and 17998 transitions. [2025-01-10 01:44:20,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 9.416666666666666) internal successors, (226), 25 states have internal predecessors, (226), 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 01:44:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 14730 states and 17998 transitions. [2025-01-10 01:44:20,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-10 01:44:20,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:20,951 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1] [2025-01-10 01:44:20,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:44:21,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:21,156 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:21,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:21,156 INFO L85 PathProgramCache]: Analyzing trace with hash 541477084, now seen corresponding path program 2 times [2025-01-10 01:44:21,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:21,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981450889] [2025-01-10 01:44:21,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:44:21,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:21,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-01-10 01:44:21,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 01:44:21,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:44:21,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 1350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:21,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:21,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981450889] [2025-01-10 01:44:21,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981450889] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:21,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686571684] [2025-01-10 01:44:21,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:44:21,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:21,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:21,755 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:44:21,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:44:21,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-01-10 01:44:21,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 01:44:21,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:44:21,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:21,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:44:21,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 1350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:22,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:23,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 1350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:23,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686571684] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:44:23,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:44:23,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2025-01-10 01:44:23,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237940774] [2025-01-10 01:44:23,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:44:23,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-01-10 01:44:23,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:23,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-01-10 01:44:23,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1315, Invalid=1441, Unknown=0, NotChecked=0, Total=2756 [2025-01-10 01:44:23,118 INFO L87 Difference]: Start difference. First operand 14730 states and 17998 transitions. Second operand has 53 states, 52 states have (on average 10.807692307692308) internal successors, (562), 53 states have internal predecessors, (562), 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 01:44:24,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:24,793 INFO L93 Difference]: Finished difference Result 22668 states and 28359 transitions. [2025-01-10 01:44:24,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-01-10 01:44:24,794 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 10.807692307692308) internal successors, (562), 53 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2025-01-10 01:44:24,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:24,824 INFO L225 Difference]: With dead ends: 22668 [2025-01-10 01:44:24,824 INFO L226 Difference]: Without dead ends: 22665 [2025-01-10 01:44:24,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1367, Invalid=1495, Unknown=0, NotChecked=0, Total=2862 [2025-01-10 01:44:24,831 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 3567 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3567 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:24,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3567 Valid, 1266 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 01:44:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22665 states. [2025-01-10 01:44:25,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22665 to 17689. [2025-01-10 01:44:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17689 states, 17683 states have (on average 1.234123169145507) internal successors, (21823), 17688 states have internal predecessors, (21823), 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 01:44:25,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17689 states to 17689 states and 21823 transitions. [2025-01-10 01:44:25,412 INFO L78 Accepts]: Start accepts. Automaton has 17689 states and 21823 transitions. Word has length 188 [2025-01-10 01:44:25,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:25,413 INFO L471 AbstractCegarLoop]: Abstraction has 17689 states and 21823 transitions. [2025-01-10 01:44:25,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 10.807692307692308) internal successors, (562), 53 states have internal predecessors, (562), 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 01:44:25,413 INFO L276 IsEmpty]: Start isEmpty. Operand 17689 states and 21823 transitions. [2025-01-10 01:44:25,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-10 01:44:25,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:25,428 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 1, 1, 1] [2025-01-10 01:44:25,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 01:44:25,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:25,632 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:25,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:25,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2031721141, now seen corresponding path program 2 times [2025-01-10 01:44:25,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:25,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955409082] [2025-01-10 01:44:25,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:44:25,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:25,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 192 statements into 2 equivalence classes. [2025-01-10 01:44:25,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 192 of 192 statements. [2025-01-10 01:44:25,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:44:25,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1710 backedges. 0 proven. 1710 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:26,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:26,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955409082] [2025-01-10 01:44:26,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955409082] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:26,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330284658] [2025-01-10 01:44:26,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:44:26,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:26,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:26,356 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:44:26,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:44:26,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 192 statements into 2 equivalence classes. [2025-01-10 01:44:26,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 192 of 192 statements. [2025-01-10 01:44:26,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:44:26,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:26,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 01:44:26,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1710 backedges. 0 proven. 1710 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:27,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1710 backedges. 0 proven. 1710 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:28,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330284658] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:44:28,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:44:28,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 62 [2025-01-10 01:44:28,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168919588] [2025-01-10 01:44:28,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:44:28,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-01-10 01:44:28,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:28,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-01-10 01:44:28,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1498, Invalid=2408, Unknown=0, NotChecked=0, Total=3906 [2025-01-10 01:44:28,252 INFO L87 Difference]: Start difference. First operand 17689 states and 21823 transitions. Second operand has 63 states, 62 states have (on average 9.258064516129032) internal successors, (574), 63 states have internal predecessors, (574), 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 01:44:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:44:38,337 INFO L93 Difference]: Finished difference Result 344348 states and 431494 transitions. [2025-01-10 01:44:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2025-01-10 01:44:38,338 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 9.258064516129032) internal successors, (574), 63 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2025-01-10 01:44:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:44:38,885 INFO L225 Difference]: With dead ends: 344348 [2025-01-10 01:44:38,885 INFO L226 Difference]: Without dead ends: 344347 [2025-01-10 01:44:38,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5940 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=8275, Invalid=16217, Unknown=0, NotChecked=0, Total=24492 [2025-01-10 01:44:38,949 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 5507 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5507 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 01:44:38,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5507 Valid, 1490 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 01:44:39,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344347 states. [2025-01-10 01:44:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344347 to 319088. [2025-01-10 01:44:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319088 states, 319082 states have (on average 1.2390545377050413) internal successors, (395360), 319087 states have internal predecessors, (395360), 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 01:44:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319088 states to 319088 states and 395360 transitions. [2025-01-10 01:44:49,761 INFO L78 Accepts]: Start accepts. Automaton has 319088 states and 395360 transitions. Word has length 192 [2025-01-10 01:44:49,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:44:49,761 INFO L471 AbstractCegarLoop]: Abstraction has 319088 states and 395360 transitions. [2025-01-10 01:44:49,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 9.258064516129032) internal successors, (574), 63 states have internal predecessors, (574), 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 01:44:49,762 INFO L276 IsEmpty]: Start isEmpty. Operand 319088 states and 395360 transitions. [2025-01-10 01:44:49,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-10 01:44:49,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:44:49,881 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 18, 18, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:44:49,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 01:44:50,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:50,082 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:44:50,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:44:50,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1472223968, now seen corresponding path program 1 times [2025-01-10 01:44:50,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:44:50,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626205358] [2025-01-10 01:44:50,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:50,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:44:50,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-10 01:44:50,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-10 01:44:50,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:50,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 0 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:44:50,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:44:50,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626205358] [2025-01-10 01:44:50,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626205358] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:44:50,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342884394] [2025-01-10 01:44:50,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:44:50,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:44:50,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:44:50,777 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:44:50,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 01:44:50,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-10 01:44:50,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-10 01:44:50,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:44:50,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:44:50,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 01:44:50,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:44:51,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 1563 proven. 64 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:44:51,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:44:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 1587 proven. 36 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 01:44:52,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342884394] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:44:52,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:44:52,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 20] total 60 [2025-01-10 01:44:52,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020189484] [2025-01-10 01:44:52,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:44:52,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-01-10 01:44:52,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:44:52,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-01-10 01:44:52,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=891, Invalid=2649, Unknown=0, NotChecked=0, Total=3540 [2025-01-10 01:44:52,106 INFO L87 Difference]: Start difference. First operand 319088 states and 395360 transitions. Second operand has 60 states, 60 states have (on average 9.433333333333334) internal successors, (566), 60 states have internal predecessors, (566), 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)