./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/rec_counter1.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-numeric/rec_counter1.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 de5b7f1cccf5c7fe435559014125bbfd73538586d5303d45f8d606cb31a4b74b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:32:01,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:32:01,746 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:32:01,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:32:01,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:32:01,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:32:01,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:32:01,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:32:01,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:32:01,774 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:32:01,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:32:01,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:32:01,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:32:01,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:32:01,775 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:32:01,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:32:01,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:32:01,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:32:01,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:32:01,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:32:01,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:32:01,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:32:01,776 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:32:01,776 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:32:01,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:32:01,776 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:32:01,776 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:32:01,776 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:32:01,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:32:01,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:32:01,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:32:01,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:32:01,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:32:01,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:32:01,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:32:01,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:32:01,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:32:01,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:32:01,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:32:01,777 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:32:01,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:32:01,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:32:01,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:32:01,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:32:01,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:32:01,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:32:01,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:32:01,777 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 -> de5b7f1cccf5c7fe435559014125bbfd73538586d5303d45f8d606cb31a4b74b [2025-01-10 01:32:02,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:32:02,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:32:02,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:32:02,036 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:32:02,037 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:32:02,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/rec_counter1.c [2025-01-10 01:32:03,232 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6263a083/1094234cfb0f460da8123bd3072c526f/FLAG330fbccaa [2025-01-10 01:32:03,510 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:32:03,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-numeric/rec_counter1.c [2025-01-10 01:32:03,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6263a083/1094234cfb0f460da8123bd3072c526f/FLAG330fbccaa [2025-01-10 01:32:03,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6263a083/1094234cfb0f460da8123bd3072c526f [2025-01-10 01:32:03,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:32:03,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:32:03,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:32:03,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:32:03,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:32:03,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:32:03" (1/1) ... [2025-01-10 01:32:03,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66899fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:03, skipping insertion in model container [2025-01-10 01:32:03,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:32:03" (1/1) ... [2025-01-10 01:32:03,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:32:03,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:32:03,929 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:32:03,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:32:03,945 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:32:03,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:03 WrapperNode [2025-01-10 01:32:03,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:32:03,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:32:03,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:32:03,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:32:03,952 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:32:03" (1/1) ... [2025-01-10 01:32:03,954 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:32:03" (1/1) ... [2025-01-10 01:32:03,961 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2025-01-10 01:32:03,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:32:03,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:32:03,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:32:03,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:32:03,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:03" (1/1) ... [2025-01-10 01:32:03,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:03" (1/1) ... [2025-01-10 01:32:03,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:03" (1/1) ... [2025-01-10 01:32:03,972 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 01:32:03,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:03" (1/1) ... [2025-01-10 01:32:03,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:03" (1/1) ... [2025-01-10 01:32:03,976 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:03" (1/1) ... [2025-01-10 01:32:03,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:03" (1/1) ... [2025-01-10 01:32:03,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:03" (1/1) ... [2025-01-10 01:32:03,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:03" (1/1) ... [2025-01-10 01:32:03,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:03" (1/1) ... [2025-01-10 01:32:03,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:32:03,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:32:03,984 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:32:03,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:32:03,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:03" (1/1) ... [2025-01-10 01:32:03,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:32:03,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:04,011 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:32:04,019 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:32:04,032 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2025-01-10 01:32:04,032 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2025-01-10 01:32:04,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:32:04,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:32:04,068 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:32:04,070 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:32:04,158 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-10 01:32:04,158 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:32:04,166 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:32:04,166 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:32:04,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:32:04 BoogieIcfgContainer [2025-01-10 01:32:04,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:32:04,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:32:04,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:32:04,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:32:04,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:32:03" (1/3) ... [2025-01-10 01:32:04,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c9de87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:32:04, skipping insertion in model container [2025-01-10 01:32:04,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:03" (2/3) ... [2025-01-10 01:32:04,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c9de87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:32:04, skipping insertion in model container [2025-01-10 01:32:04,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:32:04" (3/3) ... [2025-01-10 01:32:04,174 INFO L128 eAbstractionObserver]: Analyzing ICFG rec_counter1.c [2025-01-10 01:32:04,184 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:32:04,185 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rec_counter1.c that has 2 procedures, 27 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-01-10 01:32:04,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:32:04,233 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;@5784217e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:32:04,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:32:04,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:32:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:32:04,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:04,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:04,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:04,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:04,244 INFO L85 PathProgramCache]: Analyzing trace with hash -118583754, now seen corresponding path program 1 times [2025-01-10 01:32:04,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:04,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766632468] [2025-01-10 01:32:04,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:04,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:04,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:32:04,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:32:04,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:04,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:04,366 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:32:04,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:04,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766632468] [2025-01-10 01:32:04,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766632468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:32:04,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:32:04,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:32:04,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458996620] [2025-01-10 01:32:04,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:32:04,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:32:04,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:04,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:32:04,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:32:04,388 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:32:04,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:04,449 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2025-01-10 01:32:04,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:32:04,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:32:04,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:04,454 INFO L225 Difference]: With dead ends: 53 [2025-01-10 01:32:04,454 INFO L226 Difference]: Without dead ends: 39 [2025-01-10 01:32:04,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:32:04,457 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:04,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 94 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:32:04,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-10 01:32:04,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2025-01-10 01:32:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:32:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2025-01-10 01:32:04,480 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 7 [2025-01-10 01:32:04,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:04,480 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-01-10 01:32:04,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:32:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2025-01-10 01:32:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:32:04,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:04,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:04,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:32:04,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:04,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:04,482 INFO L85 PathProgramCache]: Analyzing trace with hash 618870960, now seen corresponding path program 1 times [2025-01-10 01:32:04,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:04,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295172748] [2025-01-10 01:32:04,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:04,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:04,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:32:04,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:32:04,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:04,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:04,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:32:04,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:04,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295172748] [2025-01-10 01:32:04,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295172748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:32:04,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:32:04,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:32:04,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837749966] [2025-01-10 01:32:04,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:32:04,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:32:04,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:04,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:32:04,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:32:04,520 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:32:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:04,558 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2025-01-10 01:32:04,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:32:04,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:32:04,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:04,560 INFO L225 Difference]: With dead ends: 36 [2025-01-10 01:32:04,560 INFO L226 Difference]: Without dead ends: 35 [2025-01-10 01:32:04,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:32:04,561 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:04,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 38 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:32:04,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-10 01:32:04,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-01-10 01:32:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:32:04,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-01-10 01:32:04,566 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 8 [2025-01-10 01:32:04,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:04,567 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-01-10 01:32:04,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:32:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-01-10 01:32:04,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:32:04,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:04,567 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:04,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:32:04,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:04,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:04,568 INFO L85 PathProgramCache]: Analyzing trace with hash 441922347, now seen corresponding path program 1 times [2025-01-10 01:32:04,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:04,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625386780] [2025-01-10 01:32:04,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:04,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:04,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:32:04,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:32:04,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:04,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:04,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:32:04,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:04,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625386780] [2025-01-10 01:32:04,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625386780] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:04,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991051118] [2025-01-10 01:32:04,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:04,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:04,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:04,698 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:32:04,704 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:32:04,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:32:04,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:32:04,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:04,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:04,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:32:04,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:32:04,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:32:04,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991051118] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:04,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:04,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 01:32:04,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265573906] [2025-01-10 01:32:04,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:04,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:32:04,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:04,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:32:04,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:32:04,864 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:32:04,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:04,932 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2025-01-10 01:32:04,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:32:04,933 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 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:32:04,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:04,933 INFO L225 Difference]: With dead ends: 39 [2025-01-10 01:32:04,933 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 01:32:04,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:32:04,934 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 75 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:04,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 68 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:32:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 01:32:04,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2025-01-10 01:32:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:32:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-01-10 01:32:04,944 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 12 [2025-01-10 01:32:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:04,944 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-01-10 01:32:04,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:32:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-01-10 01:32:04,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:32:04,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:04,945 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:04,951 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:32:05,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:05,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting recErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:05,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:05,151 INFO L85 PathProgramCache]: Analyzing trace with hash -413468157, now seen corresponding path program 1 times [2025-01-10 01:32:05,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:05,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295360436] [2025-01-10 01:32:05,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:05,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:05,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:32:05,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:32:05,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:05,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:05,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:32:05,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:05,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295360436] [2025-01-10 01:32:05,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295360436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:32:05,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:32:05,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:32:05,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559031429] [2025-01-10 01:32:05,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:32:05,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:32:05,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:05,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:32:05,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:32:05,219 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:32:05,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:05,229 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-01-10 01:32:05,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:32:05,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 01:32:05,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:05,229 INFO L225 Difference]: With dead ends: 32 [2025-01-10 01:32:05,229 INFO L226 Difference]: Without dead ends: 31 [2025-01-10 01:32:05,230 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:32:05,230 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:05,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:32:05,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-10 01:32:05,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-01-10 01:32:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:32:05,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-01-10 01:32:05,238 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 16 [2025-01-10 01:32:05,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:05,238 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-01-10 01:32:05,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:32:05,239 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-01-10 01:32:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:32:05,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:05,239 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:05,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:32:05,240 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:05,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:05,240 INFO L85 PathProgramCache]: Analyzing trace with hash -413468349, now seen corresponding path program 1 times [2025-01-10 01:32:05,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:05,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934909125] [2025-01-10 01:32:05,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:05,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:05,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:32:05,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:32:05,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:05,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:32:05,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:05,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934909125] [2025-01-10 01:32:05,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934909125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:32:05,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:32:05,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:32:05,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659388949] [2025-01-10 01:32:05,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:32:05,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:32:05,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:05,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:32:05,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:32:05,266 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:32:05,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:05,274 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-01-10 01:32:05,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:32:05,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 01:32:05,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:05,275 INFO L225 Difference]: With dead ends: 31 [2025-01-10 01:32:05,276 INFO L226 Difference]: Without dead ends: 30 [2025-01-10 01:32:05,276 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:32:05,277 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:05,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:32:05,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-10 01:32:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-01-10 01:32:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:32:05,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-01-10 01:32:05,282 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 16 [2025-01-10 01:32:05,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:05,282 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-01-10 01:32:05,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:32:05,283 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2025-01-10 01:32:05,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 01:32:05,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:05,283 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:05,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:32:05,283 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:05,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:05,284 INFO L85 PathProgramCache]: Analyzing trace with hash 67389075, now seen corresponding path program 1 times [2025-01-10 01:32:05,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:05,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969228022] [2025-01-10 01:32:05,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:05,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:05,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:32:05,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:32:05,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:05,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:32:05,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:05,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969228022] [2025-01-10 01:32:05,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969228022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:32:05,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:32:05,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:32:05,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863459713] [2025-01-10 01:32:05,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:32:05,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:32:05,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:05,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:32:05,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:32:05,315 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:32:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:05,329 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-01-10 01:32:05,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:32:05,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-01-10 01:32:05,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:05,330 INFO L225 Difference]: With dead ends: 37 [2025-01-10 01:32:05,330 INFO L226 Difference]: Without dead ends: 34 [2025-01-10 01:32:05,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:32:05,331 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:05,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:32:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-10 01:32:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-01-10 01:32:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:32:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-01-10 01:32:05,335 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 17 [2025-01-10 01:32:05,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:05,336 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-01-10 01:32:05,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:32:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2025-01-10 01:32:05,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 01:32:05,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:05,336 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:05,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:32:05,337 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting recErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:05,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:05,337 INFO L85 PathProgramCache]: Analyzing trace with hash 67383117, now seen corresponding path program 1 times [2025-01-10 01:32:05,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:05,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716194704] [2025-01-10 01:32:05,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:05,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:05,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:32:05,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:32:05,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:05,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:32:05,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:05,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716194704] [2025-01-10 01:32:05,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716194704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:32:05,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:32:05,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:32:05,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441240290] [2025-01-10 01:32:05,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:32:05,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:32:05,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:05,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:32:05,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:32:05,381 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:32:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:05,393 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2025-01-10 01:32:05,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:32:05,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-01-10 01:32:05,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:05,394 INFO L225 Difference]: With dead ends: 60 [2025-01-10 01:32:05,394 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 01:32:05,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:32:05,395 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:05,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:32:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 01:32:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-10 01:32:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 01:32:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-01-10 01:32:05,400 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 17 [2025-01-10 01:32:05,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:05,400 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-01-10 01:32:05,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:32:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-01-10 01:32:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 01:32:05,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:05,401 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:05,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:32:05,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting recErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:05,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:05,401 INFO L85 PathProgramCache]: Analyzing trace with hash -43665283, now seen corresponding path program 1 times [2025-01-10 01:32:05,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:05,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315133300] [2025-01-10 01:32:05,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:05,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:05,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:32:05,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:32:05,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:05,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:32:05,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:05,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315133300] [2025-01-10 01:32:05,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315133300] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:05,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320643391] [2025-01-10 01:32:05,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:05,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:05,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:05,551 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:32:05,555 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:32:05,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:32:05,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:32:05,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:05,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:05,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:32:05,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:32:05,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:32:05,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320643391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:32:05,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:32:05,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-01-10 01:32:05,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094161210] [2025-01-10 01:32:05,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:32:05,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:32:05,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:05,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:32:05,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:32:05,681 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:32:05,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:05,723 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2025-01-10 01:32:05,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:32:05,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-01-10 01:32:05,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:05,725 INFO L225 Difference]: With dead ends: 38 [2025-01-10 01:32:05,725 INFO L226 Difference]: Without dead ends: 37 [2025-01-10 01:32:05,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:32:05,726 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:05,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:32:05,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-10 01:32:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-10 01:32:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 01:32:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-01-10 01:32:05,739 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 28 [2025-01-10 01:32:05,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:05,740 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-01-10 01:32:05,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:32:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-01-10 01:32:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 01:32:05,740 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:05,741 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:05,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:32:05,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:05,945 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:05,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:05,945 INFO L85 PathProgramCache]: Analyzing trace with hash 542694551, now seen corresponding path program 1 times [2025-01-10 01:32:05,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:05,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133027140] [2025-01-10 01:32:05,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:05,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:05,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:32:05,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:32:05,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:05,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:06,007 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:32:06,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:06,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133027140] [2025-01-10 01:32:06,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133027140] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:06,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171963278] [2025-01-10 01:32:06,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:06,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:06,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:06,010 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:32:06,013 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:32:06,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:32:06,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:32:06,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:06,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:06,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:32:06,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:06,103 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:32:06,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:32:06,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171963278] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:06,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:06,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2025-01-10 01:32:06,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054048453] [2025-01-10 01:32:06,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:06,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:32:06,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:06,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:32:06,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:32:06,267 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:32:06,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:06,413 INFO L93 Difference]: Finished difference Result 110 states and 137 transitions. [2025-01-10 01:32:06,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-10 01:32:06,414 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 31 [2025-01-10 01:32:06,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:06,415 INFO L225 Difference]: With dead ends: 110 [2025-01-10 01:32:06,415 INFO L226 Difference]: Without dead ends: 79 [2025-01-10 01:32:06,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2025-01-10 01:32:06,416 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:06,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 127 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:32:06,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-10 01:32:06,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2025-01-10 01:32:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.208955223880597) internal successors, (81), 67 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:32:06,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2025-01-10 01:32:06,423 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 31 [2025-01-10 01:32:06,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:06,424 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-01-10 01:32:06,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:32:06,424 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2025-01-10 01:32:06,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-10 01:32:06,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:06,425 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:06,431 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:32:06,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:06,626 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:06,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:06,627 INFO L85 PathProgramCache]: Analyzing trace with hash 397912029, now seen corresponding path program 2 times [2025-01-10 01:32:06,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:06,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188464702] [2025-01-10 01:32:06,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:32:06,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:06,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-01-10 01:32:06,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-01-10 01:32:06,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:32:06,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 122 proven. 23 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-01-10 01:32:06,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:06,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188464702] [2025-01-10 01:32:06,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188464702] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:06,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651074410] [2025-01-10 01:32:06,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:32:06,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:06,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:06,902 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:32:06,903 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:32:06,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-01-10 01:32:06,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-01-10 01:32:06,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:32:06,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:06,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:32:06,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:07,009 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 110 proven. 35 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-01-10 01:32:07,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 110 proven. 35 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-01-10 01:32:07,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651074410] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:07,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:07,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 20 [2025-01-10 01:32:07,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863225172] [2025-01-10 01:32:07,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:07,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 01:32:07,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:07,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 01:32:07,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:32:07,570 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 20 states, 20 states have (on average 2.55) internal successors, (51), 16 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:32:07,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:07,682 INFO L93 Difference]: Finished difference Result 143 states and 173 transitions. [2025-01-10 01:32:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 01:32:07,682 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 16 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 82 [2025-01-10 01:32:07,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:07,683 INFO L225 Difference]: With dead ends: 143 [2025-01-10 01:32:07,683 INFO L226 Difference]: Without dead ends: 85 [2025-01-10 01:32:07,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 146 SyntacticMatches, 16 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:32:07,684 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:07,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:32:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-10 01:32:07,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-01-10 01:32:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:32:07,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2025-01-10 01:32:07,691 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 82 [2025-01-10 01:32:07,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:07,692 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2025-01-10 01:32:07,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 16 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:32:07,692 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2025-01-10 01:32:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-10 01:32:07,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:07,693 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:07,699 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:32:07,897 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,SelfDestructingSolverStorable9 [2025-01-10 01:32:07,897 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:07,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:07,898 INFO L85 PathProgramCache]: Analyzing trace with hash 305977671, now seen corresponding path program 3 times [2025-01-10 01:32:07,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:07,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719165338] [2025-01-10 01:32:07,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:32:07,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:07,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 6 equivalence classes. [2025-01-10 01:32:07,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 63 of 88 statements. [2025-01-10 01:32:07,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 01:32:07,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 84 proven. 12 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-01-10 01:32:08,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:08,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719165338] [2025-01-10 01:32:08,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719165338] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:08,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557406660] [2025-01-10 01:32:08,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:32:08,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:08,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:08,011 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:32:08,012 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:32:08,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 6 equivalence classes. [2025-01-10 01:32:08,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 63 of 88 statements. [2025-01-10 01:32:08,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 01:32:08,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:08,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:32:08,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 84 proven. 12 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-01-10 01:32:08,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:08,333 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 84 proven. 12 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-01-10 01:32:08,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557406660] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:08,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:08,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-01-10 01:32:08,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292855415] [2025-01-10 01:32:08,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:08,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:32:08,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:08,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:32:08,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:32:08,336 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:32:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:08,403 INFO L93 Difference]: Finished difference Result 175 states and 206 transitions. [2025-01-10 01:32:08,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 01:32:08,404 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2025-01-10 01:32:08,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:08,405 INFO L225 Difference]: With dead ends: 175 [2025-01-10 01:32:08,405 INFO L226 Difference]: Without dead ends: 170 [2025-01-10 01:32:08,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:32:08,406 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:08,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:32:08,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-10 01:32:08,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 109. [2025-01-10 01:32:08,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 100 states have (on average 1.11) internal successors, (111), 100 states have internal predecessors, (111), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:32:08,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2025-01-10 01:32:08,420 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 88 [2025-01-10 01:32:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:08,421 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2025-01-10 01:32:08,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:32:08,421 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2025-01-10 01:32:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-10 01:32:08,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:08,423 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:08,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:32:08,623 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,SelfDestructingSolverStorable10 [2025-01-10 01:32:08,623 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:08,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:08,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1189276377, now seen corresponding path program 4 times [2025-01-10 01:32:08,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:08,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633943367] [2025-01-10 01:32:08,624 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:32:08,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:08,632 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 110 statements into 2 equivalence classes. [2025-01-10 01:32:08,646 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 01:32:08,646 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:32:08,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 156 proven. 88 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-01-10 01:32:08,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:08,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633943367] [2025-01-10 01:32:08,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633943367] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:08,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951991835] [2025-01-10 01:32:08,967 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:32:08,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:08,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:08,971 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:32:08,972 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:32:09,000 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 110 statements into 2 equivalence classes. [2025-01-10 01:32:09,022 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 01:32:09,022 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:32:09,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:09,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:32:09,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 0 proven. 271 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-01-10 01:32:09,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 0 proven. 271 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-01-10 01:32:10,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951991835] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:10,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:10,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 38 [2025-01-10 01:32:10,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385401915] [2025-01-10 01:32:10,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:10,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-10 01:32:10,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:10,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-10 01:32:10,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1263, Unknown=0, NotChecked=0, Total=1482 [2025-01-10 01:32:10,274 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 29 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-10 01:32:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:11,232 INFO L93 Difference]: Finished difference Result 436 states and 494 transitions. [2025-01-10 01:32:11,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-01-10 01:32:11,232 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 29 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-01-10 01:32:11,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:11,235 INFO L225 Difference]: With dead ends: 436 [2025-01-10 01:32:11,235 INFO L226 Difference]: Without dead ends: 285 [2025-01-10 01:32:11,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3413 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1360, Invalid=7952, Unknown=0, NotChecked=0, Total=9312 [2025-01-10 01:32:11,249 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:11,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 126 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:32:11,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-01-10 01:32:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 217. [2025-01-10 01:32:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 202 states have (on average 1.113861386138614) internal successors, (225), 202 states have internal predecessors, (225), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 12 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-10 01:32:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 240 transitions. [2025-01-10 01:32:11,309 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 240 transitions. Word has length 110 [2025-01-10 01:32:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:11,309 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 240 transitions. [2025-01-10 01:32:11,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 29 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (11), 11 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-10 01:32:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 240 transitions. [2025-01-10 01:32:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-01-10 01:32:11,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:11,312 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 14, 13, 13, 13, 13, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:11,325 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:32:11,517 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,SelfDestructingSolverStorable11 [2025-01-10 01:32:11,517 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:11,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:11,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1009227035, now seen corresponding path program 5 times [2025-01-10 01:32:11,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:11,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852166761] [2025-01-10 01:32:11,519 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:32:11,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:11,540 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 248 statements into 14 equivalence classes. [2025-01-10 01:32:11,579 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 139 of 248 statements. [2025-01-10 01:32:11,582 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-01-10 01:32:11,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1563 proven. 161 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2025-01-10 01:32:11,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852166761] [2025-01-10 01:32:11,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852166761] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156358942] [2025-01-10 01:32:11,936 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:32:11,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:11,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:11,940 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:32:11,945 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:32:12,003 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 248 statements into 14 equivalence classes. [2025-01-10 01:32:12,039 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 139 of 248 statements. [2025-01-10 01:32:12,039 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-01-10 01:32:12,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:12,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 01:32:12,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:12,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1553 proven. 190 refuted. 0 times theorem prover too weak. 1408 trivial. 0 not checked. [2025-01-10 01:32:12,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1589 proven. 154 refuted. 0 times theorem prover too weak. 1408 trivial. 0 not checked. [2025-01-10 01:32:13,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156358942] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:13,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:13,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 28 [2025-01-10 01:32:13,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938547285] [2025-01-10 01:32:13,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:13,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 01:32:13,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:13,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 01:32:13,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2025-01-10 01:32:13,890 INFO L87 Difference]: Start difference. First operand 217 states and 240 transitions. Second operand has 28 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 25 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:32:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:14,486 INFO L93 Difference]: Finished difference Result 500 states and 560 transitions. [2025-01-10 01:32:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-10 01:32:14,486 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 25 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 248 [2025-01-10 01:32:14,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:14,488 INFO L225 Difference]: With dead ends: 500 [2025-01-10 01:32:14,488 INFO L226 Difference]: Without dead ends: 322 [2025-01-10 01:32:14,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 472 SyntacticMatches, 18 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=422, Invalid=2128, Unknown=0, NotChecked=0, Total=2550 [2025-01-10 01:32:14,491 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:14,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:32:14,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-01-10 01:32:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 305. [2025-01-10 01:32:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 285 states have (on average 1.0701754385964912) internal successors, (305), 285 states have internal predecessors, (305), 3 states have call successors, (3), 2 states have call predecessors, (3), 16 states have return successors, (17), 17 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-10 01:32:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 325 transitions. [2025-01-10 01:32:14,510 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 325 transitions. Word has length 248 [2025-01-10 01:32:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:14,510 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 325 transitions. [2025-01-10 01:32:14,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 25 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:32:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 325 transitions. [2025-01-10 01:32:14,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-01-10 01:32:14,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:14,515 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:14,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:32:14,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:14,716 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:14,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:14,717 INFO L85 PathProgramCache]: Analyzing trace with hash 315060307, now seen corresponding path program 6 times [2025-01-10 01:32:14,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:14,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717610554] [2025-01-10 01:32:14,718 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:32:14,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:14,729 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 253 statements into 14 equivalence classes. [2025-01-10 01:32:14,781 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 227 of 253 statements. [2025-01-10 01:32:14,781 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-01-10 01:32:14,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3672 backedges. 1332 proven. 155 refuted. 0 times theorem prover too weak. 2185 trivial. 0 not checked. [2025-01-10 01:32:15,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:15,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717610554] [2025-01-10 01:32:15,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717610554] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:15,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779671869] [2025-01-10 01:32:15,147 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:32:15,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:15,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:15,149 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:32:15,154 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:32:15,220 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 253 statements into 14 equivalence classes. [2025-01-10 01:32:15,274 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 227 of 253 statements. [2025-01-10 01:32:15,274 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-01-10 01:32:15,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:15,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:32:15,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3672 backedges. 1332 proven. 155 refuted. 0 times theorem prover too weak. 2185 trivial. 0 not checked. [2025-01-10 01:32:15,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3672 backedges. 1332 proven. 155 refuted. 0 times theorem prover too weak. 2185 trivial. 0 not checked. [2025-01-10 01:32:15,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779671869] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:15,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:15,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2025-01-10 01:32:15,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492684742] [2025-01-10 01:32:15,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:15,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-10 01:32:15,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:15,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-10 01:32:15,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=779, Unknown=0, NotChecked=0, Total=992 [2025-01-10 01:32:15,967 INFO L87 Difference]: Start difference. First operand 305 states and 325 transitions. Second operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:32:16,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:16,640 INFO L93 Difference]: Finished difference Result 1197 states and 1373 transitions. [2025-01-10 01:32:16,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-01-10 01:32:16,641 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 253 [2025-01-10 01:32:16,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:16,645 INFO L225 Difference]: With dead ends: 1197 [2025-01-10 01:32:16,645 INFO L226 Difference]: Without dead ends: 1132 [2025-01-10 01:32:16,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=916, Invalid=3116, Unknown=0, NotChecked=0, Total=4032 [2025-01-10 01:32:16,647 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:16,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:32:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2025-01-10 01:32:16,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 350. [2025-01-10 01:32:16,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 330 states have (on average 1.093939393939394) internal successors, (361), 330 states have internal predecessors, (361), 3 states have call successors, (3), 2 states have call predecessors, (3), 16 states have return successors, (17), 17 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-10 01:32:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 381 transitions. [2025-01-10 01:32:16,688 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 381 transitions. Word has length 253 [2025-01-10 01:32:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:16,689 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 381 transitions. [2025-01-10 01:32:16,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:32:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 381 transitions. [2025-01-10 01:32:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-01-10 01:32:16,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:16,693 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:16,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:32:16,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:16,898 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:16,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:16,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1206577657, now seen corresponding path program 7 times [2025-01-10 01:32:16,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:16,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041485546] [2025-01-10 01:32:16,898 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:32:16,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:16,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-01-10 01:32:16,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-01-10 01:32:16,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:16,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5344 backedges. 3154 proven. 138 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2025-01-10 01:32:17,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:17,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041485546] [2025-01-10 01:32:17,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041485546] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:17,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666739650] [2025-01-10 01:32:17,586 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:32:17,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:17,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:17,588 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:32:17,593 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:32:17,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-01-10 01:32:17,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-01-10 01:32:17,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:17,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:17,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-10 01:32:17,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5344 backedges. 2901 proven. 311 refuted. 0 times theorem prover too weak. 2132 trivial. 0 not checked. [2025-01-10 01:32:18,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5344 backedges. 2901 proven. 311 refuted. 0 times theorem prover too weak. 2132 trivial. 0 not checked. [2025-01-10 01:32:21,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666739650] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:21,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:21,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33, 33] total 44 [2025-01-10 01:32:21,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078248483] [2025-01-10 01:32:21,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:21,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-10 01:32:21,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:21,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-10 01:32:21,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1691, Unknown=0, NotChecked=0, Total=1892 [2025-01-10 01:32:21,951 INFO L87 Difference]: Start difference. First operand 350 states and 381 transitions. Second operand has 44 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 37 states have internal predecessors, (107), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-10 01:32:23,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:23,046 INFO L93 Difference]: Finished difference Result 815 states and 887 transitions. [2025-01-10 01:32:23,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-01-10 01:32:23,047 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 37 states have internal predecessors, (107), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) Word has length 286 [2025-01-10 01:32:23,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:23,049 INFO L225 Difference]: With dead ends: 815 [2025-01-10 01:32:23,049 INFO L226 Difference]: Without dead ends: 568 [2025-01-10 01:32:23,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 522 SyntacticMatches, 31 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3323 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=823, Invalid=6659, Unknown=0, NotChecked=0, Total=7482 [2025-01-10 01:32:23,051 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:23,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 493 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 01:32:23,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-01-10 01:32:23,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 441. [2025-01-10 01:32:23,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 416 states have (on average 1.0793269230769231) internal successors, (449), 416 states have internal predecessors, (449), 3 states have call successors, (3), 2 states have call predecessors, (3), 21 states have return successors, (22), 22 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-10 01:32:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 474 transitions. [2025-01-10 01:32:23,080 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 474 transitions. Word has length 286 [2025-01-10 01:32:23,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:23,080 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 474 transitions. [2025-01-10 01:32:23,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 37 states have internal predecessors, (107), 1 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (9), 9 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-10 01:32:23,081 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 474 transitions. [2025-01-10 01:32:23,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-01-10 01:32:23,083 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:23,083 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:23,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:32:23,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:23,284 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:23,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:23,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1077437411, now seen corresponding path program 8 times [2025-01-10 01:32:23,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:23,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735967485] [2025-01-10 01:32:23,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:32:23,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:23,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 292 statements into 2 equivalence classes. [2025-01-10 01:32:23,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 292 of 292 statements. [2025-01-10 01:32:23,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:32:23,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:24,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5687 backedges. 3524 proven. 195 refuted. 0 times theorem prover too weak. 1968 trivial. 0 not checked. [2025-01-10 01:32:24,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:24,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735967485] [2025-01-10 01:32:24,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735967485] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:24,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511652971] [2025-01-10 01:32:24,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:32:24,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:24,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:24,174 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:32:24,176 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:32:24,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 292 statements into 2 equivalence classes. [2025-01-10 01:32:24,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 292 of 292 statements. [2025-01-10 01:32:24,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:32:24,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:24,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-10 01:32:24,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5687 backedges. 3523 proven. 499 refuted. 0 times theorem prover too weak. 1665 trivial. 0 not checked. [2025-01-10 01:32:24,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:30,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5687 backedges. 3523 proven. 499 refuted. 0 times theorem prover too weak. 1665 trivial. 0 not checked. [2025-01-10 01:32:30,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511652971] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:30,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:30,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 38, 38] total 51 [2025-01-10 01:32:30,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343383024] [2025-01-10 01:32:30,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:30,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-01-10 01:32:30,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:30,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-01-10 01:32:30,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=2293, Unknown=0, NotChecked=0, Total=2550 [2025-01-10 01:32:30,350 INFO L87 Difference]: Start difference. First operand 441 states and 474 transitions. Second operand has 51 states, 51 states have (on average 2.372549019607843) internal successors, (121), 43 states have internal predecessors, (121), 1 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (10), 10 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-10 01:32:31,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:31,957 INFO L93 Difference]: Finished difference Result 896 states and 961 transitions. [2025-01-10 01:32:31,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2025-01-10 01:32:31,957 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.372549019607843) internal successors, (121), 43 states have internal predecessors, (121), 1 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (10), 10 states have call predecessors, (10), 1 states have call successors, (10) Word has length 292 [2025-01-10 01:32:31,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:31,960 INFO L225 Difference]: With dead ends: 896 [2025-01-10 01:32:31,960 INFO L226 Difference]: Without dead ends: 634 [2025-01-10 01:32:31,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 526 SyntacticMatches, 36 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5177 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1249, Invalid=10523, Unknown=0, NotChecked=0, Total=11772 [2025-01-10 01:32:31,963 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 2723 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:31,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 642 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2723 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 01:32:31,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-01-10 01:32:32,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 554. [2025-01-10 01:32:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 524 states have (on average 1.0687022900763359) internal successors, (560), 524 states have internal predecessors, (560), 3 states have call successors, (3), 2 states have call predecessors, (3), 26 states have return successors, (27), 27 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-10 01:32:32,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 590 transitions. [2025-01-10 01:32:32,004 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 590 transitions. Word has length 292 [2025-01-10 01:32:32,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:32,005 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 590 transitions. [2025-01-10 01:32:32,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.372549019607843) internal successors, (121), 43 states have internal predecessors, (121), 1 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (10), 10 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-10 01:32:32,005 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 590 transitions. [2025-01-10 01:32:32,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-01-10 01:32:32,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:32,007 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:32,016 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:32:32,211 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,SelfDestructingSolverStorable15 [2025-01-10 01:32:32,211 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:32,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:32,211 INFO L85 PathProgramCache]: Analyzing trace with hash 896320775, now seen corresponding path program 9 times [2025-01-10 01:32:32,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:32,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487449905] [2025-01-10 01:32:32,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:32:32,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:32,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 298 statements into 14 equivalence classes. [2025-01-10 01:32:32,236 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 231 of 298 statements. [2025-01-10 01:32:32,236 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-01-10 01:32:32,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6042 backedges. 2878 proven. 965 refuted. 0 times theorem prover too weak. 2199 trivial. 0 not checked. [2025-01-10 01:32:32,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:32,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487449905] [2025-01-10 01:32:32,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487449905] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:32,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630937135] [2025-01-10 01:32:32,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:32:32,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:32,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:32,615 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:32:32,619 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:32:32,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 298 statements into 14 equivalence classes. [2025-01-10 01:32:32,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 231 of 298 statements. [2025-01-10 01:32:32,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-01-10 01:32:32,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:32,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 01:32:32,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6042 backedges. 2878 proven. 965 refuted. 0 times theorem prover too weak. 2199 trivial. 0 not checked. [2025-01-10 01:32:32,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6042 backedges. 2878 proven. 965 refuted. 0 times theorem prover too weak. 2199 trivial. 0 not checked. [2025-01-10 01:32:34,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630937135] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:34,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:34,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 47 [2025-01-10 01:32:34,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345550707] [2025-01-10 01:32:34,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:34,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-10 01:32:34,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:34,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-10 01:32:34,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1835, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 01:32:34,103 INFO L87 Difference]: Start difference. First operand 554 states and 590 transitions. Second operand has 48 states, 47 states have (on average 2.1702127659574466) internal successors, (102), 44 states have internal predecessors, (102), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:32:35,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:35,830 INFO L93 Difference]: Finished difference Result 2178 states and 2457 transitions. [2025-01-10 01:32:35,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2025-01-10 01:32:35,830 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.1702127659574466) internal successors, (102), 44 states have internal predecessors, (102), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 298 [2025-01-10 01:32:35,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:35,837 INFO L225 Difference]: With dead ends: 2178 [2025-01-10 01:32:35,837 INFO L226 Difference]: Without dead ends: 2040 [2025-01-10 01:32:35,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 571 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6227 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3858, Invalid=14502, Unknown=0, NotChecked=0, Total=18360 [2025-01-10 01:32:35,843 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:35,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:32:35,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2025-01-10 01:32:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 639. [2025-01-10 01:32:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 609 states have (on average 1.090311986863711) internal successors, (664), 609 states have internal predecessors, (664), 3 states have call successors, (3), 2 states have call predecessors, (3), 26 states have return successors, (27), 27 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-10 01:32:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 694 transitions. [2025-01-10 01:32:35,907 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 694 transitions. Word has length 298 [2025-01-10 01:32:35,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:35,907 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 694 transitions. [2025-01-10 01:32:35,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.1702127659574466) internal successors, (102), 44 states have internal predecessors, (102), 1 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 01:32:35,908 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 694 transitions. [2025-01-10 01:32:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-10 01:32:35,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:35,910 INFO L218 NwaCegarLoop]: trace histogram [76, 76, 76, 14, 13, 13, 13, 13, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:35,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 01:32:36,110 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,SelfDestructingSolverStorable16 [2025-01-10 01:32:36,112 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:36,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:36,112 INFO L85 PathProgramCache]: Analyzing trace with hash -405205347, now seen corresponding path program 10 times [2025-01-10 01:32:36,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:36,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123317673] [2025-01-10 01:32:36,112 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:32:36,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:36,123 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 365 statements into 2 equivalence classes. [2025-01-10 01:32:36,157 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 365 of 365 statements. [2025-01-10 01:32:36,158 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:32:36,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10132 backedges. 4586 proven. 1038 refuted. 0 times theorem prover too weak. 4508 trivial. 0 not checked. [2025-01-10 01:32:36,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:36,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123317673] [2025-01-10 01:32:36,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123317673] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:36,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13398646] [2025-01-10 01:32:36,945 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:32:36,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:36,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:36,946 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:32:36,950 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:32:37,117 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 365 statements into 2 equivalence classes. [2025-01-10 01:32:37,182 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 365 of 365 statements. [2025-01-10 01:32:37,182 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:32:37,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:37,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-10 01:32:37,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:37,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10132 backedges. 4157 proven. 765 refuted. 0 times theorem prover too weak. 5210 trivial. 0 not checked. [2025-01-10 01:32:37,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 10132 backedges. 4157 proven. 765 refuted. 0 times theorem prover too weak. 5210 trivial. 0 not checked. [2025-01-10 01:32:41,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13398646] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:41,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:41,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 70 [2025-01-10 01:32:41,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214390572] [2025-01-10 01:32:41,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:41,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2025-01-10 01:32:41,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:41,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2025-01-10 01:32:41,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=4348, Unknown=0, NotChecked=0, Total=4830 [2025-01-10 01:32:41,627 INFO L87 Difference]: Start difference. First operand 639 states and 694 transitions. Second operand has 70 states, 70 states have (on average 2.1285714285714286) internal successors, (149), 62 states have internal predecessors, (149), 1 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (10), 10 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-10 01:32:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:43,306 INFO L93 Difference]: Finished difference Result 1244 states and 1397 transitions. [2025-01-10 01:32:43,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2025-01-10 01:32:43,307 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.1285714285714286) internal successors, (149), 62 states have internal predecessors, (149), 1 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (10), 10 states have call predecessors, (10), 1 states have call successors, (10) Word has length 365 [2025-01-10 01:32:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:43,309 INFO L225 Difference]: With dead ends: 1244 [2025-01-10 01:32:43,309 INFO L226 Difference]: Without dead ends: 668 [2025-01-10 01:32:43,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 664 SyntacticMatches, 32 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9230 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3205, Invalid=19145, Unknown=0, NotChecked=0, Total=22350 [2025-01-10 01:32:43,313 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:43,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 253 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:32:43,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-01-10 01:32:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 391. [2025-01-10 01:32:43,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 375 states have (on average 1.096) internal successors, (411), 375 states have internal predecessors, (411), 3 states have call successors, (3), 2 states have call predecessors, (3), 12 states have return successors, (13), 13 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-10 01:32:43,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 427 transitions. [2025-01-10 01:32:43,346 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 427 transitions. Word has length 365 [2025-01-10 01:32:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:43,347 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 427 transitions. [2025-01-10 01:32:43,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 2.1285714285714286) internal successors, (149), 62 states have internal predecessors, (149), 1 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (10), 10 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-10 01:32:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 427 transitions. [2025-01-10 01:32:43,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-01-10 01:32:43,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:43,349 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:43,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 01:32:43,553 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,SelfDestructingSolverStorable17 [2025-01-10 01:32:43,553 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:43,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:43,553 INFO L85 PathProgramCache]: Analyzing trace with hash -526878803, now seen corresponding path program 11 times [2025-01-10 01:32:43,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:43,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776126014] [2025-01-10 01:32:43,554 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:32:43,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:43,564 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 390 statements into 18 equivalence classes. [2025-01-10 01:32:43,587 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 304 of 390 statements. [2025-01-10 01:32:43,587 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-01-10 01:32:43,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12216 backedges. 6263 proven. 400 refuted. 0 times theorem prover too weak. 5553 trivial. 0 not checked. [2025-01-10 01:32:44,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:44,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776126014] [2025-01-10 01:32:44,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776126014] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:44,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540154756] [2025-01-10 01:32:44,273 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:32:44,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:44,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:44,278 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:32:44,281 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:32:44,501 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 390 statements into 18 equivalence classes. [2025-01-10 01:32:44,563 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 304 of 390 statements. [2025-01-10 01:32:44,564 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-01-10 01:32:44,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:44,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 01:32:44,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:44,780 INFO L134 CoverageAnalysis]: Checked inductivity of 12216 backedges. 5750 proven. 1090 refuted. 0 times theorem prover too weak. 5376 trivial. 0 not checked. [2025-01-10 01:32:44,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 12216 backedges. 5750 proven. 1090 refuted. 0 times theorem prover too weak. 5376 trivial. 0 not checked. [2025-01-10 01:32:48,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540154756] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:48,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:48,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 37, 37] total 48 [2025-01-10 01:32:48,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924242572] [2025-01-10 01:32:48,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:48,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-10 01:32:48,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:48,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-10 01:32:48,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2041, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 01:32:48,116 INFO L87 Difference]: Start difference. First operand 391 states and 427 transitions. Second operand has 48 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 43 states have internal predecessors, (109), 1 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 01:32:48,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:48,839 INFO L93 Difference]: Finished difference Result 692 states and 764 transitions. [2025-01-10 01:32:48,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-01-10 01:32:48,840 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 43 states have internal predecessors, (109), 1 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) Word has length 390 [2025-01-10 01:32:48,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:48,841 INFO L225 Difference]: With dead ends: 692 [2025-01-10 01:32:48,841 INFO L226 Difference]: Without dead ends: 418 [2025-01-10 01:32:48,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 863 GetRequests, 737 SyntacticMatches, 29 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3835 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1112, Invalid=8590, Unknown=0, NotChecked=0, Total=9702 [2025-01-10 01:32:48,843 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:48,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:32:48,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-01-10 01:32:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-01-10 01:32:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 401 states have (on average 1.0897755610972568) internal successors, (437), 401 states have internal predecessors, (437), 3 states have call successors, (3), 2 states have call predecessors, (3), 13 states have return successors, (14), 14 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-10 01:32:48,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 454 transitions. [2025-01-10 01:32:48,878 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 454 transitions. Word has length 390 [2025-01-10 01:32:48,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:48,878 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 454 transitions. [2025-01-10 01:32:48,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 43 states have internal predecessors, (109), 1 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-10 01:32:48,878 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 454 transitions. [2025-01-10 01:32:48,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-01-10 01:32:48,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:48,881 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:48,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 01:32:49,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:49,082 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:32:49,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:49,083 INFO L85 PathProgramCache]: Analyzing trace with hash -867065657, now seen corresponding path program 12 times [2025-01-10 01:32:49,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:49,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107753624] [2025-01-10 01:32:49,083 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:32:49,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:49,095 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 422 statements into 18 equivalence classes. [2025-01-10 01:32:49,135 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) and asserted 422 of 422 statements. [2025-01-10 01:32:49,135 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2025-01-10 01:32:49,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 14352 backedges. 617 proven. 11849 refuted. 0 times theorem prover too weak. 1886 trivial. 0 not checked. [2025-01-10 01:32:50,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:50,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107753624] [2025-01-10 01:32:50,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107753624] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:50,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423764901] [2025-01-10 01:32:50,199 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:32:50,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:50,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:50,202 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:32:50,204 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:32:50,540 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 422 statements into 18 equivalence classes. [2025-01-10 01:32:50,666 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) and asserted 422 of 422 statements. [2025-01-10 01:32:50,667 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2025-01-10 01:32:50,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:50,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 01:32:50,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 14352 backedges. 617 proven. 11849 refuted. 0 times theorem prover too weak. 1886 trivial. 0 not checked. [2025-01-10 01:32:50,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 14352 backedges. 617 proven. 11849 refuted. 0 times theorem prover too weak. 1886 trivial. 0 not checked. [2025-01-10 01:32:58,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423764901] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:58,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:58,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2025-01-10 01:32:58,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27969165] [2025-01-10 01:32:58,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:58,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2025-01-10 01:32:58,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:58,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2025-01-10 01:32:58,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=837, Invalid=4565, Unknown=0, NotChecked=0, Total=5402 [2025-01-10 01:32:58,961 INFO L87 Difference]: Start difference. First operand 418 states and 454 transitions. Second operand has 74 states, 73 states have (on average 2.684931506849315) internal successors, (196), 54 states have internal predecessors, (196), 1 states have call successors, (2), 1 states have call predecessors, (2), 21 states have return successors, (21), 21 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-10 01:33:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:03,108 INFO L93 Difference]: Finished difference Result 3798 states and 4271 transitions. [2025-01-10 01:33:03,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2025-01-10 01:33:03,109 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 2.684931506849315) internal successors, (196), 54 states have internal predecessors, (196), 1 states have call successors, (2), 1 states have call predecessors, (2), 21 states have return successors, (21), 21 states have call predecessors, (21), 1 states have call successors, (21) Word has length 422 [2025-01-10 01:33:03,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:03,118 INFO L225 Difference]: With dead ends: 3798 [2025-01-10 01:33:03,119 INFO L226 Difference]: Without dead ends: 3225 [2025-01-10 01:33:03,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1019 GetRequests, 807 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16748 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=8167, Invalid=37415, Unknown=0, NotChecked=0, Total=45582 [2025-01-10 01:33:03,124 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:03,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:33:03,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2025-01-10 01:33:03,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 715. [2025-01-10 01:33:03,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 687 states have (on average 1.0684133915574963) internal successors, (734), 687 states have internal predecessors, (734), 3 states have call successors, (3), 2 states have call predecessors, (3), 24 states have return successors, (25), 25 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-10 01:33:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 762 transitions. [2025-01-10 01:33:03,262 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 762 transitions. Word has length 422 [2025-01-10 01:33:03,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:03,263 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 762 transitions. [2025-01-10 01:33:03,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 2.684931506849315) internal successors, (196), 54 states have internal predecessors, (196), 1 states have call successors, (2), 1 states have call predecessors, (2), 21 states have return successors, (21), 21 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-10 01:33:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 762 transitions. [2025-01-10 01:33:03,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2025-01-10 01:33:03,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:03,268 INFO L218 NwaCegarLoop]: trace histogram [168, 168, 168, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:03,277 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:33:03,473 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:33:03,473 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:33:03,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:03,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1553403437, now seen corresponding path program 13 times [2025-01-10 01:33:03,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:03,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206861050] [2025-01-10 01:33:03,474 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:33:03,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:03,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 774 statements into 1 equivalence classes. [2025-01-10 01:33:03,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 774 of 774 statements. [2025-01-10 01:33:03,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:03,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 49200 backedges. 26629 proven. 648 refuted. 0 times theorem prover too weak. 21923 trivial. 0 not checked. [2025-01-10 01:33:05,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:05,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206861050] [2025-01-10 01:33:05,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206861050] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:05,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467633477] [2025-01-10 01:33:05,331 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:33:05,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:05,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:05,334 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:33:05,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 01:33:05,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 774 statements into 1 equivalence classes. [2025-01-10 01:33:05,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 774 of 774 statements. [2025-01-10 01:33:05,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:33:05,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:05,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 1742 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-10 01:33:05,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:06,367 INFO L134 CoverageAnalysis]: Checked inductivity of 49200 backedges. 17837 proven. 750 refuted. 0 times theorem prover too weak. 30613 trivial. 0 not checked. [2025-01-10 01:33:06,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 49200 backedges. 17837 proven. 750 refuted. 0 times theorem prover too weak. 30613 trivial. 0 not checked. [2025-01-10 01:33:23,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467633477] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:23,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:23,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 43, 43] total 61 [2025-01-10 01:33:23,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85827516] [2025-01-10 01:33:23,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:23,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-01-10 01:33:23,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:23,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-01-10 01:33:23,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=3306, Unknown=0, NotChecked=0, Total=3660 [2025-01-10 01:33:24,000 INFO L87 Difference]: Start difference. First operand 715 states and 762 transitions. Second operand has 61 states, 61 states have (on average 2.3442622950819674) internal successors, (143), 51 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (12), 12 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-10 01:33:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:26,381 INFO L93 Difference]: Finished difference Result 1328 states and 1443 transitions. [2025-01-10 01:33:26,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2025-01-10 01:33:26,381 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.3442622950819674) internal successors, (143), 51 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (12), 12 states have call predecessors, (12), 1 states have call successors, (12) Word has length 774 [2025-01-10 01:33:26,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:26,384 INFO L225 Difference]: With dead ends: 1328 [2025-01-10 01:33:26,384 INFO L226 Difference]: Without dead ends: 784 [2025-01-10 01:33:26,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1676 GetRequests, 1484 SyntacticMatches, 41 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9401 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2434, Invalid=20822, Unknown=0, NotChecked=0, Total=23256 [2025-01-10 01:33:26,389 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 3045 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 3052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:26,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 620 Invalid, 3052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3045 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 01:33:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2025-01-10 01:33:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2025-01-10 01:33:26,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 756 states have (on average 1.0515873015873016) internal successors, (795), 756 states have internal predecessors, (795), 3 states have call successors, (3), 2 states have call predecessors, (3), 24 states have return successors, (25), 25 states have call predecessors, (25), 2 states have call successors, (25) [2025-01-10 01:33:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 823 transitions. [2025-01-10 01:33:26,569 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 823 transitions. Word has length 774 [2025-01-10 01:33:26,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:26,571 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 823 transitions. [2025-01-10 01:33:26,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.3442622950819674) internal successors, (143), 51 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (12), 12 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-10 01:33:26,571 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 823 transitions. [2025-01-10 01:33:26,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2025-01-10 01:33:26,575 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:26,575 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 191, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:26,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-10 01:33:26,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:26,777 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:33:26,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:26,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1772583059, now seen corresponding path program 14 times [2025-01-10 01:33:26,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:26,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648942158] [2025-01-10 01:33:26,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:33:26,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:26,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 843 statements into 2 equivalence classes. [2025-01-10 01:33:27,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 843 of 843 statements. [2025-01-10 01:33:27,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:33:27,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 62103 backedges. 29745 proven. 420 refuted. 0 times theorem prover too weak. 31938 trivial. 0 not checked. [2025-01-10 01:33:28,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:28,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648942158] [2025-01-10 01:33:28,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648942158] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:28,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239366610] [2025-01-10 01:33:28,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:33:28,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:28,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:28,728 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:33:28,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 01:33:29,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 843 statements into 2 equivalence classes. [2025-01-10 01:33:29,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 843 of 843 statements. [2025-01-10 01:33:29,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:33:29,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:29,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 1903 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-10 01:33:29,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:30,180 INFO L134 CoverageAnalysis]: Checked inductivity of 62103 backedges. 28570 proven. 1477 refuted. 0 times theorem prover too weak. 32056 trivial. 0 not checked. [2025-01-10 01:33:30,180 INFO L312 TraceCheckSpWp]: Computing backward predicates...