./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark03_linear.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-zilu/benchmark03_linear.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 36118893e72f01ac34f08ae30ac9eb83d0074096398f7228653cb15beb7a3f4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:45:03,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:45:03,531 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:45:03,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:45:03,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:45:03,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:45:03,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:45:03,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:45:03,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:45:03,564 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:45:03,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:45:03,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:45:03,564 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:45:03,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:45:03,565 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:45:03,565 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:45:03,565 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:45:03,565 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:45:03,565 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:45:03,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:45:03,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:45:03,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:45:03,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:45:03,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:45:03,566 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:45:03,566 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:45:03,566 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:45:03,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:45:03,566 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:45:03,566 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:45:03,566 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:45:03,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:45:03,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:45:03,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:45:03,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:45:03,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:45:03,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:45:03,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:45:03,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:45:03,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:45:03,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:45:03,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:45:03,567 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:45:03,567 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:45:03,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:45:03,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:45:03,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:45:03,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:45:03,568 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:45:03,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:45:03,568 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 -> 36118893e72f01ac34f08ae30ac9eb83d0074096398f7228653cb15beb7a3f4b [2025-01-10 01:45:03,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:45:03,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:45:03,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:45:03,772 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:45:03,772 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:45:03,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark03_linear.i [2025-01-10 01:45:04,925 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10d0af791/59f17c2996c1415d908b33c639de0714/FLAG75dbbcf41 [2025-01-10 01:45:05,091 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:45:05,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark03_linear.i [2025-01-10 01:45:05,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10d0af791/59f17c2996c1415d908b33c639de0714/FLAG75dbbcf41 [2025-01-10 01:45:05,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10d0af791/59f17c2996c1415d908b33c639de0714 [2025-01-10 01:45:05,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:45:05,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:45:05,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:45:05,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:45:05,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:45:05,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:45:05" (1/1) ... [2025-01-10 01:45:05,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db9aec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:05, skipping insertion in model container [2025-01-10 01:45:05,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:45:05" (1/1) ... [2025-01-10 01:45:05,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:45:05,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:45:05,357 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:45:05,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:45:05,387 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:45:05,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:05 WrapperNode [2025-01-10 01:45:05,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:45:05,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:45:05,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:45:05,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:45:05,399 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:45:05" (1/1) ... [2025-01-10 01:45:05,405 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:45:05" (1/1) ... [2025-01-10 01:45:05,419 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2025-01-10 01:45:05,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:45:05,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:45:05,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:45:05,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:45:05,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:05" (1/1) ... [2025-01-10 01:45:05,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:05" (1/1) ... [2025-01-10 01:45:05,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:05" (1/1) ... [2025-01-10 01:45:05,448 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:45:05,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:05" (1/1) ... [2025-01-10 01:45:05,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:05" (1/1) ... [2025-01-10 01:45:05,450 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:05" (1/1) ... [2025-01-10 01:45:05,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:05" (1/1) ... [2025-01-10 01:45:05,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:05" (1/1) ... [2025-01-10 01:45:05,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:05" (1/1) ... [2025-01-10 01:45:05,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:05" (1/1) ... [2025-01-10 01:45:05,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:45:05,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:45:05,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:45:05,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:45:05,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:05" (1/1) ... [2025-01-10 01:45:05,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:45:05,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:05,497 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:45:05,505 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:45:05,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:45:05,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:45:05,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:45:05,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:45:05,572 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:45:05,574 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:45:05,697 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-01-10 01:45:05,697 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:45:05,703 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:45:05,704 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 01:45:05,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:45:05 BoogieIcfgContainer [2025-01-10 01:45:05,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:45:05,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:45:05,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:45:05,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:45:05,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:45:05" (1/3) ... [2025-01-10 01:45:05,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e3fa49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:45:05, skipping insertion in model container [2025-01-10 01:45:05,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:45:05" (2/3) ... [2025-01-10 01:45:05,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e3fa49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:45:05, skipping insertion in model container [2025-01-10 01:45:05,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:45:05" (3/3) ... [2025-01-10 01:45:05,711 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark03_linear.i [2025-01-10 01:45:05,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:45:05,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark03_linear.i that has 1 procedures, 35 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2025-01-10 01:45:05,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:45:05,761 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;@1e276641, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:45:05,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 01:45:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:05,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:45:05,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:05,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:05,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:05,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:05,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1806875016, now seen corresponding path program 1 times [2025-01-10 01:45:05,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:05,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5589629] [2025-01-10 01:45:05,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:05,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:05,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:45:05,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:45:05,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:05,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:05,922 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:45:05,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:05,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5589629] [2025-01-10 01:45:05,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5589629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:05,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:45:05,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:45:05,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069594646] [2025-01-10 01:45:05,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:05,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:45:05,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:05,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:45:05,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:45:05,939 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:45:05,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:05,968 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2025-01-10 01:45:05,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:45:05,969 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:45:05,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:05,973 INFO L225 Difference]: With dead ends: 54 [2025-01-10 01:45:05,973 INFO L226 Difference]: Without dead ends: 32 [2025-01-10 01:45:05,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:45:05,977 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:05,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 87 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:05,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-10 01:45:05,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-10 01:45:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 31 states have internal predecessors, (33), 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:45:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2025-01-10 01:45:05,998 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 7 [2025-01-10 01:45:05,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:05,998 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2025-01-10 01:45:05,998 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:45:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2025-01-10 01:45:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:45:05,999 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:05,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:05,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:45:05,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:05,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:06,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1240104458, now seen corresponding path program 1 times [2025-01-10 01:45:06,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:06,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792309626] [2025-01-10 01:45:06,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:06,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:06,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:45:06,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:45:06,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:06,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:06,055 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:45:06,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:06,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792309626] [2025-01-10 01:45:06,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792309626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:06,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:45:06,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:45:06,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391783454] [2025-01-10 01:45:06,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:06,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:45:06,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:06,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:45:06,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:45:06,058 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:06,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:06,078 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2025-01-10 01:45:06,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:45:06,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 01:45:06,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:06,079 INFO L225 Difference]: With dead ends: 36 [2025-01-10 01:45:06,079 INFO L226 Difference]: Without dead ends: 34 [2025-01-10 01:45:06,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:45:06,079 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:06,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:06,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-10 01:45:06,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-01-10 01:45:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 33 states have internal predecessors, (35), 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:45:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2025-01-10 01:45:06,083 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 9 [2025-01-10 01:45:06,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:06,083 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2025-01-10 01:45:06,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:06,083 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2025-01-10 01:45:06,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 01:45:06,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:06,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:06,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:45:06,084 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:06,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:06,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2034444940, now seen corresponding path program 1 times [2025-01-10 01:45:06,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:06,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000908952] [2025-01-10 01:45:06,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:06,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:06,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:45:06,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:45:06,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:06,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:06,171 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:45:06,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:06,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000908952] [2025-01-10 01:45:06,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000908952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:06,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:45:06,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:45:06,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69477713] [2025-01-10 01:45:06,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:06,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:45:06,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:06,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:45:06,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:45:06,173 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:45:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:06,218 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2025-01-10 01:45:06,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:45:06,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:45:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:06,219 INFO L225 Difference]: With dead ends: 37 [2025-01-10 01:45:06,219 INFO L226 Difference]: Without dead ends: 36 [2025-01-10 01:45:06,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:45:06,220 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:06,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 77 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-10 01:45:06,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2025-01-10 01:45:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.44) internal successors, (36), 34 states have internal predecessors, (36), 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:45:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-01-10 01:45:06,224 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 11 [2025-01-10 01:45:06,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:06,225 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-01-10 01:45:06,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:45:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-01-10 01:45:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:45:06,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:06,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:06,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:45:06,226 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:06,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:06,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1356716240, now seen corresponding path program 1 times [2025-01-10 01:45:06,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:06,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276707574] [2025-01-10 01:45:06,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:06,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:06,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:45:06,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:45:06,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:06,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:06,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:06,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276707574] [2025-01-10 01:45:06,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276707574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:06,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:45:06,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:45:06,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628308943] [2025-01-10 01:45:06,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:06,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:45:06,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:06,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:45:06,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:45:06,326 INFO L87 Difference]: Start difference. First operand 35 states and 36 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:45:06,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:06,367 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-01-10 01:45:06,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:45:06,368 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:45:06,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:06,368 INFO L225 Difference]: With dead ends: 37 [2025-01-10 01:45:06,368 INFO L226 Difference]: Without dead ends: 36 [2025-01-10 01:45:06,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:45:06,373 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:06,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:06,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-10 01:45:06,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-10 01:45:06,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 35 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:06,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2025-01-10 01:45:06,376 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 12 [2025-01-10 01:45:06,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:06,376 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2025-01-10 01:45:06,376 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:45:06,377 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2025-01-10 01:45:06,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:45:06,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:06,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:06,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:45:06,377 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:06,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:06,378 INFO L85 PathProgramCache]: Analyzing trace with hash 891469582, now seen corresponding path program 1 times [2025-01-10 01:45:06,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:06,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958013640] [2025-01-10 01:45:06,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:06,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:06,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:45:06,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:45:06,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:06,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:06,452 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:45:06,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:06,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958013640] [2025-01-10 01:45:06,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958013640] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:06,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:45:06,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:45:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229907047] [2025-01-10 01:45:06,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:06,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:45:06,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:06,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:45:06,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:45:06,455 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:06,521 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2025-01-10 01:45:06,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:45:06,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 01:45:06,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:06,525 INFO L225 Difference]: With dead ends: 39 [2025-01-10 01:45:06,525 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 01:45:06,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:45:06,526 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:06,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 84 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:45:06,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 01:45:06,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2025-01-10 01:45:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 36 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:45:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2025-01-10 01:45:06,532 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 13 [2025-01-10 01:45:06,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:06,532 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2025-01-10 01:45:06,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:06,532 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2025-01-10 01:45:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:45:06,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:06,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:06,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:45:06,533 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:06,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:06,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1865753330, now seen corresponding path program 1 times [2025-01-10 01:45:06,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:06,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185000122] [2025-01-10 01:45:06,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:06,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:06,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:45:06,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:45:06,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:06,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:06,672 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:45:06,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:06,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185000122] [2025-01-10 01:45:06,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185000122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:06,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:45:06,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:45:06,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486391050] [2025-01-10 01:45:06,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:06,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:45:06,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:06,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:45:06,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:45:06,673 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:06,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:06,714 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2025-01-10 01:45:06,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:45:06,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-10 01:45:06,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:06,715 INFO L225 Difference]: With dead ends: 39 [2025-01-10 01:45:06,715 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 01:45:06,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:45:06,716 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:06,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 01:45:06,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-10 01:45:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 37 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2025-01-10 01:45:06,718 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 14 [2025-01-10 01:45:06,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:06,718 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-01-10 01:45:06,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:45:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2025-01-10 01:45:06,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:45:06,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:06,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:06,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:45:06,718 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:06,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1987589844, now seen corresponding path program 1 times [2025-01-10 01:45:06,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:06,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117865313] [2025-01-10 01:45:06,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:06,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:06,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:45:06,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:45:06,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:06,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:06,870 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:45:06,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:06,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117865313] [2025-01-10 01:45:06,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117865313] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:06,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:45:06,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:45:06,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523351400] [2025-01-10 01:45:06,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:06,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:45:06,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:06,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:45:06,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:45:06,872 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:45:06,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:06,949 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2025-01-10 01:45:06,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:45:06,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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 16 [2025-01-10 01:45:06,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:06,949 INFO L225 Difference]: With dead ends: 59 [2025-01-10 01:45:06,949 INFO L226 Difference]: Without dead ends: 58 [2025-01-10 01:45:06,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:45:06,950 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 18 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:06,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 118 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:45:06,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-10 01:45:06,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2025-01-10 01:45:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.4) internal successors, (42), 39 states have internal predecessors, (42), 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:45:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2025-01-10 01:45:06,957 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 16 [2025-01-10 01:45:06,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:06,957 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2025-01-10 01:45:06,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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:45:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2025-01-10 01:45:06,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 01:45:06,957 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:06,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:06,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:45:06,957 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:06,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:06,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1485743091, now seen corresponding path program 1 times [2025-01-10 01:45:06,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:06,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518402786] [2025-01-10 01:45:06,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:06,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:06,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:45:06,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:45:06,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:06,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:07,024 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:45:07,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:07,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518402786] [2025-01-10 01:45:07,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518402786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:07,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:45:07,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:45:07,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300993855] [2025-01-10 01:45:07,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:07,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:45:07,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:07,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:45:07,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:45:07,025 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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:45:07,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:07,062 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2025-01-10 01:45:07,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:45:07,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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 17 [2025-01-10 01:45:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:07,062 INFO L225 Difference]: With dead ends: 59 [2025-01-10 01:45:07,063 INFO L226 Difference]: Without dead ends: 58 [2025-01-10 01:45:07,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:45:07,063 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:07,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 83 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:07,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-10 01:45:07,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2025-01-10 01:45:07,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 40 states have internal predecessors, (43), 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:45:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2025-01-10 01:45:07,066 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 17 [2025-01-10 01:45:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:07,066 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2025-01-10 01:45:07,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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:45:07,066 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2025-01-10 01:45:07,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 01:45:07,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:07,066 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:45:07,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:45:07,066 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:07,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:07,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1874650748, now seen corresponding path program 1 times [2025-01-10 01:45:07,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:07,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550575003] [2025-01-10 01:45:07,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:07,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:07,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:45:07,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:45:07,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:07,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:07,149 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:45:07,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:07,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550575003] [2025-01-10 01:45:07,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550575003] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:07,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636629841] [2025-01-10 01:45:07,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:07,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:07,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:07,152 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:45:07,153 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:45:07,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:45:07,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:45:07,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:07,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:07,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:45:07,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:07,323 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:45:07,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:45:07,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636629841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:07,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:45:07,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 01:45:07,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537722529] [2025-01-10 01:45:07,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:07,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:45:07,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:07,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:45:07,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:45:07,324 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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:45:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:07,397 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2025-01-10 01:45:07,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:45:07,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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:45:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:07,398 INFO L225 Difference]: With dead ends: 41 [2025-01-10 01:45:07,398 INFO L226 Difference]: Without dead ends: 40 [2025-01-10 01:45:07,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:45:07,399 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:07,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 65 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:45:07,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-10 01:45:07,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-10 01:45:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 39 states have internal predecessors, (42), 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:45:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2025-01-10 01:45:07,407 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 19 [2025-01-10 01:45:07,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:07,408 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2025-01-10 01:45:07,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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:45:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2025-01-10 01:45:07,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 01:45:07,408 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:07,408 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:07,414 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:45:07,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:07,609 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:07,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:07,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2015368904, now seen corresponding path program 1 times [2025-01-10 01:45:07,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:07,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209501040] [2025-01-10 01:45:07,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:07,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:07,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:45:07,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:45:07,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:07,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:07,730 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:45:07,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:07,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209501040] [2025-01-10 01:45:07,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209501040] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:07,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367039032] [2025-01-10 01:45:07,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:07,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:07,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:07,732 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:45:07,737 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:45:07,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:45:07,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:45:07,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:07,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:07,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:45:07,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:07,861 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:45:07,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:07,909 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:45:07,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367039032] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:07,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:07,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:45:07,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043518658] [2025-01-10 01:45:07,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:07,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:45:07,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:07,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:45:07,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:45:07,910 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 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:45:07,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:07,948 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2025-01-10 01:45:07,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:45:07,949 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 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:45:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:07,950 INFO L225 Difference]: With dead ends: 86 [2025-01-10 01:45:07,950 INFO L226 Difference]: Without dead ends: 85 [2025-01-10 01:45:07,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:45:07,951 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:07,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 128 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:07,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-10 01:45:07,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2025-01-10 01:45:07,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.453125) internal successors, (93), 72 states have internal predecessors, (93), 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:45:07,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2025-01-10 01:45:07,955 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 20 [2025-01-10 01:45:07,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:07,955 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2025-01-10 01:45:07,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 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:45:07,956 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2025-01-10 01:45:07,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:45:07,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:07,956 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:07,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:45:08,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:08,156 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:08,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:08,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1948073470, now seen corresponding path program 1 times [2025-01-10 01:45:08,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:08,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508947951] [2025-01-10 01:45:08,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:08,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:08,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:45:08,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:45:08,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:08,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:08,223 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:45:08,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:08,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508947951] [2025-01-10 01:45:08,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508947951] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:08,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873275325] [2025-01-10 01:45:08,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:08,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:08,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:08,226 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:45:08,227 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:45:08,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:45:08,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:45:08,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:08,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:08,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:45:08,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:08,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:45:08,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873275325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:08,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:45:08,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 01:45:08,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990624900] [2025-01-10 01:45:08,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:08,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:45:08,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:08,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:45:08,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:45:08,300 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:45:08,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:08,327 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2025-01-10 01:45:08,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:45:08,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:45:08,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:08,328 INFO L225 Difference]: With dead ends: 73 [2025-01-10 01:45:08,328 INFO L226 Difference]: Without dead ends: 72 [2025-01-10 01:45:08,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:45:08,329 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:08,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 70 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-01-10 01:45:08,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-01-10 01:45:08,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.40625) internal successors, (90), 71 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:45:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2025-01-10 01:45:08,338 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 21 [2025-01-10 01:45:08,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:08,338 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2025-01-10 01:45:08,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:45:08,338 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2025-01-10 01:45:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 01:45:08,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:08,338 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:08,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:45:08,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:08,540 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:08,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:08,540 INFO L85 PathProgramCache]: Analyzing trace with hash 260735482, now seen corresponding path program 1 times [2025-01-10 01:45:08,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:08,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661795700] [2025-01-10 01:45:08,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:08,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:08,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:45:08,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:45:08,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:08,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:08,586 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:45:08,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:08,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661795700] [2025-01-10 01:45:08,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661795700] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:08,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095623570] [2025-01-10 01:45:08,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:08,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:08,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:08,589 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:45:08,591 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:45:08,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:45:08,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:45:08,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:08,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:08,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:45:08,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:08,681 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:45:08,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:08,718 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:45:08,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095623570] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:08,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:08,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:45:08,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823952077] [2025-01-10 01:45:08,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:08,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:45:08,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:08,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:45:08,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:45:08,719 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 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:45:08,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:08,753 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2025-01-10 01:45:08,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:45:08,754 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 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:45:08,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:08,754 INFO L225 Difference]: With dead ends: 83 [2025-01-10 01:45:08,754 INFO L226 Difference]: Without dead ends: 82 [2025-01-10 01:45:08,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:45:08,755 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:08,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 115 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-10 01:45:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2025-01-10 01:45:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 73 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:45:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2025-01-10 01:45:08,762 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 22 [2025-01-10 01:45:08,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:08,762 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2025-01-10 01:45:08,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 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:45:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2025-01-10 01:45:08,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:45:08,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:08,763 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:08,768 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:45:08,963 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,SelfDestructingSolverStorable11 [2025-01-10 01:45:08,964 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:08,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:08,967 INFO L85 PathProgramCache]: Analyzing trace with hash -507134592, now seen corresponding path program 1 times [2025-01-10 01:45:08,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:08,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165268924] [2025-01-10 01:45:08,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:08,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:08,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:45:08,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:45:08,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:08,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:09,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:09,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165268924] [2025-01-10 01:45:09,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165268924] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:09,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236586010] [2025-01-10 01:45:09,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:09,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:09,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:09,076 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:45:09,083 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:45:09,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:45:09,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:45:09,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:09,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:09,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:45:09,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:09,227 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:09,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:45:09,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236586010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:09,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:45:09,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-01-10 01:45:09,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572054566] [2025-01-10 01:45:09,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:09,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:45:09,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:09,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:45:09,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:45:09,228 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 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:45:09,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:09,281 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2025-01-10 01:45:09,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:45:09,282 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 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 23 [2025-01-10 01:45:09,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:09,282 INFO L225 Difference]: With dead ends: 74 [2025-01-10 01:45:09,282 INFO L226 Difference]: Without dead ends: 73 [2025-01-10 01:45:09,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:45:09,283 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 21 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:09,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 83 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:09,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-10 01:45:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-01-10 01:45:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 72 states have internal predecessors, (87), 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:45:09,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2025-01-10 01:45:09,286 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 23 [2025-01-10 01:45:09,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:09,286 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2025-01-10 01:45:09,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 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:45:09,286 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2025-01-10 01:45:09,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 01:45:09,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:09,287 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:09,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:45:09,487 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:45:09,488 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:09,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:09,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1458696892, now seen corresponding path program 1 times [2025-01-10 01:45:09,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:09,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077955564] [2025-01-10 01:45:09,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:09,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:09,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:45:09,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:45:09,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:09,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:09,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:09,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077955564] [2025-01-10 01:45:09,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077955564] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:09,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778107075] [2025-01-10 01:45:09,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:09,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:09,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:09,581 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:45:09,582 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:45:09,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:45:09,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:45:09,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:09,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:09,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:45:09,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:09,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:09,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778107075] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:09,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:09,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-01-10 01:45:09,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713452349] [2025-01-10 01:45:09,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:09,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 01:45:09,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:09,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 01:45:09,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2025-01-10 01:45:09,804 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 23 states have internal predecessors, (70), 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:45:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:09,898 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2025-01-10 01:45:09,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:45:09,899 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 23 states have internal predecessors, (70), 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 24 [2025-01-10 01:45:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:09,899 INFO L225 Difference]: With dead ends: 84 [2025-01-10 01:45:09,899 INFO L226 Difference]: Without dead ends: 83 [2025-01-10 01:45:09,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2025-01-10 01:45:09,900 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 59 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:09,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 230 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:09,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-10 01:45:09,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2025-01-10 01:45:09,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 74 states have internal predecessors, (87), 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:45:09,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2025-01-10 01:45:09,903 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 24 [2025-01-10 01:45:09,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:09,903 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2025-01-10 01:45:09,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 23 states have internal predecessors, (70), 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:45:09,903 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2025-01-10 01:45:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 01:45:09,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:09,904 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:09,909 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:45:10,104 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:45:10,105 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:10,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:10,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2025036542, now seen corresponding path program 1 times [2025-01-10 01:45:10,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:10,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475936009] [2025-01-10 01:45:10,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:10,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:10,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:45:10,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:45:10,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:10,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:10,169 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:45:10,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:10,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475936009] [2025-01-10 01:45:10,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475936009] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:10,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751651785] [2025-01-10 01:45:10,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:10,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:10,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:10,174 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:45:10,175 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:45:10,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:45:10,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:45:10,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:10,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:10,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:45:10,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:10,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:45:10,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751651785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:10,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:45:10,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-01-10 01:45:10,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166515394] [2025-01-10 01:45:10,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:10,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:45:10,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:10,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:45:10,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:45:10,316 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 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:45:10,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:10,368 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2025-01-10 01:45:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:45:10,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 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:45:10,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:10,368 INFO L225 Difference]: With dead ends: 75 [2025-01-10 01:45:10,369 INFO L226 Difference]: Without dead ends: 73 [2025-01-10 01:45:10,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:45:10,369 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:10,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 100 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:10,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-10 01:45:10,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-01-10 01:45:10,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 72 states have internal predecessors, (81), 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:45:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2025-01-10 01:45:10,372 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 25 [2025-01-10 01:45:10,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:10,372 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2025-01-10 01:45:10,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 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:45:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2025-01-10 01:45:10,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 01:45:10,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:10,373 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:10,378 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:45:10,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:10,573 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:10,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:10,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1648376702, now seen corresponding path program 1 times [2025-01-10 01:45:10,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:10,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035357969] [2025-01-10 01:45:10,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:10,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:10,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:45:10,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:45:10,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:10,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:10,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:10,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035357969] [2025-01-10 01:45:10,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035357969] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:10,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121045596] [2025-01-10 01:45:10,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:10,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:10,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:10,644 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:45:10,646 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:45:10,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:45:10,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:45:10,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:10,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:10,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:45:10,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:10,771 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:10,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:10,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121045596] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:10,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:10,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-01-10 01:45:10,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897766364] [2025-01-10 01:45:10,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:10,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 01:45:10,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:10,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 01:45:10,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2025-01-10 01:45:10,874 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 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:45:11,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:11,067 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2025-01-10 01:45:11,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 01:45:11,067 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 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 26 [2025-01-10 01:45:11,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:11,068 INFO L225 Difference]: With dead ends: 135 [2025-01-10 01:45:11,068 INFO L226 Difference]: Without dead ends: 134 [2025-01-10 01:45:11,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2025-01-10 01:45:11,070 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 52 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:11,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 172 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:45:11,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-10 01:45:11,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2025-01-10 01:45:11,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.1293103448275863) internal successors, (131), 120 states have internal predecessors, (131), 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:45:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2025-01-10 01:45:11,078 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 26 [2025-01-10 01:45:11,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:11,078 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2025-01-10 01:45:11,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 23 states have internal predecessors, (76), 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:45:11,078 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2025-01-10 01:45:11,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 01:45:11,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:11,078 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:45:11,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:45:11,280 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,SelfDestructingSolverStorable15 [2025-01-10 01:45:11,281 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:11,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:11,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1865666585, now seen corresponding path program 1 times [2025-01-10 01:45:11,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:11,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982444501] [2025-01-10 01:45:11,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:11,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:11,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:45:11,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:45:11,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:11,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:11,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:11,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982444501] [2025-01-10 01:45:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982444501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:11,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:45:11,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:45:11,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14387534] [2025-01-10 01:45:11,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:11,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:45:11,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:11,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:45:11,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:45:11,335 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:45:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:11,350 INFO L93 Difference]: Finished difference Result 189 states and 204 transitions. [2025-01-10 01:45:11,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:45:11,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2025-01-10 01:45:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:11,354 INFO L225 Difference]: With dead ends: 189 [2025-01-10 01:45:11,354 INFO L226 Difference]: Without dead ends: 145 [2025-01-10 01:45:11,354 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:45:11,355 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:11,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-10 01:45:11,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2025-01-10 01:45:11,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.1176470588235294) internal successors, (152), 140 states have internal predecessors, (152), 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:45:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2025-01-10 01:45:11,368 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 29 [2025-01-10 01:45:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:11,368 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2025-01-10 01:45:11,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:45:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2025-01-10 01:45:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 01:45:11,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:11,369 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:45:11,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:45:11,369 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:11,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:11,370 INFO L85 PathProgramCache]: Analyzing trace with hash -38811837, now seen corresponding path program 1 times [2025-01-10 01:45:11,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:11,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666117323] [2025-01-10 01:45:11,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:11,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:11,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:45:11,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:45:11,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:11,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:11,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:11,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666117323] [2025-01-10 01:45:11,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666117323] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:11,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420455584] [2025-01-10 01:45:11,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:11,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:11,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:11,536 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:45:11,538 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:45:11,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:45:11,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:45:11,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:11,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:11,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:45:11,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:11,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:11,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420455584] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:11,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:11,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-01-10 01:45:11,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423541468] [2025-01-10 01:45:11,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:11,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 01:45:11,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:11,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 01:45:11,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2025-01-10 01:45:11,894 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand has 28 states, 27 states have (on average 3.259259259259259) internal successors, (88), 28 states have internal predecessors, (88), 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:45:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:12,112 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2025-01-10 01:45:12,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 01:45:12,113 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.259259259259259) internal successors, (88), 28 states have internal predecessors, (88), 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 31 [2025-01-10 01:45:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:12,114 INFO L225 Difference]: With dead ends: 169 [2025-01-10 01:45:12,114 INFO L226 Difference]: Without dead ends: 167 [2025-01-10 01:45:12,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=970, Unknown=0, NotChecked=0, Total=1260 [2025-01-10 01:45:12,115 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 97 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:12,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 202 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:45:12,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-01-10 01:45:12,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 129. [2025-01-10 01:45:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.1048387096774193) internal successors, (137), 128 states have internal predecessors, (137), 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:45:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2025-01-10 01:45:12,121 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 31 [2025-01-10 01:45:12,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:12,121 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2025-01-10 01:45:12,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.259259259259259) internal successors, (88), 28 states have internal predecessors, (88), 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:45:12,122 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2025-01-10 01:45:12,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-10 01:45:12,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:12,123 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:45:12,128 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:45:12,327 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:45:12,327 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:12,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:12,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1886254302, now seen corresponding path program 1 times [2025-01-10 01:45:12,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:12,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863193028] [2025-01-10 01:45:12,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:12,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:12,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 01:45:12,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 01:45:12,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:12,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:45:12,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:12,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863193028] [2025-01-10 01:45:12,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863193028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:45:12,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:45:12,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:45:12,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869572215] [2025-01-10 01:45:12,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:45:12,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:45:12,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:12,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:45:12,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:45:12,379 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:45:12,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:12,385 INFO L93 Difference]: Finished difference Result 172 states and 176 transitions. [2025-01-10 01:45:12,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:45:12,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 54 [2025-01-10 01:45:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:12,386 INFO L225 Difference]: With dead ends: 172 [2025-01-10 01:45:12,386 INFO L226 Difference]: Without dead ends: 124 [2025-01-10 01:45:12,387 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:45:12,387 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:12,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 54 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-10 01:45:12,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2025-01-10 01:45:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.0869565217391304) internal successors, (125), 119 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:45:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2025-01-10 01:45:12,394 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 54 [2025-01-10 01:45:12,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:12,394 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2025-01-10 01:45:12,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:45:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2025-01-10 01:45:12,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 01:45:12,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:12,396 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2025-01-10 01:45:12,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:45:12,396 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:12,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:12,396 INFO L85 PathProgramCache]: Analyzing trace with hash 275522306, now seen corresponding path program 1 times [2025-01-10 01:45:12,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:12,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823454677] [2025-01-10 01:45:12,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:12,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:12,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 01:45:12,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 01:45:12,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:12,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:12,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:12,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823454677] [2025-01-10 01:45:12,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823454677] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:12,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502096608] [2025-01-10 01:45:12,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:45:12,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:12,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:12,712 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:45:12,713 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:45:12,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 01:45:12,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 01:45:12,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:45:12,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:12,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:45:12,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:13,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:13,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502096608] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:13,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:13,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 49 [2025-01-10 01:45:13,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775149296] [2025-01-10 01:45:13,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:13,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-01-10 01:45:13,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:13,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-01-10 01:45:13,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1987, Unknown=0, NotChecked=0, Total=2450 [2025-01-10 01:45:13,669 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 50 states, 49 states have (on average 3.3877551020408165) internal successors, (166), 50 states have internal predecessors, (166), 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:45:14,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:14,213 INFO L93 Difference]: Finished difference Result 225 states and 249 transitions. [2025-01-10 01:45:14,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-10 01:45:14,213 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 3.3877551020408165) internal successors, (166), 50 states have internal predecessors, (166), 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 56 [2025-01-10 01:45:14,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:14,214 INFO L225 Difference]: With dead ends: 225 [2025-01-10 01:45:14,214 INFO L226 Difference]: Without dead ends: 224 [2025-01-10 01:45:14,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1516 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=733, Invalid=3173, Unknown=0, NotChecked=0, Total=3906 [2025-01-10 01:45:14,217 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 168 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:14,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 314 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:45:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-01-10 01:45:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 212. [2025-01-10 01:45:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 207 states have (on average 1.1642512077294687) internal successors, (241), 211 states have internal predecessors, (241), 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:45:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 241 transitions. [2025-01-10 01:45:14,235 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 241 transitions. Word has length 56 [2025-01-10 01:45:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:14,236 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 241 transitions. [2025-01-10 01:45:14,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.3877551020408165) internal successors, (166), 50 states have internal predecessors, (166), 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:45:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 241 transitions. [2025-01-10 01:45:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 01:45:14,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:14,237 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-01-10 01:45:14,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 01:45:14,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:14,441 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:14,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:14,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1297968676, now seen corresponding path program 2 times [2025-01-10 01:45:14,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:14,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184186596] [2025-01-10 01:45:14,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:45:14,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:14,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-01-10 01:45:14,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 01:45:14,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:45:14,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:14,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:14,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184186596] [2025-01-10 01:45:14,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184186596] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:14,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712830896] [2025-01-10 01:45:14,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:45:14,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:14,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:14,674 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:45:14,676 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:45:14,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-01-10 01:45:14,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 01:45:14,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:45:14,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:14,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:45:14,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:14,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:15,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712830896] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:15,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:15,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 34 [2025-01-10 01:45:15,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442773934] [2025-01-10 01:45:15,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:15,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-10 01:45:15,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:15,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-10 01:45:15,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=977, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 01:45:15,120 INFO L87 Difference]: Start difference. First operand 212 states and 241 transitions. Second operand has 35 states, 34 states have (on average 4.882352941176471) internal successors, (166), 35 states have internal predecessors, (166), 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:45:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:15,353 INFO L93 Difference]: Finished difference Result 309 states and 347 transitions. [2025-01-10 01:45:15,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-10 01:45:15,353 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.882352941176471) internal successors, (166), 35 states have internal predecessors, (166), 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 56 [2025-01-10 01:45:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:15,354 INFO L225 Difference]: With dead ends: 309 [2025-01-10 01:45:15,354 INFO L226 Difference]: Without dead ends: 308 [2025-01-10 01:45:15,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=334, Invalid=1646, Unknown=0, NotChecked=0, Total=1980 [2025-01-10 01:45:15,355 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 120 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:15,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 578 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:45:15,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-01-10 01:45:15,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 292. [2025-01-10 01:45:15,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 287 states have (on average 1.1602787456445993) internal successors, (333), 291 states have internal predecessors, (333), 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:45:15,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 333 transitions. [2025-01-10 01:45:15,374 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 333 transitions. Word has length 56 [2025-01-10 01:45:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:15,374 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 333 transitions. [2025-01-10 01:45:15,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.882352941176471) internal successors, (166), 35 states have internal predecessors, (166), 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:45:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 333 transitions. [2025-01-10 01:45:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 01:45:15,374 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:15,374 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-01-10 01:45:15,380 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:45:15,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-10 01:45:15,575 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:15,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:15,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1807380066, now seen corresponding path program 2 times [2025-01-10 01:45:15,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:15,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018847735] [2025-01-10 01:45:15,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:45:15,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:15,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-01-10 01:45:15,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 01:45:15,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:45:15,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:15,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:15,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018847735] [2025-01-10 01:45:15,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018847735] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:15,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113318772] [2025-01-10 01:45:15,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:45:15,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:15,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:15,798 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:45:15,799 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:45:15,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-01-10 01:45:15,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 01:45:15,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:45:15,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:15,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:45:15,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:15,984 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:15,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:16,192 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:16,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113318772] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:16,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:16,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 34 [2025-01-10 01:45:16,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182036738] [2025-01-10 01:45:16,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:16,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-10 01:45:16,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:16,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-10 01:45:16,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=977, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 01:45:16,194 INFO L87 Difference]: Start difference. First operand 292 states and 333 transitions. Second operand has 35 states, 34 states have (on average 5.0588235294117645) internal successors, (172), 35 states have internal predecessors, (172), 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:45:16,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:16,474 INFO L93 Difference]: Finished difference Result 310 states and 339 transitions. [2025-01-10 01:45:16,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-10 01:45:16,475 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 5.0588235294117645) internal successors, (172), 35 states have internal predecessors, (172), 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 58 [2025-01-10 01:45:16,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:16,476 INFO L225 Difference]: With dead ends: 310 [2025-01-10 01:45:16,476 INFO L226 Difference]: Without dead ends: 309 [2025-01-10 01:45:16,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=349, Invalid=1721, Unknown=0, NotChecked=0, Total=2070 [2025-01-10 01:45:16,479 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 149 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:16,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 613 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:45:16,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-01-10 01:45:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 296. [2025-01-10 01:45:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 291 states have (on average 1.1168384879725086) internal successors, (325), 295 states have internal predecessors, (325), 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:45:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 325 transitions. [2025-01-10 01:45:16,491 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 325 transitions. Word has length 58 [2025-01-10 01:45:16,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:16,492 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 325 transitions. [2025-01-10 01:45:16,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 5.0588235294117645) internal successors, (172), 35 states have internal predecessors, (172), 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:45:16,492 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 325 transitions. [2025-01-10 01:45:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-10 01:45:16,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:16,492 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1] [2025-01-10 01:45:16,505 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:45:16,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:16,693 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:16,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:16,693 INFO L85 PathProgramCache]: Analyzing trace with hash 402581987, now seen corresponding path program 2 times [2025-01-10 01:45:16,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:16,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453992658] [2025-01-10 01:45:16,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:45:16,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:16,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-01-10 01:45:16,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 01:45:16,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:45:16,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:16,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:16,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453992658] [2025-01-10 01:45:16,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453992658] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:16,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129912106] [2025-01-10 01:45:16,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:45:16,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:16,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:16,944 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:45:16,966 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:45:16,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-01-10 01:45:17,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 01:45:17,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:45:17,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:17,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:45:17,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:17,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:17,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129912106] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:17,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:17,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 51 [2025-01-10 01:45:17,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870617370] [2025-01-10 01:45:17,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:17,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-01-10 01:45:17,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:17,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-01-10 01:45:17,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=2150, Unknown=0, NotChecked=0, Total=2652 [2025-01-10 01:45:17,611 INFO L87 Difference]: Start difference. First operand 296 states and 325 transitions. Second operand has 52 states, 51 states have (on average 3.372549019607843) internal successors, (172), 52 states have internal predecessors, (172), 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:45:18,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:18,070 INFO L93 Difference]: Finished difference Result 304 states and 325 transitions. [2025-01-10 01:45:18,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-10 01:45:18,070 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 3.372549019607843) internal successors, (172), 52 states have internal predecessors, (172), 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 59 [2025-01-10 01:45:18,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:18,071 INFO L225 Difference]: With dead ends: 304 [2025-01-10 01:45:18,071 INFO L226 Difference]: Without dead ends: 303 [2025-01-10 01:45:18,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1750 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=891, Invalid=3801, Unknown=0, NotChecked=0, Total=4692 [2025-01-10 01:45:18,072 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 266 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:18,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 378 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:45:18,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-01-10 01:45:18,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 296. [2025-01-10 01:45:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 291 states have (on average 1.1030927835051547) internal successors, (321), 295 states have internal predecessors, (321), 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:45:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 321 transitions. [2025-01-10 01:45:18,085 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 321 transitions. Word has length 59 [2025-01-10 01:45:18,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:18,085 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 321 transitions. [2025-01-10 01:45:18,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 3.372549019607843) internal successors, (172), 52 states have internal predecessors, (172), 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:45:18,085 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 321 transitions. [2025-01-10 01:45:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 01:45:18,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:18,085 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1] [2025-01-10 01:45:18,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 01:45:18,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:18,290 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:18,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:18,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1725453984, now seen corresponding path program 2 times [2025-01-10 01:45:18,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:18,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484778562] [2025-01-10 01:45:18,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:45:18,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:18,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-01-10 01:45:18,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 01:45:18,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:45:18,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:18,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:18,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484778562] [2025-01-10 01:45:18,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484778562] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:18,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098414653] [2025-01-10 01:45:18,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:45:18,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:18,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:18,522 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:45:18,523 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:45:18,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-01-10 01:45:18,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 01:45:18,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:45:18,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:18,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:45:18,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:18,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:19,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098414653] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:19,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:19,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 49 [2025-01-10 01:45:19,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759411991] [2025-01-10 01:45:19,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:19,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-01-10 01:45:19,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:19,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-01-10 01:45:19,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2028, Unknown=0, NotChecked=0, Total=2450 [2025-01-10 01:45:19,152 INFO L87 Difference]: Start difference. First operand 296 states and 321 transitions. Second operand has 50 states, 49 states have (on average 3.63265306122449) internal successors, (178), 50 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:45:19,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:19,595 INFO L93 Difference]: Finished difference Result 301 states and 321 transitions. [2025-01-10 01:45:19,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-10 01:45:19,595 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 3.63265306122449) internal successors, (178), 50 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:45:19,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:19,597 INFO L225 Difference]: With dead ends: 301 [2025-01-10 01:45:19,597 INFO L226 Difference]: Without dead ends: 300 [2025-01-10 01:45:19,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=692, Invalid=3340, Unknown=0, NotChecked=0, Total=4032 [2025-01-10 01:45:19,599 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 142 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:19,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 454 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:45:19,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-01-10 01:45:19,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2025-01-10 01:45:19,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 291 states have (on average 1.0618556701030928) internal successors, (309), 295 states have internal predecessors, (309), 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:45:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 309 transitions. [2025-01-10 01:45:19,610 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 309 transitions. Word has length 60 [2025-01-10 01:45:19,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:19,610 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 309 transitions. [2025-01-10 01:45:19,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.63265306122449) internal successors, (178), 50 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:45:19,610 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 309 transitions. [2025-01-10 01:45:19,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-10 01:45:19,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:19,611 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1] [2025-01-10 01:45:19,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-10 01:45:19,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 01:45:19,812 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:19,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1004105554, now seen corresponding path program 2 times [2025-01-10 01:45:19,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:19,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173540034] [2025-01-10 01:45:19,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:45:19,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:19,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-01-10 01:45:19,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 01:45:19,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:45:19,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:20,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:20,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173540034] [2025-01-10 01:45:20,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173540034] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:20,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137097019] [2025-01-10 01:45:20,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:45:20,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:20,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:20,453 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:45:20,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 01:45:20,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-01-10 01:45:20,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 01:45:20,515 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:45:20,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:20,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 01:45:20,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:21,255 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:21,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:22,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137097019] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:22,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:22,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 85 [2025-01-10 01:45:22,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190788991] [2025-01-10 01:45:22,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:22,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2025-01-10 01:45:22,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:22,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2025-01-10 01:45:22,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1096, Invalid=6214, Unknown=0, NotChecked=0, Total=7310 [2025-01-10 01:45:22,031 INFO L87 Difference]: Start difference. First operand 296 states and 309 transitions. Second operand has 86 states, 85 states have (on average 3.8588235294117648) internal successors, (328), 86 states have internal predecessors, (328), 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:45:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:23,859 INFO L93 Difference]: Finished difference Result 401 states and 427 transitions. [2025-01-10 01:45:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-01-10 01:45:23,859 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 3.8588235294117648) internal successors, (328), 86 states have internal predecessors, (328), 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 110 [2025-01-10 01:45:23,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:23,860 INFO L225 Difference]: With dead ends: 401 [2025-01-10 01:45:23,862 INFO L226 Difference]: Without dead ends: 400 [2025-01-10 01:45:23,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5392 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2375, Invalid=11905, Unknown=0, NotChecked=0, Total=14280 [2025-01-10 01:45:23,865 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 316 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:23,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 716 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:45:23,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-01-10 01:45:23,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 384. [2025-01-10 01:45:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 379 states have (on average 1.0949868073878628) internal successors, (415), 383 states have internal predecessors, (415), 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:45:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 415 transitions. [2025-01-10 01:45:23,887 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 415 transitions. Word has length 110 [2025-01-10 01:45:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:23,888 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 415 transitions. [2025-01-10 01:45:23,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 3.8588235294117648) internal successors, (328), 86 states have internal predecessors, (328), 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:45:23,889 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 415 transitions. [2025-01-10 01:45:23,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-10 01:45:23,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:23,890 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1] [2025-01-10 01:45:23,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-10 01:45:24,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-10 01:45:24,094 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:24,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:24,095 INFO L85 PathProgramCache]: Analyzing trace with hash 723296035, now seen corresponding path program 3 times [2025-01-10 01:45:24,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:24,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095813900] [2025-01-10 01:45:24,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:45:24,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:24,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 115 statements into 8 equivalence classes. [2025-01-10 01:45:24,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 115 of 115 statements. [2025-01-10 01:45:24,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-10 01:45:24,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:24,732 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:24,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:24,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095813900] [2025-01-10 01:45:24,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095813900] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:24,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784809428] [2025-01-10 01:45:24,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:45:24,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:24,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:24,734 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:45:24,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 01:45:24,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 115 statements into 8 equivalence classes. [2025-01-10 01:45:24,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 115 of 115 statements. [2025-01-10 01:45:24,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-10 01:45:24,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:24,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 01:45:24,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:25,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:26,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784809428] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:26,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:26,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 99 [2025-01-10 01:45:26,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410342983] [2025-01-10 01:45:26,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:26,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2025-01-10 01:45:26,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:26,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2025-01-10 01:45:26,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1614, Invalid=8286, Unknown=0, NotChecked=0, Total=9900 [2025-01-10 01:45:26,591 INFO L87 Difference]: Start difference. First operand 384 states and 415 transitions. Second operand has 100 states, 99 states have (on average 3.4343434343434343) internal successors, (340), 100 states have internal predecessors, (340), 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:45:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:28,687 INFO L93 Difference]: Finished difference Result 473 states and 501 transitions. [2025-01-10 01:45:28,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-01-10 01:45:28,687 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 99 states have (on average 3.4343434343434343) internal successors, (340), 100 states have internal predecessors, (340), 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 115 [2025-01-10 01:45:28,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:28,689 INFO L225 Difference]: With dead ends: 473 [2025-01-10 01:45:28,689 INFO L226 Difference]: Without dead ends: 471 [2025-01-10 01:45:28,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7788 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3263, Invalid=16477, Unknown=0, NotChecked=0, Total=19740 [2025-01-10 01:45:28,691 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 679 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:28,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 665 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:45:28,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-01-10 01:45:28,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 447. [2025-01-10 01:45:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 442 states have (on average 1.1018099547511313) internal successors, (487), 446 states have internal predecessors, (487), 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:45:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 487 transitions. [2025-01-10 01:45:28,700 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 487 transitions. Word has length 115 [2025-01-10 01:45:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:28,700 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 487 transitions. [2025-01-10 01:45:28,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 99 states have (on average 3.4343434343434343) internal successors, (340), 100 states have internal predecessors, (340), 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:45:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 487 transitions. [2025-01-10 01:45:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-10 01:45:28,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:28,701 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1] [2025-01-10 01:45:28,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-10 01:45:28,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:28,905 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:28,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:28,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1681026904, now seen corresponding path program 3 times [2025-01-10 01:45:28,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:28,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403700891] [2025-01-10 01:45:28,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:45:28,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:28,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 132 statements into 11 equivalence classes. [2025-01-10 01:45:28,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 132 of 132 statements. [2025-01-10 01:45:28,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:45:28,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:29,618 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:29,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:29,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403700891] [2025-01-10 01:45:29,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403700891] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:29,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095308496] [2025-01-10 01:45:29,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:45:29,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:29,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:29,622 INFO L229 MonitoredProcess]: Starting monitored process 18 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:45:29,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 01:45:29,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 132 statements into 11 equivalence classes. [2025-01-10 01:45:29,691 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 132 of 132 statements. [2025-01-10 01:45:29,691 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:45:29,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:29,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-10 01:45:29,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:30,768 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:30,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:32,111 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:32,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095308496] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:32,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:32,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 103 [2025-01-10 01:45:32,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893698473] [2025-01-10 01:45:32,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:32,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2025-01-10 01:45:32,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:32,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2025-01-10 01:45:32,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1547, Invalid=9165, Unknown=0, NotChecked=0, Total=10712 [2025-01-10 01:45:32,113 INFO L87 Difference]: Start difference. First operand 447 states and 487 transitions. Second operand has 104 states, 103 states have (on average 3.825242718446602) internal successors, (394), 104 states have internal predecessors, (394), 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:45:33,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:33,846 INFO L93 Difference]: Finished difference Result 610 states and 674 transitions. [2025-01-10 01:45:33,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-01-10 01:45:33,846 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 103 states have (on average 3.825242718446602) internal successors, (394), 104 states have internal predecessors, (394), 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 132 [2025-01-10 01:45:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:33,853 INFO L225 Difference]: With dead ends: 610 [2025-01-10 01:45:33,853 INFO L226 Difference]: Without dead ends: 609 [2025-01-10 01:45:33,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7249 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2765, Invalid=15595, Unknown=0, NotChecked=0, Total=18360 [2025-01-10 01:45:33,856 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 872 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:33,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 790 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:45:33,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-01-10 01:45:33,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 586. [2025-01-10 01:45:33,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 581 states have (on average 1.1187607573149743) internal successors, (650), 585 states have internal predecessors, (650), 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:45:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 650 transitions. [2025-01-10 01:45:33,891 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 650 transitions. Word has length 132 [2025-01-10 01:45:33,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:33,895 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 650 transitions. [2025-01-10 01:45:33,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 103 states have (on average 3.825242718446602) internal successors, (394), 104 states have internal predecessors, (394), 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:45:33,896 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 650 transitions. [2025-01-10 01:45:33,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-10 01:45:33,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:33,898 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1] [2025-01-10 01:45:33,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-10 01:45:34,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:34,099 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:34,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:34,100 INFO L85 PathProgramCache]: Analyzing trace with hash 723933872, now seen corresponding path program 3 times [2025-01-10 01:45:34,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:34,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583530536] [2025-01-10 01:45:34,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:45:34,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:34,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 140 statements into 12 equivalence classes. [2025-01-10 01:45:34,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 56 of 140 statements. [2025-01-10 01:45:34,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-10 01:45:34,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 344 proven. 63 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2025-01-10 01:45:34,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:34,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583530536] [2025-01-10 01:45:34,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583530536] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:34,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148995346] [2025-01-10 01:45:34,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:45:34,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:34,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:34,314 INFO L229 MonitoredProcess]: Starting monitored process 19 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:45:34,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 01:45:34,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 140 statements into 12 equivalence classes. [2025-01-10 01:45:34,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 56 of 140 statements. [2025-01-10 01:45:34,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-10 01:45:34,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:34,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:45:34,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 344 proven. 63 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2025-01-10 01:45:34,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 344 proven. 63 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2025-01-10 01:45:34,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148995346] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:34,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:34,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-01-10 01:45:34,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591659853] [2025-01-10 01:45:34,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:34,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:45:34,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:34,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:45:34,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:45:34,597 INFO L87 Difference]: Start difference. First operand 586 states and 650 transitions. Second operand has 22 states, 21 states have (on average 5.095238095238095) internal successors, (107), 22 states have internal predecessors, (107), 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:45:34,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:34,709 INFO L93 Difference]: Finished difference Result 586 states and 650 transitions. [2025-01-10 01:45:34,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:45:34,709 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.095238095238095) internal successors, (107), 22 states have internal predecessors, (107), 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 140 [2025-01-10 01:45:34,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:34,712 INFO L225 Difference]: With dead ends: 586 [2025-01-10 01:45:34,712 INFO L226 Difference]: Without dead ends: 585 [2025-01-10 01:45:34,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2025-01-10 01:45:34,712 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 65 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:34,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 113 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:34,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-01-10 01:45:34,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2025-01-10 01:45:34,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.0774526678141136) internal successors, (626), 584 states have internal predecessors, (626), 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:45:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 626 transitions. [2025-01-10 01:45:34,730 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 626 transitions. Word has length 140 [2025-01-10 01:45:34,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:34,730 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 626 transitions. [2025-01-10 01:45:34,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.095238095238095) internal successors, (107), 22 states have internal predecessors, (107), 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:45:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 626 transitions. [2025-01-10 01:45:34,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-10 01:45:34,732 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:34,732 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1] [2025-01-10 01:45:34,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-10 01:45:34,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-10 01:45:34,936 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:34,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:34,937 INFO L85 PathProgramCache]: Analyzing trace with hash -84249230, now seen corresponding path program 3 times [2025-01-10 01:45:34,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:34,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011556709] [2025-01-10 01:45:34,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:45:34,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:34,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 142 statements into 12 equivalence classes. [2025-01-10 01:45:34,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 58 of 142 statements. [2025-01-10 01:45:34,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-10 01:45:34,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 352 proven. 63 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-01-10 01:45:35,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:35,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011556709] [2025-01-10 01:45:35,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011556709] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:35,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17192015] [2025-01-10 01:45:35,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:45:35,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:35,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:35,068 INFO L229 MonitoredProcess]: Starting monitored process 20 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:45:35,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-10 01:45:35,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 142 statements into 12 equivalence classes. [2025-01-10 01:45:35,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 58 of 142 statements. [2025-01-10 01:45:35,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-10 01:45:35,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:35,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:45:35,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:35,169 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 352 proven. 63 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-01-10 01:45:35,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 352 proven. 63 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-01-10 01:45:35,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17192015] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:35,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:35,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-01-10 01:45:35,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643319442] [2025-01-10 01:45:35,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:35,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:45:35,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:35,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:45:35,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:45:35,351 INFO L87 Difference]: Start difference. First operand 585 states and 626 transitions. Second operand has 22 states, 21 states have (on average 5.095238095238095) internal successors, (107), 22 states have internal predecessors, (107), 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:45:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:35,459 INFO L93 Difference]: Finished difference Result 585 states and 626 transitions. [2025-01-10 01:45:35,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:45:35,460 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.095238095238095) internal successors, (107), 22 states have internal predecessors, (107), 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 142 [2025-01-10 01:45:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:35,461 INFO L225 Difference]: With dead ends: 585 [2025-01-10 01:45:35,461 INFO L226 Difference]: Without dead ends: 584 [2025-01-10 01:45:35,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2025-01-10 01:45:35,466 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:35,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 72 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:45:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-01-10 01:45:35,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2025-01-10 01:45:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 581 states have (on average 1.036144578313253) internal successors, (602), 583 states have internal predecessors, (602), 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:45:35,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 602 transitions. [2025-01-10 01:45:35,483 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 602 transitions. Word has length 142 [2025-01-10 01:45:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:35,484 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 602 transitions. [2025-01-10 01:45:35,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.095238095238095) internal successors, (107), 22 states have internal predecessors, (107), 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:45:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 602 transitions. [2025-01-10 01:45:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-01-10 01:45:35,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:35,485 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1] [2025-01-10 01:45:35,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-01-10 01:45:35,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:35,690 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:35,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1805165758, now seen corresponding path program 2 times [2025-01-10 01:45:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:35,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443174104] [2025-01-10 01:45:35,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:45:35,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:35,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 224 statements into 2 equivalence classes. [2025-01-10 01:45:35,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 224 of 224 statements. [2025-01-10 01:45:35,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:45:35,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:37,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1635 backedges. 0 proven. 1635 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:37,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:37,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443174104] [2025-01-10 01:45:37,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443174104] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:37,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763735883] [2025-01-10 01:45:37,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:45:37,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:37,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:37,405 INFO L229 MonitoredProcess]: Starting monitored process 21 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:45:37,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-10 01:45:37,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 224 statements into 2 equivalence classes. [2025-01-10 01:45:37,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 224 of 224 statements. [2025-01-10 01:45:37,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:45:37,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:37,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-01-10 01:45:37,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1635 backedges. 0 proven. 1635 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:40,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:43,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1635 backedges. 0 proven. 1635 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:43,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763735883] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:43,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:43,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 193 [2025-01-10 01:45:43,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830137228] [2025-01-10 01:45:43,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:43,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 194 states [2025-01-10 01:45:43,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:43,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2025-01-10 01:45:43,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5527, Invalid=31915, Unknown=0, NotChecked=0, Total=37442 [2025-01-10 01:45:43,123 INFO L87 Difference]: Start difference. First operand 584 states and 602 transitions. Second operand has 194 states, 193 states have (on average 3.471502590673575) internal successors, (670), 194 states have internal predecessors, (670), 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:45:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:45:49,695 INFO L93 Difference]: Finished difference Result 846 states and 901 transitions. [2025-01-10 01:45:49,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2025-01-10 01:45:49,696 INFO L78 Accepts]: Start accepts. Automaton has has 194 states, 193 states have (on average 3.471502590673575) internal successors, (670), 194 states have internal predecessors, (670), 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 224 [2025-01-10 01:45:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:45:49,698 INFO L225 Difference]: With dead ends: 846 [2025-01-10 01:45:49,698 INFO L226 Difference]: Without dead ends: 845 [2025-01-10 01:45:49,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27906 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=10228, Invalid=54542, Unknown=0, NotChecked=0, Total=64770 [2025-01-10 01:45:49,701 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1381 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 01:45:49,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 1157 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 01:45:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-01-10 01:45:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 834. [2025-01-10 01:45:49,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 831 states have (on average 1.0481347773766547) internal successors, (871), 833 states have internal predecessors, (871), 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:45:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 871 transitions. [2025-01-10 01:45:49,724 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 871 transitions. Word has length 224 [2025-01-10 01:45:49,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:45:49,724 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 871 transitions. [2025-01-10 01:45:49,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 194 states, 193 states have (on average 3.471502590673575) internal successors, (670), 194 states have internal predecessors, (670), 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:45:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 871 transitions. [2025-01-10 01:45:49,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-10 01:45:49,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:45:49,726 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 1, 1, 1, 1] [2025-01-10 01:45:49,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-01-10 01:45:49,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:49,927 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:45:49,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:45:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash -407516765, now seen corresponding path program 4 times [2025-01-10 01:45:49,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:45:49,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18682223] [2025-01-10 01:45:49,927 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:45:49,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:45:49,936 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 227 statements into 2 equivalence classes. [2025-01-10 01:45:49,966 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 227 of 227 statements. [2025-01-10 01:45:49,966 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:45:49,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:51,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1680 backedges. 0 proven. 1680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:51,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:45:51,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18682223] [2025-01-10 01:45:51,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18682223] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:45:51,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074517058] [2025-01-10 01:45:51,733 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:45:51,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:45:51,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:45:51,737 INFO L229 MonitoredProcess]: Starting monitored process 22 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:45:51,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-10 01:45:51,780 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 227 statements into 2 equivalence classes. [2025-01-10 01:45:51,817 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 227 of 227 statements. [2025-01-10 01:45:51,817 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:45:51,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:45:51,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-01-10 01:45:51,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:45:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1680 backedges. 0 proven. 1680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:54,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:45:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1680 backedges. 0 proven. 1680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:45:57,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074517058] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:45:57,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:45:57,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 195 [2025-01-10 01:45:57,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392552656] [2025-01-10 01:45:57,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:45:57,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 196 states [2025-01-10 01:45:57,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:45:57,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2025-01-10 01:45:57,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=32558, Unknown=0, NotChecked=0, Total=38220 [2025-01-10 01:45:57,439 INFO L87 Difference]: Start difference. First operand 834 states and 871 transitions. Second operand has 196 states, 195 states have (on average 3.466666666666667) internal successors, (676), 196 states have internal predecessors, (676), 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:46:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:46:07,194 INFO L93 Difference]: Finished difference Result 870 states and 889 transitions. [2025-01-10 01:46:07,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2025-01-10 01:46:07,195 INFO L78 Accepts]: Start accepts. Automaton has has 196 states, 195 states have (on average 3.466666666666667) internal successors, (676), 196 states have internal predecessors, (676), 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 227 [2025-01-10 01:46:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:46:07,209 INFO L225 Difference]: With dead ends: 870 [2025-01-10 01:46:07,209 INFO L226 Difference]: Without dead ends: 869 [2025-01-10 01:46:07,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32709 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=12523, Invalid=68417, Unknown=0, NotChecked=0, Total=80940 [2025-01-10 01:46:07,217 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 2578 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2578 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 01:46:07,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2578 Valid, 1162 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 01:46:07,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-01-10 01:46:07,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 837. [2025-01-10 01:46:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 834 states have (on average 1.0299760191846523) internal successors, (859), 836 states have internal predecessors, (859), 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:46:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 859 transitions. [2025-01-10 01:46:07,278 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 859 transitions. Word has length 227 [2025-01-10 01:46:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:46:07,278 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 859 transitions. [2025-01-10 01:46:07,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 196 states, 195 states have (on average 3.466666666666667) internal successors, (676), 196 states have internal predecessors, (676), 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:46:07,282 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 859 transitions. [2025-01-10 01:46:07,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-01-10 01:46:07,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:46:07,285 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1] [2025-01-10 01:46:07,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-01-10 01:46:07,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-01-10 01:46:07,489 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:46:07,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:46:07,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1530873656, now seen corresponding path program 4 times [2025-01-10 01:46:07,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:46:07,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210763547] [2025-01-10 01:46:07,490 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:46:07,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:46:07,499 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 276 statements into 2 equivalence classes. [2025-01-10 01:46:07,543 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 276 of 276 statements. [2025-01-10 01:46:07,543 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:46:07,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:46:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:46:10,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:46:10,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210763547] [2025-01-10 01:46:10,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210763547] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:46:10,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141713258] [2025-01-10 01:46:10,485 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:46:10,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:46:10,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:46:10,487 INFO L229 MonitoredProcess]: Starting monitored process 23 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:46:10,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-10 01:46:10,540 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 276 statements into 2 equivalence classes. [2025-01-10 01:46:10,586 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 276 of 276 statements. [2025-01-10 01:46:10,586 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:46:10,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:46:10,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-01-10 01:46:10,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:46:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:46:13,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:46:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:46:17,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141713258] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:46:17,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:46:17,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 211 [2025-01-10 01:46:17,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135332934] [2025-01-10 01:46:17,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:46:17,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 212 states [2025-01-10 01:46:17,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:46:17,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2025-01-10 01:46:17,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5849, Invalid=38883, Unknown=0, NotChecked=0, Total=44732 [2025-01-10 01:46:17,259 INFO L87 Difference]: Start difference. First operand 837 states and 859 transitions. Second operand has 212 states, 211 states have (on average 3.914691943127962) internal successors, (826), 212 states have internal predecessors, (826), 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:46:26,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:46:26,678 INFO L93 Difference]: Finished difference Result 1237 states and 1300 transitions. [2025-01-10 01:46:26,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2025-01-10 01:46:26,678 INFO L78 Accepts]: Start accepts. Automaton has has 212 states, 211 states have (on average 3.914691943127962) internal successors, (826), 212 states have internal predecessors, (826), 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 276 [2025-01-10 01:46:26,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:46:26,682 INFO L225 Difference]: With dead ends: 1237 [2025-01-10 01:46:26,682 INFO L226 Difference]: Without dead ends: 1236 [2025-01-10 01:46:26,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31717 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=11015, Invalid=67105, Unknown=0, NotChecked=0, Total=78120 [2025-01-10 01:46:26,685 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 3501 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3501 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 01:46:26,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3501 Valid, 1457 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 01:46:26,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2025-01-10 01:46:26,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1208. [2025-01-10 01:46:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 1205 states have (on average 1.0390041493775934) internal successors, (1252), 1207 states have internal predecessors, (1252), 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:46:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1252 transitions. [2025-01-10 01:46:26,725 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1252 transitions. Word has length 276 [2025-01-10 01:46:26,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:46:26,726 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1252 transitions. [2025-01-10 01:46:26,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 212 states, 211 states have (on average 3.914691943127962) internal successors, (826), 212 states have internal predecessors, (826), 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:46:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1252 transitions. [2025-01-10 01:46:26,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-01-10 01:46:26,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:46:26,731 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 1, 1, 1, 1] [2025-01-10 01:46:26,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-01-10 01:46:26,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-01-10 01:46:26,932 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:46:26,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:46:26,932 INFO L85 PathProgramCache]: Analyzing trace with hash 177951858, now seen corresponding path program 3 times [2025-01-10 01:46:26,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:46:26,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100842365] [2025-01-10 01:46:26,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:46:26,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:46:26,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 398 statements into 33 equivalence classes. [2025-01-10 01:46:27,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) and asserted 398 of 398 statements. [2025-01-10 01:46:27,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2025-01-10 01:46:27,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:46:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6304 backedges. 0 proven. 6304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:46:32,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:46:32,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100842365] [2025-01-10 01:46:32,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100842365] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:46:32,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406490952] [2025-01-10 01:46:32,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:46:32,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:46:32,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:46:32,870 INFO L229 MonitoredProcess]: Starting monitored process 24 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:46:32,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-01-10 01:46:32,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 398 statements into 33 equivalence classes. [2025-01-10 01:46:33,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) and asserted 398 of 398 statements. [2025-01-10 01:46:33,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2025-01-10 01:46:33,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:46:33,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-01-10 01:46:33,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:46:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6304 backedges. 0 proven. 6304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:46:39,770 INFO L312 TraceCheckSpWp]: Computing backward predicates...