./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/rec_counter3.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_counter3.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 d7b4f33979632a981e739ff06b52fe01aa9fb175d5e5193b145052887f22f8a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:32:02,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:32:02,724 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:02,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:32:02,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:32:02,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:32:02,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:32:02,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:32:02,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:32:02,753 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:32:02,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:32:02,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:32:02,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:32:02,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:32:02,753 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:32:02,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:32:02,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:32:02,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:32:02,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:32:02,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:32:02,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:32:02,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:32:02,755 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:32:02,755 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:32:02,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:32:02,755 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:32:02,755 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:32:02,755 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:32:02,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:32:02,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:32:02,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:32:02,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:32:02,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:32:02,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:32:02,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:32:02,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:32:02,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:32:02,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:32:02,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:32:02,756 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:32:02,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:32:02,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:32:02,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:32:02,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:32:02,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:32:02,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:32:02,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:32:02,756 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 -> d7b4f33979632a981e739ff06b52fe01aa9fb175d5e5193b145052887f22f8a3 [2025-01-10 01:32:02,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:32:02,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:32:02,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:32:02,960 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:32:02,960 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:32:02,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/rec_counter3.c [2025-01-10 01:32:04,094 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99aeb5cbc/31d93411ef4746ee8e69e3d6df19e4eb/FLAG911a1d766 [2025-01-10 01:32:04,285 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:32:04,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-numeric/rec_counter3.c [2025-01-10 01:32:04,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99aeb5cbc/31d93411ef4746ee8e69e3d6df19e4eb/FLAG911a1d766 [2025-01-10 01:32:04,315 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99aeb5cbc/31d93411ef4746ee8e69e3d6df19e4eb [2025-01-10 01:32:04,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:32:04,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:32:04,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:32:04,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:32:04,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:32:04,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:32:04" (1/1) ... [2025-01-10 01:32:04,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3291da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:04, skipping insertion in model container [2025-01-10 01:32:04,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:32:04" (1/1) ... [2025-01-10 01:32:04,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:32:04,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:32:04,434 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:32:04,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:32:04,450 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:32:04,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:04 WrapperNode [2025-01-10 01:32:04,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:32:04,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:32:04,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:32:04,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:32:04,458 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:04" (1/1) ... [2025-01-10 01:32:04,461 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:04" (1/1) ... [2025-01-10 01:32:04,469 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 14 [2025-01-10 01:32:04,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:32:04,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:32:04,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:32:04,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:32:04,477 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:04" (1/1) ... [2025-01-10 01:32:04,477 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:04" (1/1) ... [2025-01-10 01:32:04,478 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:04" (1/1) ... [2025-01-10 01:32:04,482 INFO L175 MemorySlicer]: No memory access in input program. [2025-01-10 01:32:04,482 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:04" (1/1) ... [2025-01-10 01:32:04,482 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:04" (1/1) ... [2025-01-10 01:32:04,484 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:04" (1/1) ... [2025-01-10 01:32:04,484 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:04" (1/1) ... [2025-01-10 01:32:04,486 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:04" (1/1) ... [2025-01-10 01:32:04,487 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:04" (1/1) ... [2025-01-10 01:32:04,487 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:04" (1/1) ... [2025-01-10 01:32:04,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:32:04,490 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:32:04,490 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:32:04,490 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:32:04,491 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:04" (1/1) ... [2025-01-10 01:32:04,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:32:04,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:04,516 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,518 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,539 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2025-01-10 01:32:04,539 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2025-01-10 01:32:04,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:32:04,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:32:04,574 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:32:04,575 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:32:04,662 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-10 01:32:04,663 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:32:04,670 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:32:04,670 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:32:04,671 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,671 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:32:04,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:32:04,673 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:32:04,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:32:04,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:32:04" (1/3) ... [2025-01-10 01:32:04,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3bc5c7 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,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:32:04" (2/3) ... [2025-01-10 01:32:04,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3bc5c7 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,679 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,680 INFO L128 eAbstractionObserver]: Analyzing ICFG rec_counter3.c [2025-01-10 01:32:04,691 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:32:04,692 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rec_counter3.c that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-01-10 01:32:04,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:32:04,744 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;@5a317567, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:32:04,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 01:32:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 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,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:32:04,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:04,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:04,751 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,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:04,756 INFO L85 PathProgramCache]: Analyzing trace with hash -118405008, now seen corresponding path program 1 times [2025-01-10 01:32:04,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:04,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545024140] [2025-01-10 01:32:04,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:04,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:04,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:32:04,814 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,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:04,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:04,889 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,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:04,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545024140] [2025-01-10 01:32:04,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545024140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:32:04,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:32:04,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:32:04,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028273262] [2025-01-10 01:32:04,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:32:04,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:32:04,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:04,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:32:04,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:32:04,906 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 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,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:04,979 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2025-01-10 01:32:04,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:32:04,981 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,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:04,984 INFO L225 Difference]: With dead ends: 55 [2025-01-10 01:32:04,984 INFO L226 Difference]: Without dead ends: 39 [2025-01-10 01:32:04,986 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,987 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 100 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,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 100 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,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-10 01:32:05,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2025-01-10 01:32:05,010 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:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2025-01-10 01:32:05,015 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 7 [2025-01-10 01:32:05,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:05,016 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-01-10 01:32:05,016 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:05,016 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2025-01-10 01:32:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:32:05,017 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:05,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:05,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:32:05,018 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:05,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:05,019 INFO L85 PathProgramCache]: Analyzing trace with hash 624412086, now seen corresponding path program 1 times [2025-01-10 01:32:05,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:05,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979244226] [2025-01-10 01:32:05,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:05,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:05,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:32:05,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:32:05,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:05,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:05,073 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:05,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:05,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979244226] [2025-01-10 01:32:05,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979244226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:32:05,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:32:05,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:32:05,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882606113] [2025-01-10 01:32:05,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:32:05,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:32:05,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:05,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:32:05,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:32:05,075 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:05,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:05,129 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2025-01-10 01:32:05,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:32:05,130 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:05,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:05,131 INFO L225 Difference]: With dead ends: 36 [2025-01-10 01:32:05,131 INFO L226 Difference]: Without dead ends: 35 [2025-01-10 01:32:05,132 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:05,132 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:05,132 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:05,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-10 01:32:05,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-01-10 01:32:05,144 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:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-01-10 01:32:05,146 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 8 [2025-01-10 01:32:05,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:05,146 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-01-10 01:32:05,146 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:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-01-10 01:32:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:32:05,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:05,146 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:05,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:32:05,147 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:05,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:05,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1812691093, now seen corresponding path program 1 times [2025-01-10 01:32:05,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:05,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449035252] [2025-01-10 01:32:05,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:05,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:05,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:32:05,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:32:05,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:05,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:05,229 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:05,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:05,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449035252] [2025-01-10 01:32:05,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449035252] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:05,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362161733] [2025-01-10 01:32:05,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:05,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:05,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:05,234 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:05,237 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:05,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:32:05,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:32:05,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:05,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:05,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:32:05,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:05,307 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:05,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:05,383 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:05,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362161733] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:05,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:05,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 01:32:05,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143541306] [2025-01-10 01:32:05,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:05,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:32:05,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:05,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:32:05,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:32:05,384 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:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:05,440 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2025-01-10 01:32:05,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:32:05,441 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:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:05,442 INFO L225 Difference]: With dead ends: 39 [2025-01-10 01:32:05,442 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 01:32:05,443 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:05,445 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 89 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:05,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 82 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:32:05,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 01:32:05,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2025-01-10 01:32:05,450 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:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-01-10 01:32:05,452 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 12 [2025-01-10 01:32:05,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:05,453 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-01-10 01:32:05,453 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:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-01-10 01:32:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:32:05,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:05,453 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,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:32:05,658 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,658 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,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:05,659 INFO L85 PathProgramCache]: Analyzing trace with hash -306780035, now seen corresponding path program 1 times [2025-01-10 01:32:05,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:05,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244102127] [2025-01-10 01:32:05,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:05,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:05,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:32:05,665 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,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:05,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:05,688 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,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:05,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244102127] [2025-01-10 01:32:05,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244102127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:32:05,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:32:05,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:32:05,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564044521] [2025-01-10 01:32:05,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:32:05,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:32:05,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:05,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:32:05,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:32:05,690 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,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:05,710 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-01-10 01:32:05,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:32:05,711 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,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:05,712 INFO L225 Difference]: With dead ends: 32 [2025-01-10 01:32:05,712 INFO L226 Difference]: Without dead ends: 31 [2025-01-10 01:32:05,712 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,712 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,712 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,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-10 01:32:05,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-01-10 01:32:05,715 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,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-01-10 01:32:05,716 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 16 [2025-01-10 01:32:05,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:05,716 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-01-10 01:32:05,716 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,716 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-01-10 01:32:05,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:32:05,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:05,717 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,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:32:05,717 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,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:05,717 INFO L85 PathProgramCache]: Analyzing trace with hash -306780227, now seen corresponding path program 1 times [2025-01-10 01:32:05,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:05,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196829834] [2025-01-10 01:32:05,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:05,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:05,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:32:05,724 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,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:05,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:05,751 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,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:05,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196829834] [2025-01-10 01:32:05,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196829834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:32:05,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:32:05,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:32:05,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066693731] [2025-01-10 01:32:05,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:32:05,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:32:05,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:05,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:32:05,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:32:05,753 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,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:05,760 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-01-10 01:32:05,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:32:05,760 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,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:05,761 INFO L225 Difference]: With dead ends: 31 [2025-01-10 01:32:05,761 INFO L226 Difference]: Without dead ends: 30 [2025-01-10 01:32:05,761 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,761 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,762 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,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-10 01:32:05,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-01-10 01:32:05,764 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,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-01-10 01:32:05,765 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 16 [2025-01-10 01:32:05,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:05,765 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-01-10 01:32:05,765 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,765 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2025-01-10 01:32:05,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 01:32:05,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:05,767 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,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:32:05,770 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,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:05,770 INFO L85 PathProgramCache]: Analyzing trace with hash -920246439, now seen corresponding path program 1 times [2025-01-10 01:32:05,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:05,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607435751] [2025-01-10 01:32:05,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:05,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:05,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:32:05,776 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,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:05,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:05,814 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,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:05,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607435751] [2025-01-10 01:32:05,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607435751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:32:05,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:32:05,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:32:05,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100073672] [2025-01-10 01:32:05,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:32:05,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:32:05,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:05,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:32:05,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:32:05,816 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,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:05,836 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-01-10 01:32:05,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:32:05,836 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,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:05,837 INFO L225 Difference]: With dead ends: 37 [2025-01-10 01:32:05,837 INFO L226 Difference]: Without dead ends: 34 [2025-01-10 01:32:05,837 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,838 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,838 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,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-10 01:32:05,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-01-10 01:32:05,842 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,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-01-10 01:32:05,842 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 17 [2025-01-10 01:32:05,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:05,842 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-01-10 01:32:05,842 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,842 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2025-01-10 01:32:05,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 01:32:05,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:05,843 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,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:32:05,843 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,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:05,843 INFO L85 PathProgramCache]: Analyzing trace with hash -920252397, now seen corresponding path program 1 times [2025-01-10 01:32:05,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:05,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188335619] [2025-01-10 01:32:05,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:05,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:05,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:32:05,848 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,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:05,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:05,890 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,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:05,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188335619] [2025-01-10 01:32:05,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188335619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:32:05,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:32:05,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:32:05,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008663832] [2025-01-10 01:32:05,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:32:05,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:32:05,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:05,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:32:05,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:32:05,892 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,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:05,904 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2025-01-10 01:32:05,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:32:05,905 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,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:05,905 INFO L225 Difference]: With dead ends: 60 [2025-01-10 01:32:05,905 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 01:32:05,906 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,907 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,907 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,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 01:32:05,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-10 01:32:05,912 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,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-01-10 01:32:05,914 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 17 [2025-01-10 01:32:05,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:05,914 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-01-10 01:32:05,914 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,915 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-01-10 01:32:05,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 01:32:05,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:05,915 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,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:32:05,915 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,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:05,916 INFO L85 PathProgramCache]: Analyzing trace with hash 489146319, now seen corresponding path program 1 times [2025-01-10 01:32:05,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:05,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976121979] [2025-01-10 01:32:05,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:05,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:05,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:32:05,930 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,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:05,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:06,014 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:06,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:06,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976121979] [2025-01-10 01:32:06,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976121979] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:06,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648861522] [2025-01-10 01:32:06,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:06,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:06,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:06,017 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:06,018 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:06,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:32:06,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:32:06,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:06,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:06,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:32:06,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:06,089 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:06,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:32:06,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648861522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:32:06,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:32:06,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-01-10 01:32:06,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061938474] [2025-01-10 01:32:06,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:32:06,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:32:06,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:06,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:32:06,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:32:06,090 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:06,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:06,105 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2025-01-10 01:32:06,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:32:06,105 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:06,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:06,105 INFO L225 Difference]: With dead ends: 38 [2025-01-10 01:32:06,105 INFO L226 Difference]: Without dead ends: 37 [2025-01-10 01:32:06,106 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:06,106 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:06,106 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:06,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-10 01:32:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-10 01:32:06,112 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:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-01-10 01:32:06,112 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 28 [2025-01-10 01:32:06,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:06,113 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-01-10 01:32:06,113 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:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-01-10 01:32:06,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 01:32:06,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:06,115 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:06,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:32:06,315 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:06,316 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:06,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:06,316 INFO L85 PathProgramCache]: Analyzing trace with hash -665996283, now seen corresponding path program 1 times [2025-01-10 01:32:06,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:06,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405037711] [2025-01-10 01:32:06,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:06,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:06,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:32:06,323 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,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:06,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:06,373 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,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:06,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405037711] [2025-01-10 01:32:06,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405037711] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:06,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561662230] [2025-01-10 01:32:06,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:32:06,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:06,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:06,376 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,376 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,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:32:06,399 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,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:06,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:06,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:32:06,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:06,456 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,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:06,607 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,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561662230] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:06,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:06,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2025-01-10 01:32:06,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801929877] [2025-01-10 01:32:06,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:06,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:32:06,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:06,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:32:06,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:32:06,608 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,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:06,783 INFO L93 Difference]: Finished difference Result 110 states and 137 transitions. [2025-01-10 01:32:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-10 01:32:06,783 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,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:06,784 INFO L225 Difference]: With dead ends: 110 [2025-01-10 01:32:06,784 INFO L226 Difference]: Without dead ends: 79 [2025-01-10 01:32:06,785 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,785 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:06,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 138 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:32:06,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-10 01:32:06,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2025-01-10 01:32:06,795 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,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2025-01-10 01:32:06,795 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 31 [2025-01-10 01:32:06,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:06,795 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-01-10 01:32:06,796 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,796 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2025-01-10 01:32:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-10 01:32:06,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:06,797 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,803 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,997 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,997 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,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1602791459, now seen corresponding path program 2 times [2025-01-10 01:32:06,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:06,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896076481] [2025-01-10 01:32:06,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:32:06,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:07,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-01-10 01:32:07,023 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:07,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:32:07,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:07,284 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:07,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:07,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896076481] [2025-01-10 01:32:07,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896076481] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:07,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641261950] [2025-01-10 01:32:07,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:32:07,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:07,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:07,287 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:07,288 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:07,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-01-10 01:32:07,335 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:07,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:32:07,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:07,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:32:07,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:07,430 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,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:08,045 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:08,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641261950] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:08,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:08,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 20 [2025-01-10 01:32:08,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882877336] [2025-01-10 01:32:08,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:08,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 01:32:08,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:08,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 01:32:08,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:32:08,049 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:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:08,164 INFO L93 Difference]: Finished difference Result 143 states and 173 transitions. [2025-01-10 01:32:08,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 01:32:08,164 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:08,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:08,165 INFO L225 Difference]: With dead ends: 143 [2025-01-10 01:32:08,165 INFO L226 Difference]: Without dead ends: 85 [2025-01-10 01:32:08,166 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:08,166 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:08,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:32:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-10 01:32:08,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-01-10 01:32:08,174 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:08,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2025-01-10 01:32:08,174 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 82 [2025-01-10 01:32:08,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:08,174 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2025-01-10 01:32:08,175 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:08,175 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2025-01-10 01:32:08,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-10 01:32:08,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:08,175 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:08,182 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:08,380 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:08,380 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:08,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:08,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1467585217, now seen corresponding path program 3 times [2025-01-10 01:32:08,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:08,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230541791] [2025-01-10 01:32:08,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:32:08,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:08,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 6 equivalence classes. [2025-01-10 01:32:08,393 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,393 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 01:32:08,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:08,477 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,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230541791] [2025-01-10 01:32:08,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230541791] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935458874] [2025-01-10 01:32:08,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:32:08,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:08,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:08,480 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,482 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,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 6 equivalence classes. [2025-01-10 01:32:08,523 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,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-10 01:32:08,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:08,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:32:08,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:08,558 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,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:08,706 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,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935458874] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:08,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:08,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-01-10 01:32:08,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009824141] [2025-01-10 01:32:08,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:08,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:32:08,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:08,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:32:08,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:32:08,708 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,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:08,751 INFO L93 Difference]: Finished difference Result 175 states and 206 transitions. [2025-01-10 01:32:08,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 01:32:08,752 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,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:08,753 INFO L225 Difference]: With dead ends: 175 [2025-01-10 01:32:08,753 INFO L226 Difference]: Without dead ends: 170 [2025-01-10 01:32:08,753 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,754 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:08,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:32:08,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-10 01:32:08,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 109. [2025-01-10 01:32:08,765 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,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2025-01-10 01:32:08,766 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 88 [2025-01-10 01:32:08,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:08,767 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2025-01-10 01:32:08,767 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,767 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2025-01-10 01:32:08,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-10 01:32:08,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:08,769 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:08,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:32:08,974 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,974 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,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:08,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1215617855, now seen corresponding path program 4 times [2025-01-10 01:32:08,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:08,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191250805] [2025-01-10 01:32:08,974 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:32:08,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:08,979 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 100 statements into 2 equivalence classes. [2025-01-10 01:32:08,987 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-01-10 01:32:08,988 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:32:08,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 156 proven. 88 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2025-01-10 01:32:09,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:09,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191250805] [2025-01-10 01:32:09,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191250805] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:09,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174058690] [2025-01-10 01:32:09,184 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:32:09,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:09,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:09,186 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:09,187 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,217 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 100 statements into 2 equivalence classes. [2025-01-10 01:32:09,236 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-01-10 01:32:09,236 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:32:09,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:09,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:32:09,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 271 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-01-10 01:32:09,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:10,233 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 271 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-01-10 01:32:10,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174058690] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:10,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:10,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 38 [2025-01-10 01:32:10,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122608178] [2025-01-10 01:32:10,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:10,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-10 01:32:10,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:10,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-10 01:32:10,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1263, Unknown=0, NotChecked=0, Total=1482 [2025-01-10 01:32:10,237 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,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:11,120 INFO L93 Difference]: Finished difference Result 436 states and 494 transitions. [2025-01-10 01:32:11,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-01-10 01:32:11,121 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 100 [2025-01-10 01:32:11,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:11,122 INFO L225 Difference]: With dead ends: 436 [2025-01-10 01:32:11,122 INFO L226 Difference]: Without dead ends: 285 [2025-01-10 01:32:11,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3413 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1360, Invalid=7952, Unknown=0, NotChecked=0, Total=9312 [2025-01-10 01:32:11,128 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:11,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 183 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:32:11,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-01-10 01:32:11,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 217. [2025-01-10 01:32:11,150 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,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 240 transitions. [2025-01-10 01:32:11,151 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 240 transitions. Word has length 100 [2025-01-10 01:32:11,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:11,152 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 240 transitions. [2025-01-10 01:32:11,152 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,152 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 240 transitions. [2025-01-10 01:32:11,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-01-10 01:32:11,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:11,172 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,179 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,377 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,377 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,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:11,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1296126523, now seen corresponding path program 5 times [2025-01-10 01:32:11,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:11,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872206248] [2025-01-10 01:32:11,378 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:32:11,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:11,389 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 248 statements into 14 equivalence classes. [2025-01-10 01:32:11,412 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,412 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-01-10 01:32:11,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:11,726 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,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:11,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872206248] [2025-01-10 01:32:11,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872206248] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:11,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539948949] [2025-01-10 01:32:11,728 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:32:11,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:11,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:11,730 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,732 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:11,780 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 248 statements into 14 equivalence classes. [2025-01-10 01:32:11,809 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,809 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-01-10 01:32:11,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:11,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 01:32:11,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:11,915 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:11,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:13,187 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,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539948949] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:13,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:13,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 28 [2025-01-10 01:32:13,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485248426] [2025-01-10 01:32:13,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:13,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 01:32:13,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:13,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 01:32:13,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2025-01-10 01:32:13,189 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:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:13,633 INFO L93 Difference]: Finished difference Result 500 states and 560 transitions. [2025-01-10 01:32:13,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-10 01:32:13,633 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:13,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:13,635 INFO L225 Difference]: With dead ends: 500 [2025-01-10 01:32:13,635 INFO L226 Difference]: Without dead ends: 322 [2025-01-10 01:32:13,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 472 SyntacticMatches, 18 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=422, Invalid=2128, Unknown=0, NotChecked=0, Total=2550 [2025-01-10 01:32:13,636 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:13,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:32:13,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-01-10 01:32:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 305. [2025-01-10 01:32:13,650 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:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 325 transitions. [2025-01-10 01:32:13,651 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 325 transitions. Word has length 248 [2025-01-10 01:32:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:13,652 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 325 transitions. [2025-01-10 01:32:13,652 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:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 325 transitions. [2025-01-10 01:32:13,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-01-10 01:32:13,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:13,655 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 14, 13, 13, 13, 13, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:13,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:32:13,858 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:13,858 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:13,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:13,858 INFO L85 PathProgramCache]: Analyzing trace with hash 218765945, now seen corresponding path program 6 times [2025-01-10 01:32:13,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:13,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121463183] [2025-01-10 01:32:13,859 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:32:13,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:13,866 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 263 statements into 14 equivalence classes. [2025-01-10 01:32:13,900 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 237 of 263 statements. [2025-01-10 01:32:13,901 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-01-10 01:32:13,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3791 backedges. 1332 proven. 155 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [2025-01-10 01:32:14,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:14,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121463183] [2025-01-10 01:32:14,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121463183] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:14,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519516348] [2025-01-10 01:32:14,217 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:32:14,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:14,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:14,220 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:14,221 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:14,277 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 263 statements into 14 equivalence classes. [2025-01-10 01:32:14,325 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 237 of 263 statements. [2025-01-10 01:32:14,325 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-01-10 01:32:14,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:14,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:32:14,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:14,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3791 backedges. 1332 proven. 155 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [2025-01-10 01:32:14,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3791 backedges. 1332 proven. 155 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [2025-01-10 01:32:14,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519516348] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:14,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:14,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2025-01-10 01:32:14,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917089286] [2025-01-10 01:32:14,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:14,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-10 01:32:14,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:14,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-10 01:32:14,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=779, Unknown=0, NotChecked=0, Total=992 [2025-01-10 01:32:14,879 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:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:15,338 INFO L93 Difference]: Finished difference Result 1197 states and 1373 transitions. [2025-01-10 01:32:15,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-01-10 01:32:15,338 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 263 [2025-01-10 01:32:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:15,342 INFO L225 Difference]: With dead ends: 1197 [2025-01-10 01:32:15,343 INFO L226 Difference]: Without dead ends: 1132 [2025-01-10 01:32:15,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=916, Invalid=3116, Unknown=0, NotChecked=0, Total=4032 [2025-01-10 01:32:15,345 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:15,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:32:15,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2025-01-10 01:32:15,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 350. [2025-01-10 01:32:15,369 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:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 381 transitions. [2025-01-10 01:32:15,370 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 381 transitions. Word has length 263 [2025-01-10 01:32:15,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:15,371 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 381 transitions. [2025-01-10 01:32:15,371 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:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 381 transitions. [2025-01-10 01:32:15,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-01-10 01:32:15,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:15,373 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:15,379 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:15,574 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:15,574 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:15,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2097994881, now seen corresponding path program 7 times [2025-01-10 01:32:15,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:15,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691605215] [2025-01-10 01:32:15,574 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:32:15,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:15,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-01-10 01:32:15,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-01-10 01:32:15,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:15,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:16,147 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:16,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:16,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691605215] [2025-01-10 01:32:16,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691605215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:16,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779818725] [2025-01-10 01:32:16,148 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:32:16,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:16,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:16,150 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:16,151 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:16,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-01-10 01:32:16,263 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,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:16,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:16,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-10 01:32:16,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:16,590 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:16,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:19,867 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:19,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779818725] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:19,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:19,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33, 33] total 44 [2025-01-10 01:32:19,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281905579] [2025-01-10 01:32:19,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:19,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-10 01:32:19,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:19,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-10 01:32:19,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1691, Unknown=0, NotChecked=0, Total=1892 [2025-01-10 01:32:19,869 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:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:20,731 INFO L93 Difference]: Finished difference Result 815 states and 887 transitions. [2025-01-10 01:32:20,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-01-10 01:32:20,731 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:20,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:20,733 INFO L225 Difference]: With dead ends: 815 [2025-01-10 01:32:20,733 INFO L226 Difference]: Without dead ends: 568 [2025-01-10 01:32:20,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 522 SyntacticMatches, 31 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3323 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=823, Invalid=6659, Unknown=0, NotChecked=0, Total=7482 [2025-01-10 01:32:20,736 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:20,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 405 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 01:32:20,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-01-10 01:32:20,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 441. [2025-01-10 01:32:20,769 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:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 474 transitions. [2025-01-10 01:32:20,771 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 474 transitions. Word has length 286 [2025-01-10 01:32:20,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:20,771 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 474 transitions. [2025-01-10 01:32:20,771 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:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 474 transitions. [2025-01-10 01:32:20,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-10 01:32:20,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:20,774 INFO L218 NwaCegarLoop]: trace histogram [55, 55, 55, 14, 13, 13, 13, 13, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:20,780 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:20,978 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:20,978 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:20,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:20,979 INFO L85 PathProgramCache]: Analyzing trace with hash -945332605, now seen corresponding path program 8 times [2025-01-10 01:32:20,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:20,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617757344] [2025-01-10 01:32:20,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:32:20,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:20,987 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 302 statements into 2 equivalence classes. [2025-01-10 01:32:21,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 302 of 302 statements. [2025-01-10 01:32:21,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:32:21,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5806 backedges. 3518 proven. 201 refuted. 0 times theorem prover too weak. 2087 trivial. 0 not checked. [2025-01-10 01:32:21,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:21,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617757344] [2025-01-10 01:32:21,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617757344] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:21,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078618173] [2025-01-10 01:32:21,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:32:21,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:21,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:21,599 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:21,601 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:21,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 302 statements into 2 equivalence classes. [2025-01-10 01:32:21,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 302 of 302 statements. [2025-01-10 01:32:21,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:32:21,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:21,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-10 01:32:21,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:22,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5806 backedges. 3523 proven. 499 refuted. 0 times theorem prover too weak. 1784 trivial. 0 not checked. [2025-01-10 01:32:22,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5806 backedges. 3523 proven. 499 refuted. 0 times theorem prover too weak. 1784 trivial. 0 not checked. [2025-01-10 01:32:26,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078618173] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:26,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:26,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 38, 38] total 49 [2025-01-10 01:32:26,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542614383] [2025-01-10 01:32:26,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:26,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-01-10 01:32:26,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:26,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-01-10 01:32:26,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2128, Unknown=0, NotChecked=0, Total=2352 [2025-01-10 01:32:26,130 INFO L87 Difference]: Start difference. First operand 441 states and 474 transitions. Second operand has 49 states, 49 states have (on average 2.3877551020408165) internal successors, (117), 41 states have internal predecessors, (117), 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:27,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:27,352 INFO L93 Difference]: Finished difference Result 896 states and 961 transitions. [2025-01-10 01:32:27,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2025-01-10 01:32:27,352 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.3877551020408165) internal successors, (117), 41 states have internal predecessors, (117), 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 302 [2025-01-10 01:32:27,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:27,354 INFO L225 Difference]: With dead ends: 896 [2025-01-10 01:32:27,354 INFO L226 Difference]: Without dead ends: 634 [2025-01-10 01:32:27,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 548 SyntacticMatches, 36 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4674 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1249, Invalid=10523, Unknown=0, NotChecked=0, Total=11772 [2025-01-10 01:32:27,358 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1977 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:27,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 480 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1977 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 01:32:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-01-10 01:32:27,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 554. [2025-01-10 01:32:27,396 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:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 590 transitions. [2025-01-10 01:32:27,398 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 590 transitions. Word has length 302 [2025-01-10 01:32:27,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:27,399 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 590 transitions. [2025-01-10 01:32:27,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.3877551020408165) internal successors, (117), 41 states have internal predecessors, (117), 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:27,399 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 590 transitions. [2025-01-10 01:32:27,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-10 01:32:27,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:27,401 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 14, 13, 13, 13, 13, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:27,408 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:27,602 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:27,602 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:27,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:27,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1819221921, now seen corresponding path program 9 times [2025-01-10 01:32:27,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:27,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419465313] [2025-01-10 01:32:27,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:32:27,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:27,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 308 statements into 14 equivalence classes. [2025-01-10 01:32:27,630 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 231 of 308 statements. [2025-01-10 01:32:27,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-01-10 01:32:27,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6161 backedges. 2878 proven. 965 refuted. 0 times theorem prover too weak. 2318 trivial. 0 not checked. [2025-01-10 01:32:27,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:27,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419465313] [2025-01-10 01:32:27,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419465313] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:27,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863996777] [2025-01-10 01:32:27,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:32:27,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:27,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:27,994 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:32:27,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:32:28,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 308 statements into 14 equivalence classes. [2025-01-10 01:32:28,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 231 of 308 statements. [2025-01-10 01:32:28,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-01-10 01:32:28,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:28,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 01:32:28,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6161 backedges. 2878 proven. 965 refuted. 0 times theorem prover too weak. 2318 trivial. 0 not checked. [2025-01-10 01:32:28,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6161 backedges. 2878 proven. 965 refuted. 0 times theorem prover too weak. 2318 trivial. 0 not checked. [2025-01-10 01:32:29,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863996777] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:29,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:29,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2025-01-10 01:32:29,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087978850] [2025-01-10 01:32:29,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:29,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-10 01:32:29,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:29,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-10 01:32:29,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=1683, Unknown=0, NotChecked=0, Total=2070 [2025-01-10 01:32:29,252 INFO L87 Difference]: Start difference. First operand 554 states and 590 transitions. Second operand has 46 states, 45 states have (on average 2.1777777777777776) internal successors, (98), 42 states have internal predecessors, (98), 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:30,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:30,711 INFO L93 Difference]: Finished difference Result 2178 states and 2457 transitions. [2025-01-10 01:32:30,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2025-01-10 01:32:30,711 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.1777777777777776) internal successors, (98), 42 states have internal predecessors, (98), 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 308 [2025-01-10 01:32:30,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:30,717 INFO L225 Difference]: With dead ends: 2178 [2025-01-10 01:32:30,717 INFO L226 Difference]: Without dead ends: 2040 [2025-01-10 01:32:30,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5934 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3816, Invalid=14006, Unknown=0, NotChecked=0, Total=17822 [2025-01-10 01:32:30,722 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:30,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:32:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2025-01-10 01:32:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 639. [2025-01-10 01:32:30,782 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:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 694 transitions. [2025-01-10 01:32:30,784 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 694 transitions. Word has length 308 [2025-01-10 01:32:30,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:30,785 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 694 transitions. [2025-01-10 01:32:30,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.1777777777777776) internal successors, (98), 42 states have internal predecessors, (98), 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:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 694 transitions. [2025-01-10 01:32:30,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-10 01:32:30,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:30,788 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:30,803 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:30,989 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:30,989 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:30,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:30,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1967953239, now seen corresponding path program 10 times [2025-01-10 01:32:30,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:30,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539910099] [2025-01-10 01:32:30,990 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:32:30,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:30,999 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 365 statements into 2 equivalence classes. [2025-01-10 01:32:31,028 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:31,028 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:32:31,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:31,829 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:31,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:31,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539910099] [2025-01-10 01:32:31,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539910099] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:31,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797323358] [2025-01-10 01:32:31,829 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:32:31,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:31,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:31,833 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:31,835 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:31,985 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 365 statements into 2 equivalence classes. [2025-01-10 01:32:32,037 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:32,037 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:32:32,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:32,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-10 01:32:32,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:32,587 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:32,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:35,803 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:35,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797323358] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:35,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:35,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 70 [2025-01-10 01:32:35,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783432120] [2025-01-10 01:32:35,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:35,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2025-01-10 01:32:35,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:35,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2025-01-10 01:32:35,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=4348, Unknown=0, NotChecked=0, Total=4830 [2025-01-10 01:32:35,806 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:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:37,204 INFO L93 Difference]: Finished difference Result 1244 states and 1397 transitions. [2025-01-10 01:32:37,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2025-01-10 01:32:37,205 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:37,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:37,207 INFO L225 Difference]: With dead ends: 1244 [2025-01-10 01:32:37,207 INFO L226 Difference]: Without dead ends: 668 [2025-01-10 01:32:37,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 664 SyntacticMatches, 32 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9230 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3205, Invalid=19145, Unknown=0, NotChecked=0, Total=22350 [2025-01-10 01:32:37,211 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:37,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 325 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:32:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-01-10 01:32:37,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 391. [2025-01-10 01:32:37,260 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:37,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 427 transitions. [2025-01-10 01:32:37,261 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 427 transitions. Word has length 365 [2025-01-10 01:32:37,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:37,261 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 427 transitions. [2025-01-10 01:32:37,261 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:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 427 transitions. [2025-01-10 01:32:37,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-01-10 01:32:37,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:37,263 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:37,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 01:32:37,464 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:37,464 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:37,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:37,464 INFO L85 PathProgramCache]: Analyzing trace with hash 893216307, now seen corresponding path program 11 times [2025-01-10 01:32:37,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:37,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011597085] [2025-01-10 01:32:37,465 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:32:37,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:37,475 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 390 statements into 18 equivalence classes. [2025-01-10 01:32:37,497 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:37,497 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-01-10 01:32:37,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:38,037 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:38,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:38,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011597085] [2025-01-10 01:32:38,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011597085] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:38,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151460879] [2025-01-10 01:32:38,037 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:32:38,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:38,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:38,042 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:38,044 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:38,237 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 390 statements into 18 equivalence classes. [2025-01-10 01:32:38,291 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:38,291 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-01-10 01:32:38,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:38,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 01:32:38,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:38,473 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:38,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:41,343 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:41,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151460879] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:41,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:41,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 37, 37] total 48 [2025-01-10 01:32:41,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956073064] [2025-01-10 01:32:41,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:41,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-10 01:32:41,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:41,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-10 01:32:41,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2041, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 01:32:41,345 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:41,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:41,985 INFO L93 Difference]: Finished difference Result 692 states and 764 transitions. [2025-01-10 01:32:41,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-01-10 01:32:41,986 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:41,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:41,988 INFO L225 Difference]: With dead ends: 692 [2025-01-10 01:32:41,988 INFO L226 Difference]: Without dead ends: 418 [2025-01-10 01:32:41,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 863 GetRequests, 737 SyntacticMatches, 29 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3835 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1112, Invalid=8590, Unknown=0, NotChecked=0, Total=9702 [2025-01-10 01:32:41,990 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:41,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:32:41,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-01-10 01:32:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-01-10 01:32:42,048 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:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 454 transitions. [2025-01-10 01:32:42,050 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 454 transitions. Word has length 390 [2025-01-10 01:32:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:42,050 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 454 transitions. [2025-01-10 01:32:42,051 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:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 454 transitions. [2025-01-10 01:32:42,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-01-10 01:32:42,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:42,054 INFO L218 NwaCegarLoop]: trace histogram [91, 91, 91, 16, 15, 15, 15, 15, 13, 13, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:42,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 01:32:42,254 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:42,255 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:42,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:42,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1314368031, now seen corresponding path program 12 times [2025-01-10 01:32:42,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:42,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253107391] [2025-01-10 01:32:42,255 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:32:42,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:42,273 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 432 statements into 18 equivalence classes. [2025-01-10 01:32:42,329 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) and asserted 432 of 432 statements. [2025-01-10 01:32:42,330 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2025-01-10 01:32:42,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 14491 backedges. 617 proven. 11849 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2025-01-10 01:32:43,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253107391] [2025-01-10 01:32:43,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253107391] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:43,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326951653] [2025-01-10 01:32:43,122 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:32:43,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:43,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:43,123 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:43,124 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:43,351 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 432 statements into 18 equivalence classes. [2025-01-10 01:32:43,422 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) and asserted 432 of 432 statements. [2025-01-10 01:32:43,422 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2025-01-10 01:32:43,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:43,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 01:32:43,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 14491 backedges. 6777 proven. 3620 refuted. 0 times theorem prover too weak. 4094 trivial. 0 not checked. [2025-01-10 01:32:43,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:32:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 14491 backedges. 6777 proven. 3620 refuted. 0 times theorem prover too weak. 4094 trivial. 0 not checked. [2025-01-10 01:32:45,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326951653] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:32:45,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:32:45,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 28, 28] total 76 [2025-01-10 01:32:45,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005367838] [2025-01-10 01:32:45,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:32:45,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-01-10 01:32:45,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:32:45,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-01-10 01:32:45,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=889, Invalid=4963, Unknown=0, NotChecked=0, Total=5852 [2025-01-10 01:32:45,593 INFO L87 Difference]: Start difference. First operand 418 states and 454 transitions. Second operand has 77 states, 76 states have (on average 2.3421052631578947) internal successors, (178), 64 states have internal predecessors, (178), 1 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (14), 14 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-10 01:32:51,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:32:51,826 INFO L93 Difference]: Finished difference Result 1426 states and 1616 transitions. [2025-01-10 01:32:51,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 315 states. [2025-01-10 01:32:51,827 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 2.3421052631578947) internal successors, (178), 64 states have internal predecessors, (178), 1 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (14), 14 states have call predecessors, (14), 1 states have call successors, (14) Word has length 432 [2025-01-10 01:32:51,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:32:51,830 INFO L225 Difference]: With dead ends: 1426 [2025-01-10 01:32:51,830 INFO L226 Difference]: Without dead ends: 1154 [2025-01-10 01:32:51,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1138 GetRequests, 824 SyntacticMatches, 0 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39017 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=21335, Invalid=78205, Unknown=0, NotChecked=0, Total=99540 [2025-01-10 01:32:51,836 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:32:51,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 261 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:32:51,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2025-01-10 01:32:51,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 592. [2025-01-10 01:32:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 571 states have (on average 1.106830122591944) internal successors, (632), 571 states have internal predecessors, (632), 3 states have call successors, (3), 2 states have call predecessors, (3), 17 states have return successors, (18), 18 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-10 01:32:51,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 653 transitions. [2025-01-10 01:32:51,896 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 653 transitions. Word has length 432 [2025-01-10 01:32:51,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:32:51,897 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 653 transitions. [2025-01-10 01:32:51,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 2.3421052631578947) internal successors, (178), 64 states have internal predecessors, (178), 1 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (14), 14 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-10 01:32:51,897 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 653 transitions. [2025-01-10 01:32:51,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-01-10 01:32:51,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:32:51,901 INFO L218 NwaCegarLoop]: trace histogram [140, 140, 140, 20, 19, 19, 19, 19, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1] [2025-01-10 01:32:51,910 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:32:52,101 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:32:52,101 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:32:52,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:32:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash -853147591, now seen corresponding path program 13 times [2025-01-10 01:32:52,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:32:52,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462903706] [2025-01-10 01:32:52,102 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:32:52,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:32:52,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-01-10 01:32:52,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-01-10 01:32:52,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:52,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 33279 backedges. 19566 proven. 420 refuted. 0 times theorem prover too weak. 13293 trivial. 0 not checked. [2025-01-10 01:32:53,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:32:53,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462903706] [2025-01-10 01:32:53,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462903706] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:32:53,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15139490] [2025-01-10 01:32:53,451 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:32:53,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:32:53,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:32:53,456 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:32:53,457 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:32:53,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-01-10 01:32:53,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-01-10 01:32:53,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:32:53,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:32:53,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 1403 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-10 01:32:53,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:32:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 33279 backedges. 18921 proven. 1477 refuted. 0 times theorem prover too weak. 12881 trivial. 0 not checked. [2025-01-10 01:32:54,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 33279 backedges. 18921 proven. 1477 refuted. 0 times theorem prover too weak. 12881 trivial. 0 not checked. [2025-01-10 01:33:08,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15139490] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:08,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:08,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 53, 53] total 72 [2025-01-10 01:33:08,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561815784] [2025-01-10 01:33:08,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:08,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-01-10 01:33:08,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:08,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-01-10 01:33:08,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=4645, Unknown=0, NotChecked=0, Total=5112 [2025-01-10 01:33:08,220 INFO L87 Difference]: Start difference. First operand 592 states and 653 transitions. Second operand has 72 states, 72 states have (on average 2.263888888888889) internal successors, (163), 61 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (13), 13 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-10 01:33:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:10,842 INFO L93 Difference]: Finished difference Result 1085 states and 1213 transitions. [2025-01-10 01:33:10,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2025-01-10 01:33:10,843 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.263888888888889) internal successors, (163), 61 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (13), 13 states have call predecessors, (13), 1 states have call successors, (13) Word has length 623 [2025-01-10 01:33:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:10,845 INFO L225 Difference]: With dead ends: 1085 [2025-01-10 01:33:10,845 INFO L226 Difference]: Without dead ends: 637 [2025-01-10 01:33:10,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1400 GetRequests, 1164 SyntacticMatches, 51 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14791 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3457, Invalid=31325, Unknown=0, NotChecked=0, Total=34782 [2025-01-10 01:33:10,850 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 4077 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 4086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 4077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:10,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 645 Invalid, 4086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 4077 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-10 01:33:10,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-01-10 01:33:10,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 612. [2025-01-10 01:33:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 590 states have (on average 1.0694915254237287) internal successors, (631), 590 states have internal predecessors, (631), 3 states have call successors, (3), 2 states have call predecessors, (3), 18 states have return successors, (19), 19 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-10 01:33:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 653 transitions. [2025-01-10 01:33:10,916 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 653 transitions. Word has length 623 [2025-01-10 01:33:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:10,918 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 653 transitions. [2025-01-10 01:33:10,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.263888888888889) internal successors, (163), 61 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (13), 13 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-10 01:33:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 653 transitions. [2025-01-10 01:33:10,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-01-10 01:33:10,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:10,921 INFO L218 NwaCegarLoop]: trace histogram [143, 143, 143, 20, 19, 19, 19, 19, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:10,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 01:33:11,121 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:11,121 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:11,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:11,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1567857475, now seen corresponding path program 14 times [2025-01-10 01:33:11,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:11,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523307420] [2025-01-10 01:33:11,122 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:33:11,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:11,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 632 statements into 2 equivalence classes. [2025-01-10 01:33:11,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 632 of 632 statements. [2025-01-10 01:33:11,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:33:11,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 34599 backedges. 20620 proven. 513 refuted. 0 times theorem prover too weak. 13466 trivial. 0 not checked. [2025-01-10 01:33:12,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:12,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523307420] [2025-01-10 01:33:12,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523307420] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:12,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180250949] [2025-01-10 01:33:12,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:33:12,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:12,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:12,403 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:12,403 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:12,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 632 statements into 2 equivalence classes. [2025-01-10 01:33:12,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 632 of 632 statements. [2025-01-10 01:33:12,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:33:12,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:12,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 1424 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-01-10 01:33:12,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 34599 backedges. 21716 proven. 1971 refuted. 0 times theorem prover too weak. 10912 trivial. 0 not checked. [2025-01-10 01:33:13,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:33:29,287 INFO L134 CoverageAnalysis]: Checked inductivity of 34599 backedges. 21716 proven. 1971 refuted. 0 times theorem prover too weak. 10912 trivial. 0 not checked. [2025-01-10 01:33:29,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180250949] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:33:29,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:33:29,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 58, 58] total 79 [2025-01-10 01:33:29,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462832735] [2025-01-10 01:33:29,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:33:29,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2025-01-10 01:33:29,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:33:29,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2025-01-10 01:33:29,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=5611, Unknown=0, NotChecked=0, Total=6162 [2025-01-10 01:33:29,289 INFO L87 Difference]: Start difference. First operand 612 states and 653 transitions. Second operand has 79 states, 79 states have (on average 2.240506329113924) internal successors, (177), 67 states have internal predecessors, (177), 1 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (14), 14 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-10 01:33:32,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:33:32,371 INFO L93 Difference]: Finished difference Result 1115 states and 1199 transitions. [2025-01-10 01:33:32,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2025-01-10 01:33:32,375 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 2.240506329113924) internal successors, (177), 67 states have internal predecessors, (177), 1 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (14), 14 states have call predecessors, (14), 1 states have call successors, (14) Word has length 632 [2025-01-10 01:33:32,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:33:32,378 INFO L225 Difference]: With dead ends: 1115 [2025-01-10 01:33:32,378 INFO L226 Difference]: Without dead ends: 721 [2025-01-10 01:33:32,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1445 GetRequests, 1174 SyntacticMatches, 56 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19743 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4593, Invalid=42279, Unknown=0, NotChecked=0, Total=46872 [2025-01-10 01:33:32,385 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 4744 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 4755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 4744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:33:32,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 665 Invalid, 4755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 4744 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 01:33:32,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-01-10 01:33:32,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 665. [2025-01-10 01:33:32,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 641 states have (on average 1.0608424336973479) internal successors, (680), 641 states have internal predecessors, (680), 3 states have call successors, (3), 2 states have call predecessors, (3), 20 states have return successors, (21), 21 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-10 01:33:32,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 704 transitions. [2025-01-10 01:33:32,497 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 704 transitions. Word has length 632 [2025-01-10 01:33:32,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:33:32,498 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 704 transitions. [2025-01-10 01:33:32,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 2.240506329113924) internal successors, (177), 67 states have internal predecessors, (177), 1 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (14), 14 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-10 01:33:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 704 transitions. [2025-01-10 01:33:32,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2025-01-10 01:33:32,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:33:32,502 INFO L218 NwaCegarLoop]: trace histogram [145, 145, 145, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 1, 1, 1, 1, 1, 1] [2025-01-10 01:33:32,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-10 01:33:32,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:32,702 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting recErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [recErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, recErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 01:33:32,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:33:32,703 INFO L85 PathProgramCache]: Analyzing trace with hash 536229313, now seen corresponding path program 15 times [2025-01-10 01:33:32,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:33:32,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012808038] [2025-01-10 01:33:32,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:33:32,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:33:32,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 628 statements into 25 equivalence classes. [2025-01-10 01:33:32,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) and asserted 488 of 628 statements. [2025-01-10 01:33:32,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2025-01-10 01:33:32,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:33,535 INFO L134 CoverageAnalysis]: Checked inductivity of 35315 backedges. 17256 proven. 7986 refuted. 0 times theorem prover too weak. 10073 trivial. 0 not checked. [2025-01-10 01:33:33,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:33:33,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012808038] [2025-01-10 01:33:33,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012808038] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:33:33,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613231742] [2025-01-10 01:33:33,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:33:33,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:33:33,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:33:33,538 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:33:33,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 01:33:34,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 628 statements into 25 equivalence classes. [2025-01-10 01:33:34,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) and asserted 488 of 628 statements. [2025-01-10 01:33:34,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2025-01-10 01:33:34,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:33:34,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 01:33:34,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:33:34,357 INFO L134 CoverageAnalysis]: Checked inductivity of 35315 backedges. 17256 proven. 7986 refuted. 0 times theorem prover too weak. 10073 trivial. 0 not checked. [2025-01-10 01:33:34,357 INFO L312 TraceCheckSpWp]: Computing backward predicates...