./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted-lit/GopanReps-CAV2006-Fig1a.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 06d48bd39a18f705c3286a70a8cdcced2226e3b2a16c7a38c85f5398d4bcad34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:30:05,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:30:05,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 01:30:05,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:30:05,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:30:05,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:30:05,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:30:05,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:30:05,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:30:05,975 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:30:05,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:30:05,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:30:05,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:30:05,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:30:05,976 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:30:05,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:30:05,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:30:05,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:30:05,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:30:05,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:30:05,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:30:05,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:30:05,977 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:30:05,977 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:30:05,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:30:05,978 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:30:05,978 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:30:05,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:30:05,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:30:05,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:30:05,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:30:05,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:30:05,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:30:05,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:30:05,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:30:05,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:30:05,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:30:05,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:30:05,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:30:05,979 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:30:05,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:30:05,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:30:05,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:30:05,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:30:05,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:30:05,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:30:05,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:30:05,980 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 06d48bd39a18f705c3286a70a8cdcced2226e3b2a16c7a38c85f5398d4bcad34 [2025-01-10 01:30:06,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:30:06,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:30:06,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:30:06,196 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:30:06,197 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:30:06,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a.c [2025-01-10 01:30:07,331 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/637d5f0ff/daafb2abbe9b490090ca2e4ed365bcf9/FLAG1c99ee0b5 [2025-01-10 01:30:07,548 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:30:07,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a.c [2025-01-10 01:30:07,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/637d5f0ff/daafb2abbe9b490090ca2e4ed365bcf9/FLAG1c99ee0b5 [2025-01-10 01:30:07,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/637d5f0ff/daafb2abbe9b490090ca2e4ed365bcf9 [2025-01-10 01:30:07,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:30:07,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:30:07,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:30:07,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:30:07,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:30:07,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:30:07" (1/1) ... [2025-01-10 01:30:07,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12aae2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:07, skipping insertion in model container [2025-01-10 01:30:07,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:30:07" (1/1) ... [2025-01-10 01:30:07,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:30:08,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:30:08,020 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:30:08,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:30:08,038 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:30:08,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:08 WrapperNode [2025-01-10 01:30:08,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:30:08,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:30:08,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:30:08,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:30:08,046 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:30:08" (1/1) ... [2025-01-10 01:30:08,048 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:30:08" (1/1) ... [2025-01-10 01:30:08,057 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2025-01-10 01:30:08,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:30:08,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:30:08,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:30:08,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:30:08,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:08" (1/1) ... [2025-01-10 01:30:08,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:08" (1/1) ... [2025-01-10 01:30:08,065 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:08" (1/1) ... [2025-01-10 01:30:08,068 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 01:30:08,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:08" (1/1) ... [2025-01-10 01:30:08,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:08" (1/1) ... [2025-01-10 01:30:08,073 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:08" (1/1) ... [2025-01-10 01:30:08,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:08" (1/1) ... [2025-01-10 01:30:08,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:08" (1/1) ... [2025-01-10 01:30:08,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:08" (1/1) ... [2025-01-10 01:30:08,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:08" (1/1) ... [2025-01-10 01:30:08,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:30:08,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:30:08,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:30:08,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:30:08,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:08" (1/1) ... [2025-01-10 01:30:08,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:30:08,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:08,108 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:30:08,116 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:30:08,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:30:08,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:30:08,177 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:30:08,178 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:30:08,230 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-10 01:30:08,230 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:30:08,235 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:30:08,235 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:30:08,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:30:08 BoogieIcfgContainer [2025-01-10 01:30:08,236 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:30:08,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:30:08,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:30:08,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:30:08,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:30:07" (1/3) ... [2025-01-10 01:30:08,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431e575d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:30:08, skipping insertion in model container [2025-01-10 01:30:08,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:30:08" (2/3) ... [2025-01-10 01:30:08,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431e575d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:30:08, skipping insertion in model container [2025-01-10 01:30:08,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:30:08" (3/3) ... [2025-01-10 01:30:08,244 INFO L128 eAbstractionObserver]: Analyzing ICFG GopanReps-CAV2006-Fig1a.c [2025-01-10 01:30:08,253 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:30:08,255 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG GopanReps-CAV2006-Fig1a.c that has 1 procedures, 19 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-01-10 01:30:08,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:30:08,295 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;@18c51420, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:30:08,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:30:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 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:30:08,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:30:08,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:08,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:30:08,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:08,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:08,310 INFO L85 PathProgramCache]: Analyzing trace with hash 28694788, now seen corresponding path program 1 times [2025-01-10 01:30:08,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:08,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237404246] [2025-01-10 01:30:08,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:08,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:08,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:30:08,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:30:08,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:08,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:08,426 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:30:08,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:08,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237404246] [2025-01-10 01:30:08,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237404246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:08,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:08,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:30:08,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414698553] [2025-01-10 01:30:08,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:08,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:30:08,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:08,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:30:08,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:30:08,444 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 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 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:08,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:08,471 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2025-01-10 01:30:08,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:30:08,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 01:30:08,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:08,476 INFO L225 Difference]: With dead ends: 27 [2025-01-10 01:30:08,476 INFO L226 Difference]: Without dead ends: 19 [2025-01-10 01:30:08,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:30:08,480 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:08,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 17 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:08,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-01-10 01:30:08,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2025-01-10 01:30:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.5) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-01-10 01:30:08,498 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 5 [2025-01-10 01:30:08,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:08,498 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-01-10 01:30:08,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2025-01-10 01:30:08,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:30:08,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:08,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:30:08,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:30:08,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:08,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:08,500 INFO L85 PathProgramCache]: Analyzing trace with hash 889538471, now seen corresponding path program 1 times [2025-01-10 01:30:08,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:08,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519188584] [2025-01-10 01:30:08,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:08,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:08,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:30:08,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:30:08,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:08,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:08,518 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:30:08,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:08,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519188584] [2025-01-10 01:30:08,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519188584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:08,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:08,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:30:08,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293245109] [2025-01-10 01:30:08,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:08,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:30:08,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:08,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:30:08,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:30:08,521 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:08,552 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2025-01-10 01:30:08,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:30:08,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 01:30:08,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:08,553 INFO L225 Difference]: With dead ends: 26 [2025-01-10 01:30:08,553 INFO L226 Difference]: Without dead ends: 24 [2025-01-10 01:30:08,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:30:08,554 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:08,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:08,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-10 01:30:08,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-01-10 01:30:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 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:30:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-01-10 01:30:08,557 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 6 [2025-01-10 01:30:08,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:08,558 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-01-10 01:30:08,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:08,558 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-01-10 01:30:08,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:30:08,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:08,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:08,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:30:08,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:08,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1805888877, now seen corresponding path program 1 times [2025-01-10 01:30:08,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:08,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483677728] [2025-01-10 01:30:08,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:08,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:08,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:30:08,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:30:08,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:08,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:08,586 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:30:08,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:08,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483677728] [2025-01-10 01:30:08,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483677728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:08,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:08,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:30:08,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731206165] [2025-01-10 01:30:08,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:08,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:30:08,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:08,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:30:08,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:30:08,587 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:08,601 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2025-01-10 01:30:08,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:30:08,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:30:08,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:08,603 INFO L225 Difference]: With dead ends: 22 [2025-01-10 01:30:08,603 INFO L226 Difference]: Without dead ends: 21 [2025-01-10 01:30:08,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:30:08,604 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:08,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:08,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-01-10 01:30:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-01-10 01:30:08,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 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:30:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2025-01-10 01:30:08,607 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2025-01-10 01:30:08,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:08,607 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2025-01-10 01:30:08,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2025-01-10 01:30:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:30:08,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:08,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:08,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:30:08,608 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:08,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:08,608 INFO L85 PathProgramCache]: Analyzing trace with hash 147980393, now seen corresponding path program 1 times [2025-01-10 01:30:08,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:08,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479820923] [2025-01-10 01:30:08,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:08,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:08,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:30:08,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:30:08,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:08,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:08,646 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:30:08,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:08,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479820923] [2025-01-10 01:30:08,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479820923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:08,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:08,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:30:08,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967892508] [2025-01-10 01:30:08,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:08,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:30:08,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:08,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:30:08,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:30:08,648 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:08,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:08,660 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2025-01-10 01:30:08,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:30:08,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:30:08,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:08,660 INFO L225 Difference]: With dead ends: 38 [2025-01-10 01:30:08,660 INFO L226 Difference]: Without dead ends: 19 [2025-01-10 01:30:08,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:30:08,661 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:08,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-01-10 01:30:08,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-01-10 01:30:08,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 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:30:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-01-10 01:30:08,663 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 8 [2025-01-10 01:30:08,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:08,663 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-01-10 01:30:08,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:08,664 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-01-10 01:30:08,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:30:08,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:08,664 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:08,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:30:08,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:08,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:08,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1437243598, now seen corresponding path program 1 times [2025-01-10 01:30:08,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:08,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737717760] [2025-01-10 01:30:08,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:08,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:08,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:30:08,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:30:08,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:08,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:08,705 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:30:08,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:08,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737717760] [2025-01-10 01:30:08,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737717760] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:08,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227722518] [2025-01-10 01:30:08,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:08,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:08,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:08,707 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:30:08,709 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:30:08,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:30:08,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:30:08,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:08,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:08,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:30:08,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:08,781 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:30:08,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:08,826 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:30:08,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227722518] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:08,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:08,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:30:08,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622808396] [2025-01-10 01:30:08,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:08,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:30:08,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:08,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:30:08,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:30:08,827 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:30:08,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:08,872 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2025-01-10 01:30:08,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:30:08,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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 12 [2025-01-10 01:30:08,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:08,873 INFO L225 Difference]: With dead ends: 57 [2025-01-10 01:30:08,873 INFO L226 Difference]: Without dead ends: 55 [2025-01-10 01:30:08,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:30:08,873 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:08,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 35 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:08,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-10 01:30:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2025-01-10 01:30:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 0 states have call successors, (0), 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:30:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2025-01-10 01:30:08,878 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 12 [2025-01-10 01:30:08,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:08,878 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2025-01-10 01:30:08,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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:30:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2025-01-10 01:30:08,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:30:08,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:08,878 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:30:08,887 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:30:09,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:09,079 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:09,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:09,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1788369968, now seen corresponding path program 1 times [2025-01-10 01:30:09,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:09,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245007002] [2025-01-10 01:30:09,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:09,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:09,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:30:09,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:30:09,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:09,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:30:09,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:09,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245007002] [2025-01-10 01:30:09,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245007002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:09,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:09,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:30:09,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974184226] [2025-01-10 01:30:09,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:09,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:30:09,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:09,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:30:09,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:30:09,112 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:09,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:09,126 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2025-01-10 01:30:09,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:30:09,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-10 01:30:09,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:09,126 INFO L225 Difference]: With dead ends: 52 [2025-01-10 01:30:09,126 INFO L226 Difference]: Without dead ends: 51 [2025-01-10 01:30:09,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:30:09,127 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:09,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 16 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:09,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-10 01:30:09,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2025-01-10 01:30:09,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 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:30:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2025-01-10 01:30:09,132 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 14 [2025-01-10 01:30:09,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:09,132 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2025-01-10 01:30:09,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:09,132 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2025-01-10 01:30:09,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:30:09,133 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:09,133 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:30:09,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:30:09,133 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:09,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:09,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1782644330, now seen corresponding path program 1 times [2025-01-10 01:30:09,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:09,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181670240] [2025-01-10 01:30:09,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:09,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:09,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:30:09,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:30:09,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:09,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:09,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:09,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181670240] [2025-01-10 01:30:09,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181670240] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:09,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860817967] [2025-01-10 01:30:09,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:30:09,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:09,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:09,176 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:30:09,178 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:30:09,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:30:09,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:30:09,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:09,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:09,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:30:09,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:09,221 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:30:09,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:09,255 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:30:09,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860817967] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:09,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:09,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2025-01-10 01:30:09,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444298259] [2025-01-10 01:30:09,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:09,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:30:09,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:09,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:30:09,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:30:09,271 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:09,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:09,306 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2025-01-10 01:30:09,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:30:09,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-10 01:30:09,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:09,308 INFO L225 Difference]: With dead ends: 103 [2025-01-10 01:30:09,308 INFO L226 Difference]: Without dead ends: 60 [2025-01-10 01:30:09,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:30:09,308 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:09,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 32 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:09,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-10 01:30:09,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2025-01-10 01:30:09,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 58 states have internal predecessors, (67), 0 states have call successors, (0), 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:30:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2025-01-10 01:30:09,314 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 14 [2025-01-10 01:30:09,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:09,314 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2025-01-10 01:30:09,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2025-01-10 01:30:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 01:30:09,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:09,315 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1] [2025-01-10 01:30:09,321 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:30:09,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:09,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:09,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:09,516 INFO L85 PathProgramCache]: Analyzing trace with hash 164885699, now seen corresponding path program 2 times [2025-01-10 01:30:09,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:09,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966030453] [2025-01-10 01:30:09,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:30:09,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:09,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 01:30:09,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:30:09,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:30:09,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:09,630 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:09,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:09,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966030453] [2025-01-10 01:30:09,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966030453] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:09,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642554043] [2025-01-10 01:30:09,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:30:09,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:09,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:09,634 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:30:09,636 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:30:09,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 01:30:09,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:30:09,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:30:09,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:09,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:30:09,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:09,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:09,796 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:09,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642554043] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:09,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:09,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 01:30:09,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712476826] [2025-01-10 01:30:09,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:09,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:30:09,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:09,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:30:09,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:30:09,798 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 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:30:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:09,894 INFO L93 Difference]: Finished difference Result 235 states and 290 transitions. [2025-01-10 01:30:09,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:30:09,897 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 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 30 [2025-01-10 01:30:09,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:09,898 INFO L225 Difference]: With dead ends: 235 [2025-01-10 01:30:09,898 INFO L226 Difference]: Without dead ends: 233 [2025-01-10 01:30:09,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:30:09,898 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 54 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:09,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:30:09,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-01-10 01:30:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 165. [2025-01-10 01:30:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 162 states have (on average 1.1851851851851851) internal successors, (192), 164 states have internal predecessors, (192), 0 states have call successors, (0), 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:30:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2025-01-10 01:30:09,908 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 30 [2025-01-10 01:30:09,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:09,909 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2025-01-10 01:30:09,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 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:30:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2025-01-10 01:30:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 01:30:09,909 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:09,909 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1] [2025-01-10 01:30:09,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:30:10,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:10,110 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:10,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:10,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1783585391, now seen corresponding path program 2 times [2025-01-10 01:30:10,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:10,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708767248] [2025-01-10 01:30:10,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:30:10,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:10,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-01-10 01:30:10,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:30:10,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:30:10,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:30:10,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:10,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708767248] [2025-01-10 01:30:10,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708767248] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:10,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112339322] [2025-01-10 01:30:10,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:30:10,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:10,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:10,169 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:30:10,170 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:30:10,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-01-10 01:30:10,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:30:10,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:30:10,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:10,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:30:10,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:30:10,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:30:10,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112339322] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:10,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:10,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-01-10 01:30:10,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976946496] [2025-01-10 01:30:10,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:10,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:30:10,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:10,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:30:10,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:30:10,281 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:10,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:10,307 INFO L93 Difference]: Finished difference Result 276 states and 322 transitions. [2025-01-10 01:30:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:30:10,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-01-10 01:30:10,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:10,309 INFO L225 Difference]: With dead ends: 276 [2025-01-10 01:30:10,309 INFO L226 Difference]: Without dead ends: 127 [2025-01-10 01:30:10,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:30:10,310 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:10,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 44 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:10,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-10 01:30:10,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-01-10 01:30:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 126 states have internal predecessors, (141), 0 states have call successors, (0), 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:30:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2025-01-10 01:30:10,319 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 32 [2025-01-10 01:30:10,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:10,319 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2025-01-10 01:30:10,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:30:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2025-01-10 01:30:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-10 01:30:10,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:10,320 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 8, 8, 8, 2, 2, 2, 1, 1, 1] [2025-01-10 01:30:10,326 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:30:10,520 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,SelfDestructingSolverStorable8 [2025-01-10 01:30:10,521 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:10,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:10,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1909489388, now seen corresponding path program 3 times [2025-01-10 01:30:10,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:10,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490466306] [2025-01-10 01:30:10,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:30:10,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:10,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 10 equivalence classes. [2025-01-10 01:30:10,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 26 of 62 statements. [2025-01-10 01:30:10,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 01:30:10,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:10,579 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 88 proven. 10 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-10 01:30:10,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:10,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490466306] [2025-01-10 01:30:10,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490466306] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:10,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133825031] [2025-01-10 01:30:10,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:30:10,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:10,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:10,581 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:30:10,599 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:30:10,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 62 statements into 10 equivalence classes. [2025-01-10 01:30:10,622 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 26 of 62 statements. [2025-01-10 01:30:10,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 01:30:10,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:10,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:30:10,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 88 proven. 10 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-10 01:30:10,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:10,680 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 88 proven. 10 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-10 01:30:10,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133825031] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:10,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:10,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 01:30:10,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155150754] [2025-01-10 01:30:10,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:10,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:30:10,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:10,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:30:10,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:30:10,681 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 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:30:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:10,707 INFO L93 Difference]: Finished difference Result 191 states and 223 transitions. [2025-01-10 01:30:10,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:30:10,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 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) Word has length 62 [2025-01-10 01:30:10,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:10,709 INFO L225 Difference]: With dead ends: 191 [2025-01-10 01:30:10,709 INFO L226 Difference]: Without dead ends: 190 [2025-01-10 01:30:10,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:30:10,710 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:10,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 36 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:10,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-10 01:30:10,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 185. [2025-01-10 01:30:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 182 states have (on average 1.164835164835165) internal successors, (212), 184 states have internal predecessors, (212), 0 states have call successors, (0), 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:30:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 212 transitions. [2025-01-10 01:30:10,724 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 212 transitions. Word has length 62 [2025-01-10 01:30:10,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:10,724 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 212 transitions. [2025-01-10 01:30:10,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 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:30:10,724 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 212 transitions. [2025-01-10 01:30:10,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 01:30:10,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:10,725 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 1, 1, 1] [2025-01-10 01:30:10,731 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:30:10,929 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,SelfDestructingSolverStorable9 [2025-01-10 01:30:10,929 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:10,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:10,929 INFO L85 PathProgramCache]: Analyzing trace with hash -704552211, now seen corresponding path program 3 times [2025-01-10 01:30:10,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:10,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604401478] [2025-01-10 01:30:10,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:30:10,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:10,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 11 equivalence classes. [2025-01-10 01:30:10,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 01:30:10,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:30:10,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:11,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:11,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604401478] [2025-01-10 01:30:11,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604401478] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:11,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008663832] [2025-01-10 01:30:11,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:30:11,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:11,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:11,116 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:30:11,118 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:30:11,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 11 equivalence classes. [2025-01-10 01:30:11,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 01:30:11,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 01:30:11,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:11,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:30:11,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:11,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:11,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008663832] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:11,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:11,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-01-10 01:30:11,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945092847] [2025-01-10 01:30:11,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:11,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 01:30:11,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:11,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 01:30:11,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:30:11,450 INFO L87 Difference]: Start difference. First operand 185 states and 212 transitions. Second operand has 24 states, 23 states have (on average 5.695652173913044) internal successors, (131), 24 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:30:11,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:11,623 INFO L93 Difference]: Finished difference Result 1343 states and 1669 transitions. [2025-01-10 01:30:11,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:30:11,624 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.695652173913044) internal successors, (131), 24 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) Word has length 66 [2025-01-10 01:30:11,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:11,629 INFO L225 Difference]: With dead ends: 1343 [2025-01-10 01:30:11,629 INFO L226 Difference]: Without dead ends: 1341 [2025-01-10 01:30:11,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:30:11,631 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 107 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:11,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 135 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:30:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2025-01-10 01:30:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 737. [2025-01-10 01:30:11,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 734 states have (on average 1.1702997275204359) internal successors, (859), 736 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:30:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 859 transitions. [2025-01-10 01:30:11,659 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 859 transitions. Word has length 66 [2025-01-10 01:30:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:11,659 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 859 transitions. [2025-01-10 01:30:11,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.695652173913044) internal successors, (131), 24 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:30:11,660 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 859 transitions. [2025-01-10 01:30:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-10 01:30:11,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:11,663 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 8, 8, 8, 6, 6, 6, 1, 1, 1] [2025-01-10 01:30:11,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:30:11,863 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,SelfDestructingSolverStorable10 [2025-01-10 01:30:11,864 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:11,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:11,864 INFO L85 PathProgramCache]: Analyzing trace with hash -12701112, now seen corresponding path program 4 times [2025-01-10 01:30:11,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:11,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332825044] [2025-01-10 01:30:11,864 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:30:11,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:11,869 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 86 statements into 2 equivalence classes. [2025-01-10 01:30:11,880 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 01:30:11,880 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:30:11,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:12,001 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 186 proven. 184 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-10 01:30:12,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:12,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332825044] [2025-01-10 01:30:12,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332825044] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:12,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677588344] [2025-01-10 01:30:12,002 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:30:12,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:12,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:12,004 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:30:12,005 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:30:12,021 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 86 statements into 2 equivalence classes. [2025-01-10 01:30:12,035 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 01:30:12,035 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:30:12,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:12,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:30:12,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:12,099 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 186 proven. 184 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-10 01:30:12,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 186 proven. 184 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-10 01:30:12,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677588344] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:12,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:12,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2025-01-10 01:30:12,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9997180] [2025-01-10 01:30:12,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:12,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 01:30:12,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:12,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 01:30:12,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:30:12,261 INFO L87 Difference]: Start difference. First operand 737 states and 859 transitions. Second operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 20 states have internal predecessors, (110), 0 states have call successors, (0), 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:30:12,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:12,331 INFO L93 Difference]: Finished difference Result 1162 states and 1360 transitions. [2025-01-10 01:30:12,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 01:30:12,332 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 20 states have internal predecessors, (110), 0 states have call successors, (0), 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 86 [2025-01-10 01:30:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:12,333 INFO L225 Difference]: With dead ends: 1162 [2025-01-10 01:30:12,333 INFO L226 Difference]: Without dead ends: 471 [2025-01-10 01:30:12,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:30:12,335 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:12,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 74 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:30:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-01-10 01:30:12,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2025-01-10 01:30:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 468 states have (on average 1.1474358974358974) internal successors, (537), 470 states have internal predecessors, (537), 0 states have call successors, (0), 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:30:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 537 transitions. [2025-01-10 01:30:12,346 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 537 transitions. Word has length 86 [2025-01-10 01:30:12,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:12,346 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 537 transitions. [2025-01-10 01:30:12,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 20 states have internal predecessors, (110), 0 states have call successors, (0), 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:30:12,347 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 537 transitions. [2025-01-10 01:30:12,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-10 01:30:12,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:12,348 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 1, 1, 1] [2025-01-10 01:30:12,354 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:30:12,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:12,548 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:12,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:12,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1383848001, now seen corresponding path program 4 times [2025-01-10 01:30:12,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:12,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593572743] [2025-01-10 01:30:12,549 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:30:12,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:12,554 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 138 statements into 2 equivalence classes. [2025-01-10 01:30:12,566 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 138 of 138 statements. [2025-01-10 01:30:12,568 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:30:12,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 1474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:13,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:13,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593572743] [2025-01-10 01:30:13,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593572743] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:13,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854280314] [2025-01-10 01:30:13,006 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:30:13,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:13,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:13,008 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:30:13,009 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:30:13,027 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 138 statements into 2 equivalence classes. [2025-01-10 01:30:13,046 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 138 of 138 statements. [2025-01-10 01:30:13,046 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:30:13,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:13,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 01:30:13,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 1474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:13,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:13,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 1474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:13,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854280314] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:13,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:13,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-01-10 01:30:13,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641261950] [2025-01-10 01:30:13,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:13,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-10 01:30:13,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:13,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-10 01:30:13,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 01:30:13,888 INFO L87 Difference]: Start difference. First operand 471 states and 537 transitions. Second operand has 48 states, 47 states have (on average 5.851063829787234) internal successors, (275), 48 states have internal predecessors, (275), 0 states have call successors, (0), 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:30:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:14,271 INFO L93 Difference]: Finished difference Result 5689 states and 6894 transitions. [2025-01-10 01:30:14,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 01:30:14,271 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 5.851063829787234) internal successors, (275), 48 states have internal predecessors, (275), 0 states have call successors, (0), 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 138 [2025-01-10 01:30:14,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:14,288 INFO L225 Difference]: With dead ends: 5689 [2025-01-10 01:30:14,288 INFO L226 Difference]: Without dead ends: 5687 [2025-01-10 01:30:14,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 01:30:14,292 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 327 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:14,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 308 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:30:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5687 states. [2025-01-10 01:30:14,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5687 to 1757. [2025-01-10 01:30:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1754 states have (on average 1.1670467502850628) internal successors, (2047), 1756 states have internal predecessors, (2047), 0 states have call successors, (0), 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:30:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2047 transitions. [2025-01-10 01:30:14,391 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2047 transitions. Word has length 138 [2025-01-10 01:30:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:14,391 INFO L471 AbstractCegarLoop]: Abstraction has 1757 states and 2047 transitions. [2025-01-10 01:30:14,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 5.851063829787234) internal successors, (275), 48 states have internal predecessors, (275), 0 states have call successors, (0), 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:30:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2047 transitions. [2025-01-10 01:30:14,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-10 01:30:14,392 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:14,392 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 23, 18, 18, 18, 6, 6, 6, 1, 1, 1] [2025-01-10 01:30:14,398 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:30:14,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:14,593 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:14,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:14,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1970917774, now seen corresponding path program 5 times [2025-01-10 01:30:14,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:14,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463454242] [2025-01-10 01:30:14,594 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:30:14,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:14,601 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 146 statements into 20 equivalence classes. [2025-01-10 01:30:14,621 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 146 of 146 statements. [2025-01-10 01:30:14,622 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-01-10 01:30:14,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:14,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1440 backedges. 406 proven. 954 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-10 01:30:14,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:14,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463454242] [2025-01-10 01:30:14,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463454242] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:14,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133717920] [2025-01-10 01:30:14,952 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:30:14,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:14,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:14,954 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:30:14,956 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:30:14,975 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 146 statements into 20 equivalence classes. [2025-01-10 01:30:15,000 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 146 of 146 statements. [2025-01-10 01:30:15,001 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-01-10 01:30:15,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:15,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:30:15,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1440 backedges. 406 proven. 954 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-10 01:30:15,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1440 backedges. 406 proven. 954 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-10 01:30:15,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133717920] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:15,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:15,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2025-01-10 01:30:15,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352900144] [2025-01-10 01:30:15,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:15,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-10 01:30:15,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:15,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-10 01:30:15,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2025-01-10 01:30:15,593 INFO L87 Difference]: Start difference. First operand 1757 states and 2047 transitions. Second operand has 40 states, 40 states have (on average 5.75) internal successors, (230), 40 states have internal predecessors, (230), 0 states have call successors, (0), 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:30:15,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:15,707 INFO L93 Difference]: Finished difference Result 2722 states and 3182 transitions. [2025-01-10 01:30:15,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-01-10 01:30:15,708 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 5.75) internal successors, (230), 40 states have internal predecessors, (230), 0 states have call successors, (0), 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 146 [2025-01-10 01:30:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:15,712 INFO L225 Difference]: With dead ends: 2722 [2025-01-10 01:30:15,712 INFO L226 Difference]: Without dead ends: 1071 [2025-01-10 01:30:15,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2025-01-10 01:30:15,715 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:15,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 132 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:30:15,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-01-10 01:30:15,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2025-01-10 01:30:15,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1068 states have (on average 1.1432584269662922) internal successors, (1221), 1070 states have internal predecessors, (1221), 0 states have call successors, (0), 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:30:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1221 transitions. [2025-01-10 01:30:15,737 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1221 transitions. Word has length 146 [2025-01-10 01:30:15,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:15,737 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1221 transitions. [2025-01-10 01:30:15,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 5.75) internal successors, (230), 40 states have internal predecessors, (230), 0 states have call successors, (0), 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:30:15,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1221 transitions. [2025-01-10 01:30:15,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-01-10 01:30:15,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:15,739 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 43, 38, 38, 38, 6, 6, 6, 1, 1, 1] [2025-01-10 01:30:15,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:30:15,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:15,940 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:15,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:15,940 INFO L85 PathProgramCache]: Analyzing trace with hash -997279462, now seen corresponding path program 6 times [2025-01-10 01:30:15,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:15,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14200546] [2025-01-10 01:30:15,940 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:30:15,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:15,947 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 266 statements into 40 equivalence classes. [2025-01-10 01:30:15,959 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 104 of 266 statements. [2025-01-10 01:30:15,960 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-01-10 01:30:15,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5220 backedges. 1048 proven. 102 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2025-01-10 01:30:16,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:16,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14200546] [2025-01-10 01:30:16,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14200546] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:16,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070566133] [2025-01-10 01:30:16,067 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:30:16,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:16,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:16,069 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:30:16,071 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:30:16,096 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 266 statements into 40 equivalence classes. [2025-01-10 01:30:16,115 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 104 of 266 statements. [2025-01-10 01:30:16,115 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-01-10 01:30:16,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:16,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:30:16,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 5220 backedges. 1048 proven. 102 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2025-01-10 01:30:16,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5220 backedges. 1048 proven. 102 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2025-01-10 01:30:16,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070566133] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:16,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:16,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-01-10 01:30:16,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207023632] [2025-01-10 01:30:16,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:16,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:30:16,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:16,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:30:16,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:30:16,250 INFO L87 Difference]: Start difference. First operand 1071 states and 1221 transitions. Second operand has 16 states, 15 states have (on average 6.0) internal successors, (90), 16 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:30:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:16,309 INFO L93 Difference]: Finished difference Result 1749 states and 2117 transitions. [2025-01-10 01:30:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:30:16,309 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.0) internal successors, (90), 16 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) Word has length 266 [2025-01-10 01:30:16,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:16,315 INFO L225 Difference]: With dead ends: 1749 [2025-01-10 01:30:16,315 INFO L226 Difference]: Without dead ends: 1748 [2025-01-10 01:30:16,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:30:16,317 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:16,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 69 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:30:16,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2025-01-10 01:30:16,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1735. [2025-01-10 01:30:16,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1732 states have (on average 1.155311778290993) internal successors, (2001), 1734 states have internal predecessors, (2001), 0 states have call successors, (0), 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:30:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2001 transitions. [2025-01-10 01:30:16,365 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2001 transitions. Word has length 266 [2025-01-10 01:30:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:16,365 INFO L471 AbstractCegarLoop]: Abstraction has 1735 states and 2001 transitions. [2025-01-10 01:30:16,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.0) internal successors, (90), 16 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:30:16,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2001 transitions. [2025-01-10 01:30:16,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-01-10 01:30:16,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:16,371 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 1, 1, 1] [2025-01-10 01:30:16,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 01:30:16,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 01:30:16,572 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:16,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:16,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1626679017, now seen corresponding path program 5 times [2025-01-10 01:30:16,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:16,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448613721] [2025-01-10 01:30:16,572 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:30:16,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:16,585 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 282 statements into 47 equivalence classes. [2025-01-10 01:30:16,669 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 282 of 282 statements. [2025-01-10 01:30:16,670 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:30:16,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:17,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 6394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:17,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:17,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448613721] [2025-01-10 01:30:17,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448613721] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:17,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296928748] [2025-01-10 01:30:17,992 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:30:17,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:17,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:17,994 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:30:17,995 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:30:18,016 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 282 statements into 47 equivalence classes. [2025-01-10 01:30:18,077 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 282 of 282 statements. [2025-01-10 01:30:18,077 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 01:30:18,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:18,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 01:30:18,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 6394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:18,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:20,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 6394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:20,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296928748] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:20,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:20,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-01-10 01:30:20,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054448316] [2025-01-10 01:30:20,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:20,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-01-10 01:30:20,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:20,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-10 01:30:20,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:30:20,304 INFO L87 Difference]: Start difference. First operand 1735 states and 2001 transitions. Second operand has 96 states, 95 states have (on average 5.926315789473684) internal successors, (563), 96 states have internal predecessors, (563), 0 states have call successors, (0), 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:30:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:21,497 INFO L93 Difference]: Finished difference Result 41561 states and 49682 transitions. [2025-01-10 01:30:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-10 01:30:21,498 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 5.926315789473684) internal successors, (563), 96 states have internal predecessors, (563), 0 states have call successors, (0), 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 282 [2025-01-10 01:30:21,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:21,575 INFO L225 Difference]: With dead ends: 41561 [2025-01-10 01:30:21,576 INFO L226 Difference]: Without dead ends: 41559 [2025-01-10 01:30:21,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:30:21,583 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 677 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:21,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 633 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 01:30:21,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41559 states. [2025-01-10 01:30:22,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41559 to 7381. [2025-01-10 01:30:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7381 states, 7378 states have (on average 1.1665763079425318) internal successors, (8607), 7380 states have internal predecessors, (8607), 0 states have call successors, (0), 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:30:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7381 states to 7381 states and 8607 transitions. [2025-01-10 01:30:22,243 INFO L78 Accepts]: Start accepts. Automaton has 7381 states and 8607 transitions. Word has length 282 [2025-01-10 01:30:22,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:22,244 INFO L471 AbstractCegarLoop]: Abstraction has 7381 states and 8607 transitions. [2025-01-10 01:30:22,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 5.926315789473684) internal successors, (563), 96 states have internal predecessors, (563), 0 states have call successors, (0), 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:30:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 7381 states and 8607 transitions. [2025-01-10 01:30:22,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-01-10 01:30:22,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:22,248 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 51, 38, 38, 38, 14, 14, 14, 1, 1, 1] [2025-01-10 01:30:22,254 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:30:22,448 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,SelfDestructingSolverStorable15 [2025-01-10 01:30:22,449 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:22,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:22,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1487035266, now seen corresponding path program 7 times [2025-01-10 01:30:22,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:22,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156395231] [2025-01-10 01:30:22,450 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:30:22,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:22,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-01-10 01:30:22,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-01-10 01:30:22,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:22,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6892 backedges. 2078 proven. 4294 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-01-10 01:30:23,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:23,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156395231] [2025-01-10 01:30:23,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156395231] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:23,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378280961] [2025-01-10 01:30:23,593 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:30:23,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:23,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:23,595 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:30:23,595 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:30:23,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-01-10 01:30:23,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-01-10 01:30:23,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:30:23,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:23,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-10 01:30:23,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:23,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6892 backedges. 2078 proven. 4294 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-01-10 01:30:23,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6892 backedges. 2078 proven. 4294 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-01-10 01:30:24,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378280961] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:24,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:24,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 53 [2025-01-10 01:30:24,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277696751] [2025-01-10 01:30:24,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:24,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-01-10 01:30:24,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:24,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-01-10 01:30:24,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2025-01-10 01:30:24,690 INFO L87 Difference]: Start difference. First operand 7381 states and 8607 transitions. Second operand has 53 states, 53 states have (on average 5.90566037735849) internal successors, (313), 53 states have internal predecessors, (313), 0 states have call successors, (0), 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:30:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:24,837 INFO L93 Difference]: Finished difference Result 11080 states and 12945 transitions. [2025-01-10 01:30:24,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-01-10 01:30:24,837 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 5.90566037735849) internal successors, (313), 53 states have internal predecessors, (313), 0 states have call successors, (0), 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 314 [2025-01-10 01:30:24,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:24,849 INFO L225 Difference]: With dead ends: 11080 [2025-01-10 01:30:24,849 INFO L226 Difference]: Without dead ends: 3925 [2025-01-10 01:30:24,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 589 SyntacticMatches, 27 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2025-01-10 01:30:24,856 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:24,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 176 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:30:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2025-01-10 01:30:24,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3925. [2025-01-10 01:30:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3925 states, 3922 states have (on average 1.1603773584905661) internal successors, (4551), 3924 states have internal predecessors, (4551), 0 states have call successors, (0), 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:30:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 4551 transitions. [2025-01-10 01:30:24,917 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 4551 transitions. Word has length 314 [2025-01-10 01:30:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:24,917 INFO L471 AbstractCegarLoop]: Abstraction has 3925 states and 4551 transitions. [2025-01-10 01:30:24,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.90566037735849) internal successors, (313), 53 states have internal predecessors, (313), 0 states have call successors, (0), 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:30:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 4551 transitions. [2025-01-10 01:30:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-01-10 01:30:24,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:24,921 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 64, 51, 51, 51, 14, 14, 14, 1, 1, 1] [2025-01-10 01:30:24,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 01:30:25,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:30:25,125 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:25,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:25,126 INFO L85 PathProgramCache]: Analyzing trace with hash 724341117, now seen corresponding path program 8 times [2025-01-10 01:30:25,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:25,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661786286] [2025-01-10 01:30:25,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:30:25,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:25,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 392 statements into 2 equivalence classes. [2025-01-10 01:30:25,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 392 of 392 statements. [2025-01-10 01:30:25,164 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:30:25,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 11052 backedges. 0 proven. 11052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:27,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:27,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661786286] [2025-01-10 01:30:27,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661786286] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:27,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052139373] [2025-01-10 01:30:27,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:30:27,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:27,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:27,300 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:30:27,301 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:30:27,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 392 statements into 2 equivalence classes. [2025-01-10 01:30:27,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 392 of 392 statements. [2025-01-10 01:30:27,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:30:27,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:27,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-01-10 01:30:27,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 11052 backedges. 0 proven. 11052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:27,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:30:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 11052 backedges. 0 proven. 11052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:31,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052139373] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:30:31,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:30:31,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2025-01-10 01:30:31,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875934634] [2025-01-10 01:30:31,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:30:31,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2025-01-10 01:30:31,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:31,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2025-01-10 01:30:31,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2025-01-10 01:30:31,221 INFO L87 Difference]: Start difference. First operand 3925 states and 4551 transitions. Second operand has 132 states, 131 states have (on average 5.977099236641221) internal successors, (783), 132 states have internal predecessors, (783), 0 states have call successors, (0), 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:30:32,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:32,903 INFO L93 Difference]: Finished difference Result 7837 states and 9737 transitions. [2025-01-10 01:30:32,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-01-10 01:30:32,904 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 131 states have (on average 5.977099236641221) internal successors, (783), 132 states have internal predecessors, (783), 0 states have call successors, (0), 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 392 [2025-01-10 01:30:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:32,913 INFO L225 Difference]: With dead ends: 7837 [2025-01-10 01:30:32,913 INFO L226 Difference]: Without dead ends: 7836 [2025-01-10 01:30:32,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 848 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2025-01-10 01:30:32,917 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1086 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 678 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:32,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 496 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [678 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 01:30:32,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7836 states. [2025-01-10 01:30:33,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7836 to 7757. [2025-01-10 01:30:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7757 states, 7754 states have (on average 1.170621614650503) internal successors, (9077), 7756 states have internal predecessors, (9077), 0 states have call successors, (0), 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:30:33,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7757 states to 7757 states and 9077 transitions. [2025-01-10 01:30:33,057 INFO L78 Accepts]: Start accepts. Automaton has 7757 states and 9077 transitions. Word has length 392 [2025-01-10 01:30:33,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:33,057 INFO L471 AbstractCegarLoop]: Abstraction has 7757 states and 9077 transitions. [2025-01-10 01:30:33,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 131 states have (on average 5.977099236641221) internal successors, (783), 132 states have internal predecessors, (783), 0 states have call successors, (0), 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:30:33,058 INFO L276 IsEmpty]: Start isEmpty. Operand 7757 states and 9077 transitions. [2025-01-10 01:30:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-01-10 01:30:33,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:33,067 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 94, 94, 94, 1, 1, 1] [2025-01-10 01:30:33,075 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:30:33,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:30:33,268 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:33,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:33,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1915311161, now seen corresponding path program 6 times [2025-01-10 01:30:33,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:33,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121744216] [2025-01-10 01:30:33,269 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:30:33,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:33,278 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 570 statements into 95 equivalence classes. [2025-01-10 01:30:33,342 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 94 check-sat command(s) and asserted 564 of 570 statements. [2025-01-10 01:30:33,342 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 94 check-sat command(s) [2025-01-10 01:30:33,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 26602 backedges. 21842 proven. 0 refuted. 0 times theorem prover too weak. 4760 trivial. 0 not checked. [2025-01-10 01:30:35,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:35,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121744216] [2025-01-10 01:30:35,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121744216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:30:35,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:30:35,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2025-01-10 01:30:35,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128653824] [2025-01-10 01:30:35,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:30:35,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-01-10 01:30:35,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:30:35,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-01-10 01:30:35,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2025-01-10 01:30:35,163 INFO L87 Difference]: Start difference. First operand 7757 states and 9077 transitions. Second operand has 57 states, 57 states have (on average 5.87719298245614) internal successors, (335), 57 states have internal predecessors, (335), 0 states have call successors, (0), 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:30:35,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:30:35,475 INFO L93 Difference]: Finished difference Result 8242 states and 9642 transitions. [2025-01-10 01:30:35,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-10 01:30:35,475 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 5.87719298245614) internal successors, (335), 57 states have internal predecessors, (335), 0 states have call successors, (0), 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 570 [2025-01-10 01:30:35,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:30:35,478 INFO L225 Difference]: With dead ends: 8242 [2025-01-10 01:30:35,478 INFO L226 Difference]: Without dead ends: 789 [2025-01-10 01:30:35,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2025-01-10 01:30:35,484 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 28 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:30:35,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 677 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:30:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-01-10 01:30:35,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2025-01-10 01:30:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.001269035532995) internal successors, (789), 788 states have internal predecessors, (789), 0 states have call successors, (0), 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:30:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 789 transitions. [2025-01-10 01:30:35,499 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 789 transitions. Word has length 570 [2025-01-10 01:30:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:30:35,500 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 789 transitions. [2025-01-10 01:30:35,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 5.87719298245614) internal successors, (335), 57 states have internal predecessors, (335), 0 states have call successors, (0), 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:30:35,500 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 789 transitions. [2025-01-10 01:30:35,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2025-01-10 01:30:35,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:30:35,511 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 130, 80, 80, 80, 51, 51, 51, 1, 1, 1] [2025-01-10 01:30:35,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:30:35,511 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:30:35,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:30:35,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1805409449, now seen corresponding path program 9 times [2025-01-10 01:30:35,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:30:35,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851035669] [2025-01-10 01:30:35,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:30:35,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:30:35,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 788 statements into 81 equivalence classes. [2025-01-10 01:30:35,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) and asserted 788 of 788 statements. [2025-01-10 01:30:35,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2025-01-10 01:30:35,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:40,988 INFO L134 CoverageAnalysis]: Checked inductivity of 42930 backedges. 29976 proven. 12752 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-01-10 01:30:40,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:30:40,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851035669] [2025-01-10 01:30:40,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851035669] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:30:40,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120451130] [2025-01-10 01:30:40,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:30:40,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:30:40,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:30:40,991 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:30:40,994 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:30:41,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 788 statements into 81 equivalence classes. [2025-01-10 01:30:41,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) and asserted 788 of 788 statements. [2025-01-10 01:30:41,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2025-01-10 01:30:41,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:30:41,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 1315 conjuncts, 132 conjuncts are in the unsatisfiable core [2025-01-10 01:30:41,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:30:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 42930 backedges. 0 proven. 42930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:30:48,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:31:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 42930 backedges. 0 proven. 42930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:31:04,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120451130] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:31:04,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:31:04,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 132, 132] total 344 [2025-01-10 01:31:04,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962821292] [2025-01-10 01:31:04,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:31:04,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 344 states [2025-01-10 01:31:04,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:31:04,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 344 interpolants. [2025-01-10 01:31:04,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38036, Invalid=79956, Unknown=0, NotChecked=0, Total=117992 [2025-01-10 01:31:04,542 INFO L87 Difference]: Start difference. First operand 789 states and 789 transitions. Second operand has 344 states, 344 states have (on average 6.4273255813953485) internal successors, (2211), 344 states have internal predecessors, (2211), 0 states have call successors, (0), 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:31:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:31:15,827 INFO L93 Difference]: Finished difference Result 789 states and 789 transitions. [2025-01-10 01:31:15,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2025-01-10 01:31:15,828 INFO L78 Accepts]: Start accepts. Automaton has has 344 states, 344 states have (on average 6.4273255813953485) internal successors, (2211), 344 states have internal predecessors, (2211), 0 states have call successors, (0), 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 788 [2025-01-10 01:31:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:31:15,829 INFO L225 Difference]: With dead ends: 789 [2025-01-10 01:31:15,829 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:31:15,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1914 GetRequests, 1365 SyntacticMatches, 0 SemanticMatches, 549 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50612 ImplicationChecksByTransitivity, 30.7s TimeCoverageRelationStatistics Valid=98198, Invalid=204852, Unknown=0, NotChecked=0, Total=303050 [2025-01-10 01:31:15,840 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 2901 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 2902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 01:31:15,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 2902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2901 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 01:31:15,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:31:15,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:31:15,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:31:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:31:15,842 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 788 [2025-01-10 01:31:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:31:15,842 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:31:15,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 344 states, 344 states have (on average 6.4273255813953485) internal successors, (2211), 344 states have internal predecessors, (2211), 0 states have call successors, (0), 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:31:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:31:15,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:31:15,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-01-10 01:31:15,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 01:31:15,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 01:31:15,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 01:31:15,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 01:31:15,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-01-10 01:31:15,854 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:31:16,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:31:16,049 INFO L422 BasicCegarLoop]: Path program histogram: [9, 6, 1, 1, 1, 1, 1] [2025-01-10 01:31:16,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:31:17,313 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:31:17,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:31:17 BoogieIcfgContainer [2025-01-10 01:31:17,342 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:31:17,342 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:31:17,342 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:31:17,342 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:31:17,343 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:30:08" (3/4) ... [2025-01-10 01:31:17,344 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:31:17,352 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 01:31:17,352 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:31:17,352 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 01:31:17,405 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:31:17,405 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:31:17,405 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:31:17,406 INFO L158 Benchmark]: Toolchain (without parser) took 69500.84ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 114.4MB in the beginning and 580.5MB in the end (delta: -466.1MB). Peak memory consumption was 748.4MB. Max. memory is 16.1GB. [2025-01-10 01:31:17,406 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:31:17,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 134.81ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 104.3MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:31:17,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.02ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 103.3MB in the end (delta: 997.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:31:17,406 INFO L158 Benchmark]: Boogie Preprocessor took 19.44ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 102.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:31:17,406 INFO L158 Benchmark]: RCFGBuilder took 157.32ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 92.7MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:31:17,407 INFO L158 Benchmark]: TraceAbstraction took 69104.52ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 92.3MB in the beginning and 588.9MB in the end (delta: -496.6MB). Peak memory consumption was 723.2MB. Max. memory is 16.1GB. [2025-01-10 01:31:17,407 INFO L158 Benchmark]: Witness Printer took 62.91ms. Allocated memory is still 1.4GB. Free memory was 588.9MB in the beginning and 580.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:31:17,407 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 134.81ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 104.3MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.02ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 103.3MB in the end (delta: 997.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.44ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 102.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 157.32ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 92.7MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 69104.52ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 92.3MB in the beginning and 588.9MB in the end (delta: -496.6MB). Peak memory consumption was 723.2MB. Max. memory is 16.1GB. * Witness Printer took 62.91ms. Allocated memory is still 1.4GB. Free memory was 588.9MB in the beginning and 580.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 67.8s, OverallIterations: 20, TraceHistogramMax: 131, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2415 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2415 mSDsluCounter, 3012 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2541 mSDsCounter, 1237 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5751 IncrementalHoareTripleChecker+Invalid, 6988 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1237 mSolverCounterUnsat, 471 mSDtfsCounter, 5751 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5889 GetRequests, 4808 SyntacticMatches, 27 SemanticMatches, 1054 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51287 ImplicationChecksByTransitivity, 41.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7757occurred in iteration=18, InterpolantAutomatonStates: 752, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 38897 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 46.3s InterpolantComputationTime, 5866 NumberOfCodeBlocks, 5464 NumberOfCodeBlocksAsserted, 477 NumberOfCheckSat, 8446 ConstructedInterpolants, 0 QuantifiedInterpolants, 22486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4070 ConjunctsInSsa, 381 ConjunctsInUnsatCore, 48 InterpolantComputations, 6 PerfectInterpolantSequences, 82948/256132 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((x == 50) && (y <= 50)) || (((54 <= x) && (y <= 6)) && (x <= 96))) || ((31 == x) && (y <= 31))) || (((54 <= x) && (y <= 3)) && (x <= 99))) || ((y <= 40) && (40 == x))) || (((y <= 37) && (54 <= x)) && (x <= 65))) || ((x == 11) && (y <= 11))) || ((x == 8) && (y <= 8))) || ((x == 36) && (y <= 36))) || ((x == 1) && (y <= 1))) || ((y <= 46) && (46 == x))) || ((y <= 47) && (47 == x))) || ((y <= 12) && (x == 12))) || (((54 <= x) && (x <= 83)) && (y <= 19))) || (((y <= 28) && (x <= 74)) && (54 <= x))) || ((x == 13) && (y <= 13))) || ((2 == x) && (y <= 2))) || ((y <= 29) && (29 == x))) || (((y <= 24) && (54 <= x)) && (x <= 78))) || (((y <= 40) && (54 <= x)) && (x <= 62))) || (((x <= 84) && (y <= 18)) && (54 <= x))) || ((x == 38) && (y <= 38))) || (((54 <= x) && (x <= 72)) && (y <= 30))) || (((y <= 43) && (54 <= x)) && (x <= 59))) || ((16 == x) && (y <= 16))) || ((53 == x) && (y <= 49))) || ((y <= 7) && (7 == x))) || ((y <= 39) && (x == 39))) || (((x <= 70) && (54 <= x)) && (y <= 32))) || (((54 <= x) && (x <= 82)) && (y <= 20))) || ((y <= 25) && (x == 25))) || ((5 == x) && (y <= 5))) || (((54 <= x) && (x <= 94)) && (y <= 8))) || ((x == 34) && (y <= 34))) || ((y <= 48) && (x == 48))) || (((x <= 67) && (y <= 35)) && (54 <= x))) || (((54 <= x) && (x <= 79)) && (y <= 23))) || ((22 == x) && (y <= 22))) || (((54 <= x) && (x <= 68)) && (y <= 34))) || ((y <= 15) && (x == 15))) || (((54 <= x) && (y <= 1)) && (x <= 101))) || ((y <= 6) && (6 == x))) || (((54 <= x) && (y <= 45)) && (x <= 57))) || ((y <= 28) && (x == 28))) || ((19 == x) && (y <= 19))) || (((54 <= x) && (x <= 86)) && (y <= 16))) || (((x <= 90) && (54 <= x)) && (y <= 12))) || ((y <= 4) && (x == 4))) || ((y <= 24) && (x == 24))) || (((y <= 44) && (54 <= x)) && (x <= 58))) || (((54 <= x) && (((long) y + 1) <= 0)) && (x <= 103))) || ((y <= 21) && (21 == x))) || (((54 <= x) && (x <= 64)) && (y <= 38))) || ((3 == x) && (y <= 3))) || (((x <= 63) && (54 <= x)) && (y <= 39))) || (((54 <= x) && (y <= 9)) && (x <= 93))) || ((y <= 45) && (x == 45))) || (((x <= 75) && (y <= 27)) && (54 <= x))) || (((y <= 4) && (54 <= x)) && (x <= 98))) || (((54 <= x) && (x <= 71)) && (y <= 31))) || ((y <= 42) && (42 == x))) || (((x <= 56) && (54 <= x)) && (y <= 46))) || ((y <= 17) && (x == 17))) || (((x <= 61) && (54 <= x)) && (y <= 41))) || (((y <= 15) && (54 <= x)) && (x <= 87))) || ((y <= 33) && (x == 33))) || ((y <= 20) && (x == 20))) || ((y <= 10) && (x == 10))) || (((54 <= x) && (y <= 33)) && (x <= 69))) || (((54 <= x) && (y <= 22)) && (x <= 80))) || (((54 <= x) && (y <= 0)) && (x <= 102))) || ((y <= 44) && (44 == x))) || ((y <= 27) && (x == 27))) || ((49 == x) && (y <= 49))) || (((54 <= x) && (y <= 14)) && (x <= 88))) || (((54 <= x) && (x <= 60)) && (y <= 42))) || ((y <= 43) && (x == 43))) || ((41 == x) && (y <= 41))) || ((y <= 35) && (35 == x))) || ((32 == x) && (y <= 32))) || (((54 <= x) && (x <= 85)) && (y <= 17))) || (((54 <= x) && (x <= 73)) && (y <= 29))) || ((y <= 48) && (x == 54))) || ((y <= 0) && (x == 0))) || (((y <= 47) && (54 <= x)) && (x <= 55))) || (((54 <= x) && (x <= 77)) && (y <= 25))) || (((y <= 7) && (54 <= x)) && (x <= 95))) || ((y <= 14) && (14 == x))) || ((y <= 30) && (30 == x))) || ((23 == x) && (y <= 23))) || (((y <= 26) && (x <= 76)) && (54 <= x))) || ((9 == x) && (y <= 9))) || (((54 <= x) && (y <= 21)) && (x <= 81))) || (((y <= 5) && (54 <= x)) && (x <= 97))) || (((x <= 66) && (54 <= x)) && (y <= 36))) || ((y <= 37) && (x == 37))) || (((x <= 92) && (y <= 10)) && (54 <= x))) || (((x <= 91) && (54 <= x)) && (y <= 11))) || (((x <= 89) && (54 <= x)) && (y <= 13))) || ((52 == x) && (y <= 50))) || (((y <= 2) && (54 <= x)) && (x <= 100))) || ((y <= 26) && (x == 26))) || ((y <= 18) && (x == 18))) || ((51 == x) && (y <= 51))) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:31:17,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE