./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/id2_i5_o5-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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/recursive-simple/id2_i5_o5-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a6f0ceb44f91fbf2c30fb7a6cf4ec4645c0e639d55219bc8a5d1521d1ed7589 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:32:22,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:32:22,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:32:22,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:32:22,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:32:22,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:32:22,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:32:22,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:32:22,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:32:22,810 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:32:22,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:32:22,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:32:22,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:32:22,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:32:22,812 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:32:22,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:32:22,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:32:22,812 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:32:22,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:32:22,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:32:22,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:32:22,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:32:22,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:32:22,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:32:22,813 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:32:22,813 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:32:22,813 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:32:22,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:32:22,814 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:32:22,814 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:32:22,814 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:32:22,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:32:22,814 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:32:22,814 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:32:22,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:32:22,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:32:22,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:32:22,815 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:32:22,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:32:22,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:32:22,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:32:22,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:32:22,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:32:22,815 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:32:22,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:32:22,815 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a6f0ceb44f91fbf2c30fb7a6cf4ec4645c0e639d55219bc8a5d1521d1ed7589 [2025-02-06 14:32:23,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:32:23,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:32:23,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:32:23,118 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:32:23,119 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:32:23,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id2_i5_o5-1.c [2025-02-06 14:32:24,441 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4f5f3b8d/6c516a9728634e6dbba2274c2d63dd4c/FLAGc497affd2 [2025-02-06 14:32:24,687 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:32:24,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive-simple/id2_i5_o5-1.c [2025-02-06 14:32:24,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4f5f3b8d/6c516a9728634e6dbba2274c2d63dd4c/FLAGc497affd2 [2025-02-06 14:32:25,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4f5f3b8d/6c516a9728634e6dbba2274c2d63dd4c [2025-02-06 14:32:25,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:32:25,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:32:25,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:32:25,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:32:25,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:32:25,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:32:25" (1/1) ... [2025-02-06 14:32:25,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d8eee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:25, skipping insertion in model container [2025-02-06 14:32:25,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:32:25" (1/1) ... [2025-02-06 14:32:25,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:32:25,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:32:25,179 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:32:25,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:32:25,208 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:32:25,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:25 WrapperNode [2025-02-06 14:32:25,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:32:25,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:32:25,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:32:25,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:32:25,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:25" (1/1) ... [2025-02-06 14:32:25,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:25" (1/1) ... [2025-02-06 14:32:25,236 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 19 [2025-02-06 14:32:25,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:32:25,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:32:25,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:32:25,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:32:25,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:25" (1/1) ... [2025-02-06 14:32:25,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:25" (1/1) ... [2025-02-06 14:32:25,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:25" (1/1) ... [2025-02-06 14:32:25,250 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 14:32:25,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:25" (1/1) ... [2025-02-06 14:32:25,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:25" (1/1) ... [2025-02-06 14:32:25,252 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:25" (1/1) ... [2025-02-06 14:32:25,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:25" (1/1) ... [2025-02-06 14:32:25,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:25" (1/1) ... [2025-02-06 14:32:25,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:25" (1/1) ... [2025-02-06 14:32:25,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:32:25,256 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:32:25,256 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:32:25,256 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:32:25,257 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:25" (1/1) ... [2025-02-06 14:32:25,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:32:25,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:32:25,287 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-02-06 14:32:25,292 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-02-06 14:32:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:32:25,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:32:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2025-02-06 14:32:25,315 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2025-02-06 14:32:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:32:25,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:32:25,315 INFO L130 BoogieDeclarations]: Found specification of procedure id [2025-02-06 14:32:25,315 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2025-02-06 14:32:25,364 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:32:25,366 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:32:25,425 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16: havoc #t~ret5; [2025-02-06 14:32:25,469 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11: havoc #t~ret4; [2025-02-06 14:32:25,479 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-06 14:32:25,480 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:32:25,496 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:32:25,498 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:32:25,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:32:25 BoogieIcfgContainer [2025-02-06 14:32:25,498 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:32:25,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:32:25,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:32:25,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:32:25,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:32:25" (1/3) ... [2025-02-06 14:32:25,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196d4f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:32:25, skipping insertion in model container [2025-02-06 14:32:25,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:32:25" (2/3) ... [2025-02-06 14:32:25,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196d4f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:32:25, skipping insertion in model container [2025-02-06 14:32:25,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:32:25" (3/3) ... [2025-02-06 14:32:25,508 INFO L128 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-1.c [2025-02-06 14:32:25,519 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:32:25,521 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG id2_i5_o5-1.c that has 3 procedures, 38 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-02-06 14:32:25,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:32:25,588 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;@2c8243b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:32:25,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 14:32:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 14:32:25,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 14:32:25,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:25,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 14:32:25,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:25,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:25,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1567580538, now seen corresponding path program 1 times [2025-02-06 14:32:25,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:25,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937930375] [2025-02-06 14:32:25,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:25,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:25,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 14:32:25,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 14:32:25,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:25,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:25,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:25,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:25,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937930375] [2025-02-06 14:32:25,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937930375] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:32:25,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:32:25,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:32:25,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330303497] [2025-02-06 14:32:25,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:32:25,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:32:25,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:25,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:32:25,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:32:25,842 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-02-06 14:32:25,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:32:25,930 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2025-02-06 14:32:25,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:32:25,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 6 [2025-02-06 14:32:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:32:25,941 INFO L225 Difference]: With dead ends: 60 [2025-02-06 14:32:25,942 INFO L226 Difference]: Without dead ends: 42 [2025-02-06 14:32:25,944 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-02-06 14:32:25,948 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 127 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-02-06 14:32:25,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 127 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:32:25,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-06 14:32:25,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2025-02-06 14:32:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.48) internal successors, (37), 32 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 14:32:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-02-06 14:32:25,986 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 6 [2025-02-06 14:32:25,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:32:25,987 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-02-06 14:32:25,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-02-06 14:32:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-02-06 14:32:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 14:32:25,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:25,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:32:25,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:32:25,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:25,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1350356424, now seen corresponding path program 1 times [2025-02-06 14:32:25,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:25,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341903859] [2025-02-06 14:32:25,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:25,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:25,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 14:32:26,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 14:32:26,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:26,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:26,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:26,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341903859] [2025-02-06 14:32:26,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341903859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:32:26,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:32:26,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:32:26,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291539917] [2025-02-06 14:32:26,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:32:26,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:32:26,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:26,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:32:26,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:32:26,068 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. 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-02-06 14:32:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:32:26,113 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2025-02-06 14:32:26,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:32:26,114 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-02-06 14:32:26,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:32:26,115 INFO L225 Difference]: With dead ends: 42 [2025-02-06 14:32:26,115 INFO L226 Difference]: Without dead ends: 41 [2025-02-06 14:32:26,115 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-02-06 14:32:26,116 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:32:26,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 113 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:32:26,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-06 14:32:26,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-02-06 14:32:26,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.44) internal successors, (36), 32 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 14:32:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-02-06 14:32:26,122 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 7 [2025-02-06 14:32:26,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:32:26,122 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-02-06 14:32:26,122 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-02-06 14:32:26,122 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2025-02-06 14:32:26,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 14:32:26,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:26,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:32:26,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:32:26,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:26,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:26,123 INFO L85 PathProgramCache]: Analyzing trace with hash 106349798, now seen corresponding path program 1 times [2025-02-06 14:32:26,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:26,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53357335] [2025-02-06 14:32:26,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:26,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:26,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 14:32:26,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 14:32:26,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:26,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:26,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:26,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53357335] [2025-02-06 14:32:26,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53357335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:32:26,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:32:26,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:32:26,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462896509] [2025-02-06 14:32:26,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:32:26,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:32:26,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:26,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:32:26,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:32:26,264 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:32:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:32:26,358 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2025-02-06 14:32:26,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:32:26,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 14:32:26,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:32:26,361 INFO L225 Difference]: With dead ends: 62 [2025-02-06 14:32:26,361 INFO L226 Difference]: Without dead ends: 54 [2025-02-06 14:32:26,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:32:26,363 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 31 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:32:26,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 138 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:32:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-06 14:32:26,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2025-02-06 14:32:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 40 states have internal predecessors, (47), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 14:32:26,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-02-06 14:32:26,374 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 11 [2025-02-06 14:32:26,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:32:26,374 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-02-06 14:32:26,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:32:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-02-06 14:32:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 14:32:26,375 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:26,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:32:26,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:32:26,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:26,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:26,376 INFO L85 PathProgramCache]: Analyzing trace with hash -998123581, now seen corresponding path program 1 times [2025-02-06 14:32:26,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:26,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847106879] [2025-02-06 14:32:26,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:26,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:26,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 14:32:26,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 14:32:26,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:26,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:26,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:26,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847106879] [2025-02-06 14:32:26,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847106879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:32:26,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:32:26,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:32:26,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727068682] [2025-02-06 14:32:26,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:32:26,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:32:26,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:26,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:32:26,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:32:26,466 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:32:26,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:32:26,560 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2025-02-06 14:32:26,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:32:26,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 14:32:26,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:32:26,564 INFO L225 Difference]: With dead ends: 53 [2025-02-06 14:32:26,564 INFO L226 Difference]: Without dead ends: 51 [2025-02-06 14:32:26,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:32:26,567 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:32:26,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 80 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:32:26,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-06 14:32:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2025-02-06 14:32:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 38 states have internal predecessors, (44), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 14:32:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-02-06 14:32:26,581 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 12 [2025-02-06 14:32:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:32:26,583 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-02-06 14:32:26,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:32:26,584 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-02-06 14:32:26,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 14:32:26,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:26,584 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:32:26,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:32:26,584 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:26,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:26,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2088691934, now seen corresponding path program 1 times [2025-02-06 14:32:26,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:26,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883778499] [2025-02-06 14:32:26,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:26,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:26,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 14:32:26,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 14:32:26,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:26,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:26,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:26,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883778499] [2025-02-06 14:32:26,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883778499] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:32:26,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801711560] [2025-02-06 14:32:26,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:26,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:32:26,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:32:26,713 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-02-06 14:32:26,714 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-02-06 14:32:26,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 14:32:26,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 14:32:26,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:26,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:26,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 14:32:26,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:32:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:26,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:32:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:26,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801711560] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:32:26,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:32:26,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-02-06 14:32:26,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037307011] [2025-02-06 14:32:26,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:32:26,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 14:32:26,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:26,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 14:32:26,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-02-06 14:32:26,951 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:32:27,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:32:27,154 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2025-02-06 14:32:27,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 14:32:27,156 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-06 14:32:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:32:27,157 INFO L225 Difference]: With dead ends: 109 [2025-02-06 14:32:27,157 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 14:32:27,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-02-06 14:32:27,158 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 126 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:32:27,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 248 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:32:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 14:32:27,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2025-02-06 14:32:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 62 states have internal predecessors, (76), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:32:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2025-02-06 14:32:27,174 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 16 [2025-02-06 14:32:27,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:32:27,175 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2025-02-06 14:32:27,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 10 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:32:27,175 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2025-02-06 14:32:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 14:32:27,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:27,176 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:32:27,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 14:32:27,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:32:27,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:27,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:27,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1286837093, now seen corresponding path program 1 times [2025-02-06 14:32:27,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:27,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874258810] [2025-02-06 14:32:27,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:27,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:27,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 14:32:27,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 14:32:27,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:27,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 14:32:27,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:27,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874258810] [2025-02-06 14:32:27,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874258810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:32:27,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:32:27,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:32:27,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105316292] [2025-02-06 14:32:27,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:32:27,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:32:27,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:27,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:32:27,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:32:27,445 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:32:27,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:32:27,474 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2025-02-06 14:32:27,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:32:27,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-02-06 14:32:27,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:32:27,476 INFO L225 Difference]: With dead ends: 92 [2025-02-06 14:32:27,478 INFO L226 Difference]: Without dead ends: 90 [2025-02-06 14:32:27,478 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-02-06 14:32:27,479 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:32:27,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:32:27,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-06 14:32:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-06 14:32:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 72 states have internal predecessors, (87), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-06 14:32:27,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions. [2025-02-06 14:32:27,500 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 105 transitions. Word has length 24 [2025-02-06 14:32:27,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:32:27,501 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 105 transitions. [2025-02-06 14:32:27,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:32:27,501 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2025-02-06 14:32:27,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 14:32:27,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:27,503 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:32:27,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 14:32:27,504 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:27,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:27,504 INFO L85 PathProgramCache]: Analyzing trace with hash -170397183, now seen corresponding path program 1 times [2025-02-06 14:32:27,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:27,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388798228] [2025-02-06 14:32:27,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:27,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:27,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 14:32:27,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 14:32:27,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:27,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 14:32:27,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:27,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388798228] [2025-02-06 14:32:27,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388798228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:32:27,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:32:27,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:32:27,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119199825] [2025-02-06 14:32:27,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:32:27,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:32:27,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:27,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:32:27,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:32:27,569 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:32:27,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:32:27,590 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2025-02-06 14:32:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:32:27,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-02-06 14:32:27,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:32:27,594 INFO L225 Difference]: With dead ends: 102 [2025-02-06 14:32:27,595 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 14:32:27,595 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-02-06 14:32:27,596 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:32:27,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:32:27,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 14:32:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-06 14:32:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.25) internal successors, (95), 80 states have internal predecessors, (95), 8 states have call successors, (8), 7 states have call predecessors, (8), 10 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2025-02-06 14:32:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2025-02-06 14:32:27,619 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 29 [2025-02-06 14:32:27,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:32:27,619 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2025-02-06 14:32:27,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:32:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2025-02-06 14:32:27,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 14:32:27,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:27,620 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:32:27,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 14:32:27,620 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:27,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:27,621 INFO L85 PathProgramCache]: Analyzing trace with hash 800432951, now seen corresponding path program 1 times [2025-02-06 14:32:27,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:27,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727094635] [2025-02-06 14:32:27,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:27,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:27,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 14:32:27,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 14:32:27,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:27,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:27,657 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 14:32:27,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:27,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727094635] [2025-02-06 14:32:27,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727094635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:32:27,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:32:27,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:32:27,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782142433] [2025-02-06 14:32:27,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:32:27,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:32:27,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:27,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:32:27,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:32:27,663 INFO L87 Difference]: Start difference. First operand 100 states and 115 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:32:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:32:27,677 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2025-02-06 14:32:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:32:27,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-02-06 14:32:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:32:27,679 INFO L225 Difference]: With dead ends: 100 [2025-02-06 14:32:27,679 INFO L226 Difference]: Without dead ends: 99 [2025-02-06 14:32:27,683 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-02-06 14:32:27,683 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 53 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-02-06 14:32:27,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:32:27,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-06 14:32:27,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-06 14:32:27,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 79 states have internal predecessors, (92), 8 states have call successors, (8), 7 states have call predecessors, (8), 10 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2025-02-06 14:32:27,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2025-02-06 14:32:27,701 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 29 [2025-02-06 14:32:27,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:32:27,701 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2025-02-06 14:32:27,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:32:27,701 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2025-02-06 14:32:27,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 14:32:27,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:27,702 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2025-02-06 14:32:27,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 14:32:27,723 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:27,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:27,723 INFO L85 PathProgramCache]: Analyzing trace with hash 194281502, now seen corresponding path program 1 times [2025-02-06 14:32:27,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:27,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322898417] [2025-02-06 14:32:27,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:27,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:27,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 14:32:27,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 14:32:27,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:27,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:27,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:27,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322898417] [2025-02-06 14:32:27,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322898417] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:32:27,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748904888] [2025-02-06 14:32:27,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:27,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:32:27,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:32:27,926 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-02-06 14:32:27,929 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-02-06 14:32:27,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 14:32:27,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 14:32:27,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:27,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:27,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 14:32:27,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:32:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:28,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:32:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:28,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748904888] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:32:28,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:32:28,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2025-02-06 14:32:28,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380072823] [2025-02-06 14:32:28,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:32:28,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 14:32:28,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:28,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 14:32:28,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2025-02-06 14:32:28,301 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 28 states, 25 states have (on average 1.96) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:32:28,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:32:28,724 INFO L93 Difference]: Finished difference Result 242 states and 260 transitions. [2025-02-06 14:32:28,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 14:32:28,725 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.96) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-06 14:32:28,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:32:28,727 INFO L225 Difference]: With dead ends: 242 [2025-02-06 14:32:28,727 INFO L226 Difference]: Without dead ends: 212 [2025-02-06 14:32:28,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 14:32:28,728 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 291 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:32:28,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 394 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:32:28,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-02-06 14:32:28,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 194. [2025-02-06 14:32:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 152 states have (on average 1.2039473684210527) internal successors, (183), 155 states have internal predecessors, (183), 15 states have call successors, (15), 14 states have call predecessors, (15), 22 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2025-02-06 14:32:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2025-02-06 14:32:28,780 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 31 [2025-02-06 14:32:28,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:32:28,782 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2025-02-06 14:32:28,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.96) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:32:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2025-02-06 14:32:28,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 14:32:28,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:28,783 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:32:28,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 14:32:28,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:32:28,987 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:28,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:28,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2071503120, now seen corresponding path program 1 times [2025-02-06 14:32:28,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:28,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149079492] [2025-02-06 14:32:28,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:28,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:28,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 14:32:28,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 14:32:28,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:28,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 14:32:29,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:29,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149079492] [2025-02-06 14:32:29,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149079492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:32:29,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:32:29,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:32:29,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877838348] [2025-02-06 14:32:29,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:32:29,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:32:29,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:29,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:32:29,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:32:29,049 INFO L87 Difference]: Start difference. First operand 194 states and 222 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:32:29,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:32:29,084 INFO L93 Difference]: Finished difference Result 223 states and 257 transitions. [2025-02-06 14:32:29,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:32:29,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2025-02-06 14:32:29,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:32:29,087 INFO L225 Difference]: With dead ends: 223 [2025-02-06 14:32:29,087 INFO L226 Difference]: Without dead ends: 222 [2025-02-06 14:32:29,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:32:29,088 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:32:29,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:32:29,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-06 14:32:29,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 199. [2025-02-06 14:32:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 156 states have (on average 1.1987179487179487) internal successors, (187), 159 states have internal predecessors, (187), 15 states have call successors, (15), 14 states have call predecessors, (15), 23 states have return successors, (25), 25 states have call predecessors, (25), 14 states have call successors, (25) [2025-02-06 14:32:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 227 transitions. [2025-02-06 14:32:29,107 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 227 transitions. Word has length 40 [2025-02-06 14:32:29,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:32:29,109 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 227 transitions. [2025-02-06 14:32:29,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:32:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 227 transitions. [2025-02-06 14:32:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 14:32:29,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:29,112 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:32:29,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 14:32:29,113 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:29,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:29,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1420343491, now seen corresponding path program 1 times [2025-02-06 14:32:29,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:29,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633423227] [2025-02-06 14:32:29,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:29,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:29,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 14:32:29,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 14:32:29,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:29,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:29,161 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 14:32:29,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:29,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633423227] [2025-02-06 14:32:29,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633423227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:32:29,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:32:29,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:32:29,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516426471] [2025-02-06 14:32:29,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:32:29,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:32:29,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:29,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:32:29,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:32:29,163 INFO L87 Difference]: Start difference. First operand 199 states and 227 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:32:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:32:29,177 INFO L93 Difference]: Finished difference Result 199 states and 227 transitions. [2025-02-06 14:32:29,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:32:29,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-02-06 14:32:29,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:32:29,179 INFO L225 Difference]: With dead ends: 199 [2025-02-06 14:32:29,179 INFO L226 Difference]: Without dead ends: 198 [2025-02-06 14:32:29,180 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-02-06 14:32:29,180 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 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-02-06 14:32:29,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:32:29,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-06 14:32:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-02-06 14:32:29,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 156 states have (on average 1.1538461538461537) internal successors, (180), 158 states have internal predecessors, (180), 15 states have call successors, (15), 14 states have call predecessors, (15), 23 states have return successors, (25), 25 states have call predecessors, (25), 14 states have call successors, (25) [2025-02-06 14:32:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 220 transitions. [2025-02-06 14:32:29,194 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 220 transitions. Word has length 44 [2025-02-06 14:32:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:32:29,195 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 220 transitions. [2025-02-06 14:32:29,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:32:29,195 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2025-02-06 14:32:29,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 14:32:29,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:29,196 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:32:29,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 14:32:29,196 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:29,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:29,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1080975257, now seen corresponding path program 1 times [2025-02-06 14:32:29,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:29,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180048657] [2025-02-06 14:32:29,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:29,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:29,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 14:32:29,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 14:32:29,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:29,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:29,269 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 14:32:29,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:29,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180048657] [2025-02-06 14:32:29,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180048657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:32:29,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:32:29,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:32:29,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068472689] [2025-02-06 14:32:29,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:32:29,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:32:29,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:29,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:32:29,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:32:29,271 INFO L87 Difference]: Start difference. First operand 198 states and 220 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:32:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:32:29,305 INFO L93 Difference]: Finished difference Result 247 states and 274 transitions. [2025-02-06 14:32:29,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:32:29,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-02-06 14:32:29,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:32:29,307 INFO L225 Difference]: With dead ends: 247 [2025-02-06 14:32:29,307 INFO L226 Difference]: Without dead ends: 246 [2025-02-06 14:32:29,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:32:29,308 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:32:29,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:32:29,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-06 14:32:29,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-02-06 14:32:29,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 195 states have (on average 1.123076923076923) internal successors, (219), 196 states have internal predecessors, (219), 15 states have call successors, (15), 14 states have call predecessors, (15), 32 states have return successors, (35), 35 states have call predecessors, (35), 14 states have call successors, (35) [2025-02-06 14:32:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 269 transitions. [2025-02-06 14:32:29,327 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 269 transitions. Word has length 45 [2025-02-06 14:32:29,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:32:29,327 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 269 transitions. [2025-02-06 14:32:29,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:32:29,328 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 269 transitions. [2025-02-06 14:32:29,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 14:32:29,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:29,330 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:32:29,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 14:32:29,330 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:29,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:29,330 INFO L85 PathProgramCache]: Analyzing trace with hash 940822607, now seen corresponding path program 1 times [2025-02-06 14:32:29,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:29,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931291568] [2025-02-06 14:32:29,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:29,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:29,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 14:32:29,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 14:32:29,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:29,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 14:32:29,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:29,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931291568] [2025-02-06 14:32:29,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931291568] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:32:29,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934251808] [2025-02-06 14:32:29,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:29,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:32:29,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:32:29,444 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-02-06 14:32:29,447 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-02-06 14:32:29,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 14:32:29,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 14:32:29,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:29,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:29,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 14:32:29,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:32:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 14:32:29,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:32:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 14:32:29,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934251808] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:32:29,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:32:29,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-06 14:32:29,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008527568] [2025-02-06 14:32:29,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:32:29,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 14:32:29,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:29,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 14:32:29,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-02-06 14:32:29,767 INFO L87 Difference]: Start difference. First operand 246 states and 269 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 14:32:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:32:29,831 INFO L93 Difference]: Finished difference Result 346 states and 387 transitions. [2025-02-06 14:32:29,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 14:32:29,832 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2025-02-06 14:32:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:32:29,834 INFO L225 Difference]: With dead ends: 346 [2025-02-06 14:32:29,834 INFO L226 Difference]: Without dead ends: 319 [2025-02-06 14:32:29,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-02-06 14:32:29,836 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:32:29,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:32:29,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-02-06 14:32:29,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 271. [2025-02-06 14:32:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 215 states have (on average 1.1069767441860465) internal successors, (238), 216 states have internal predecessors, (238), 15 states have call successors, (15), 14 states have call predecessors, (15), 37 states have return successors, (40), 40 states have call predecessors, (40), 14 states have call successors, (40) [2025-02-06 14:32:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 293 transitions. [2025-02-06 14:32:29,855 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 293 transitions. Word has length 45 [2025-02-06 14:32:29,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:32:29,856 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 293 transitions. [2025-02-06 14:32:29,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-06 14:32:29,856 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 293 transitions. [2025-02-06 14:32:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 14:32:29,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:29,858 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 14:32:29,865 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-02-06 14:32:30,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:32:30,059 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:30,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:30,059 INFO L85 PathProgramCache]: Analyzing trace with hash -411928978, now seen corresponding path program 1 times [2025-02-06 14:32:30,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:30,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561362680] [2025-02-06 14:32:30,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:30,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:30,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 14:32:30,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 14:32:30,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:30,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 14:32:30,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:30,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561362680] [2025-02-06 14:32:30,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561362680] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:32:30,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128104433] [2025-02-06 14:32:30,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:30,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:32:30,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:32:30,280 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-02-06 14:32:30,282 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-02-06 14:32:30,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 14:32:30,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 14:32:30,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:30,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:30,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 14:32:30,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:32:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 14:32:30,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:32:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:32:31,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128104433] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:32:31,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:32:31,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 17] total 19 [2025-02-06 14:32:31,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730938733] [2025-02-06 14:32:31,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:32:31,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 14:32:31,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:31,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 14:32:31,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-02-06 14:32:31,284 INFO L87 Difference]: Start difference. First operand 271 states and 293 transitions. Second operand has 19 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-06 14:32:31,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:32:31,479 INFO L93 Difference]: Finished difference Result 459 states and 496 transitions. [2025-02-06 14:32:31,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 14:32:31,479 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 60 [2025-02-06 14:32:31,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:32:31,481 INFO L225 Difference]: With dead ends: 459 [2025-02-06 14:32:31,482 INFO L226 Difference]: Without dead ends: 271 [2025-02-06 14:32:31,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 108 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2025-02-06 14:32:31,483 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 90 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:32:31,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 190 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:32:31,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-02-06 14:32:31,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-02-06 14:32:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 215 states have (on average 1.0883720930232559) internal successors, (234), 216 states have internal predecessors, (234), 15 states have call successors, (15), 14 states have call predecessors, (15), 37 states have return successors, (40), 40 states have call predecessors, (40), 14 states have call successors, (40) [2025-02-06 14:32:31,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 289 transitions. [2025-02-06 14:32:31,501 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 289 transitions. Word has length 60 [2025-02-06 14:32:31,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:32:31,501 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 289 transitions. [2025-02-06 14:32:31,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-06 14:32:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 289 transitions. [2025-02-06 14:32:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 14:32:31,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:31,502 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2025-02-06 14:32:31,510 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-02-06 14:32:31,703 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,SelfDestructingSolverStorable13 [2025-02-06 14:32:31,705 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:31,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:31,706 INFO L85 PathProgramCache]: Analyzing trace with hash 472492754, now seen corresponding path program 2 times [2025-02-06 14:32:31,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:31,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770121601] [2025-02-06 14:32:31,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:32:31,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:31,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-02-06 14:32:31,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 14:32:31,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:32:31,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:32,152 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:32,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:32,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770121601] [2025-02-06 14:32:32,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770121601] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:32:32,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752132314] [2025-02-06 14:32:32,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:32:32,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:32:32,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:32:32,155 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-02-06 14:32:32,158 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-02-06 14:32:32,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-02-06 14:32:32,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 14:32:32,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:32:32,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:32,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 14:32:32,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:32:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:32,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:32:33,010 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:33,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752132314] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:32:33,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:32:33,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2025-02-06 14:32:33,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798686960] [2025-02-06 14:32:33,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:32:33,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-02-06 14:32:33,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:33,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-02-06 14:32:33,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=2656, Unknown=0, NotChecked=0, Total=3080 [2025-02-06 14:32:33,013 INFO L87 Difference]: Start difference. First operand 271 states and 289 transitions. Second operand has 56 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 30 states have internal predecessors, (105), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:32:33,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:32:33,907 INFO L93 Difference]: Finished difference Result 591 states and 615 transitions. [2025-02-06 14:32:33,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-02-06 14:32:33,908 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 30 states have internal predecessors, (105), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-06 14:32:33,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:32:33,911 INFO L225 Difference]: With dead ends: 591 [2025-02-06 14:32:33,911 INFO L226 Difference]: Without dead ends: 589 [2025-02-06 14:32:33,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=970, Invalid=5510, Unknown=0, NotChecked=0, Total=6480 [2025-02-06 14:32:33,914 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 873 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 14:32:33,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 588 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 14:32:33,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-02-06 14:32:33,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 564. [2025-02-06 14:32:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 450 states have (on average 1.0844444444444445) internal successors, (488), 450 states have internal predecessors, (488), 28 states have call successors, (28), 27 states have call predecessors, (28), 82 states have return successors, (86), 86 states have call predecessors, (86), 27 states have call successors, (86) [2025-02-06 14:32:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 602 transitions. [2025-02-06 14:32:33,961 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 602 transitions. Word has length 66 [2025-02-06 14:32:33,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:32:33,961 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 602 transitions. [2025-02-06 14:32:33,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 30 states have internal predecessors, (105), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:32:33,962 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 602 transitions. [2025-02-06 14:32:33,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 14:32:33,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:33,962 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-02-06 14:32:33,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 14:32:34,167 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,SelfDestructingSolverStorable14 [2025-02-06 14:32:34,167 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:34,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:34,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1146595492, now seen corresponding path program 1 times [2025-02-06 14:32:34,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:34,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205947115] [2025-02-06 14:32:34,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:34,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:34,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 14:32:34,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 14:32:34,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:34,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-06 14:32:34,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:34,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205947115] [2025-02-06 14:32:34,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205947115] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:32:34,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13014326] [2025-02-06 14:32:34,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:32:34,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:32:34,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:32:34,359 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-02-06 14:32:34,361 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-02-06 14:32:34,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 14:32:34,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 14:32:34,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:32:34,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:34,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 14:32:34,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:32:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 14:32:34,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:32:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 14:32:35,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13014326] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:32:35,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:32:35,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 19] total 38 [2025-02-06 14:32:35,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950425317] [2025-02-06 14:32:35,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:32:35,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-06 14:32:35,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:35,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-06 14:32:35,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1292, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 14:32:35,896 INFO L87 Difference]: Start difference. First operand 564 states and 602 transitions. Second operand has 38 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 14 states have call successors, (16), 5 states have call predecessors, (16), 12 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2025-02-06 14:32:36,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:32:36,349 INFO L93 Difference]: Finished difference Result 590 states and 628 transitions. [2025-02-06 14:32:36,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 14:32:36,350 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 14 states have call successors, (16), 5 states have call predecessors, (16), 12 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) Word has length 70 [2025-02-06 14:32:36,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:32:36,351 INFO L225 Difference]: With dead ends: 590 [2025-02-06 14:32:36,351 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 14:32:36,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 109 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=295, Invalid=2255, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 14:32:36,353 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 97 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:32:36,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 212 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:32:36,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 14:32:36,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2025-02-06 14:32:36,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:32:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2025-02-06 14:32:36,360 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 70 [2025-02-06 14:32:36,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:32:36,360 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2025-02-06 14:32:36,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 3.0) internal successors, (108), 34 states have internal predecessors, (108), 14 states have call successors, (16), 5 states have call predecessors, (16), 12 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2025-02-06 14:32:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2025-02-06 14:32:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 14:32:36,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:36,362 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1] [2025-02-06 14:32:36,369 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-02-06 14:32:36,566 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,SelfDestructingSolverStorable15 [2025-02-06 14:32:36,566 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:36,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:36,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1971702730, now seen corresponding path program 2 times [2025-02-06 14:32:36,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:36,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114639139] [2025-02-06 14:32:36,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:32:36,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:36,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 131 statements into 2 equivalence classes. [2025-02-06 14:32:36,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 14:32:36,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:32:36,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:37,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:37,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114639139] [2025-02-06 14:32:37,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114639139] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:32:37,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138715753] [2025-02-06 14:32:37,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:32:37,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:32:37,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:32:37,874 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-02-06 14:32:37,877 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-02-06 14:32:37,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 131 statements into 2 equivalence classes. [2025-02-06 14:32:37,944 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 14:32:37,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:32:37,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:37,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-06 14:32:37,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:32:38,112 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:38,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:32:40,024 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:40,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138715753] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:32:40,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:32:40,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2025-02-06 14:32:40,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094110857] [2025-02-06 14:32:40,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:32:40,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2025-02-06 14:32:40,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:40,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2025-02-06 14:32:40,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1514, Invalid=10042, Unknown=0, NotChecked=0, Total=11556 [2025-02-06 14:32:40,031 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand has 108 states, 105 states have (on average 1.9904761904761905) internal successors, (209), 56 states have internal predecessors, (209), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:32:41,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:32:41,780 INFO L93 Difference]: Finished difference Result 277 states and 302 transitions. [2025-02-06 14:32:41,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-02-06 14:32:41,780 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 105 states have (on average 1.9904761904761905) internal successors, (209), 56 states have internal predecessors, (209), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-02-06 14:32:41,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:32:41,782 INFO L225 Difference]: With dead ends: 277 [2025-02-06 14:32:41,782 INFO L226 Difference]: Without dead ends: 275 [2025-02-06 14:32:41,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7600 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3672, Invalid=21768, Unknown=0, NotChecked=0, Total=25440 [2025-02-06 14:32:41,788 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 681 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:32:41,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 87 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:32:41,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-06 14:32:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2025-02-06 14:32:41,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 217 states have (on average 1.0092165898617511) internal successors, (219), 218 states have internal predecessors, (219), 54 states have call successors, (54), 54 states have call predecessors, (54), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:32:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2025-02-06 14:32:41,801 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 131 [2025-02-06 14:32:41,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:32:41,801 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2025-02-06 14:32:41,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 105 states have (on average 1.9904761904761905) internal successors, (209), 56 states have internal predecessors, (209), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:32:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2025-02-06 14:32:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-02-06 14:32:41,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:41,804 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1] [2025-02-06 14:32:41,812 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-02-06 14:32:42,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:32:42,004 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:42,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:42,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1075691358, now seen corresponding path program 3 times [2025-02-06 14:32:42,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:42,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619234048] [2025-02-06 14:32:42,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 14:32:42,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:42,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 266 statements into 27 equivalence classes. [2025-02-06 14:32:42,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) and asserted 266 of 266 statements. [2025-02-06 14:32:42,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2025-02-06 14:32:42,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:46,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3328 backedges. 0 proven. 3328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:46,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:46,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619234048] [2025-02-06 14:32:46,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619234048] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:32:46,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571806245] [2025-02-06 14:32:46,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 14:32:46,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:32:46,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:32:46,510 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-02-06 14:32:46,513 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-02-06 14:32:46,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 266 statements into 27 equivalence classes. [2025-02-06 14:32:46,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) and asserted 266 of 266 statements. [2025-02-06 14:32:46,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2025-02-06 14:32:46,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:46,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-02-06 14:32:46,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:32:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3328 backedges. 0 proven. 3328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:46,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:32:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3328 backedges. 0 proven. 3328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:32:53,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571806245] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:32:53,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:32:53,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2025-02-06 14:32:53,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137047039] [2025-02-06 14:32:53,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:32:53,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 216 states [2025-02-06 14:32:53,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:53,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2025-02-06 14:32:53,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5944, Invalid=40496, Unknown=0, NotChecked=0, Total=46440 [2025-02-06 14:32:53,283 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand has 216 states, 213 states have (on average 1.9953051643192488) internal successors, (425), 110 states have internal predecessors, (425), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:32:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:32:59,039 INFO L93 Difference]: Finished difference Result 542 states and 593 transitions. [2025-02-06 14:32:59,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2025-02-06 14:32:59,040 INFO L78 Accepts]: Start accepts. Automaton has has 216 states, 213 states have (on average 1.9953051643192488) internal successors, (425), 110 states have internal predecessors, (425), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 266 [2025-02-06 14:32:59,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:32:59,043 INFO L225 Difference]: With dead ends: 542 [2025-02-06 14:32:59,043 INFO L226 Difference]: Without dead ends: 540 [2025-02-06 14:32:59,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32497 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=14530, Invalid=88190, Unknown=0, NotChecked=0, Total=102720 [2025-02-06 14:32:59,053 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1585 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 14:32:59,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 105 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 14:32:59,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-02-06 14:32:59,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 538. [2025-02-06 14:32:59,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 429 states have (on average 1.0046620046620047) internal successors, (431), 430 states have internal predecessors, (431), 107 states have call successors, (107), 107 states have call predecessors, (107), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:32:59,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 538 transitions. [2025-02-06 14:32:59,082 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 538 transitions. Word has length 266 [2025-02-06 14:32:59,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:32:59,082 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 538 transitions. [2025-02-06 14:32:59,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 216 states, 213 states have (on average 1.9953051643192488) internal successors, (425), 110 states have internal predecessors, (425), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:32:59,083 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 538 transitions. [2025-02-06 14:32:59,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-02-06 14:32:59,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:32:59,092 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 52, 52, 52, 1, 1, 1, 1] [2025-02-06 14:32:59,101 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-02-06 14:32:59,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 14:32:59,296 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 14:32:59,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:32:59,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1518351210, now seen corresponding path program 3 times [2025-02-06 14:32:59,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:32:59,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038127937] [2025-02-06 14:32:59,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 14:32:59,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:32:59,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 531 statements into 53 equivalence classes. [2025-02-06 14:32:59,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) and asserted 281 of 531 statements. [2025-02-06 14:32:59,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2025-02-06 14:32:59,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:59,698 INFO L134 CoverageAnalysis]: Checked inductivity of 13676 backedges. 1352 proven. 24 refuted. 0 times theorem prover too weak. 12300 trivial. 0 not checked. [2025-02-06 14:32:59,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:32:59,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038127937] [2025-02-06 14:32:59,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038127937] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:32:59,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251915004] [2025-02-06 14:32:59,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 14:32:59,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:32:59,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:32:59,701 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-02-06 14:32:59,703 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-02-06 14:32:59,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 531 statements into 53 equivalence classes. [2025-02-06 14:32:59,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) and asserted 281 of 531 statements. [2025-02-06 14:32:59,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2025-02-06 14:32:59,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:32:59,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 14:32:59,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:32:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 13676 backedges. 1352 proven. 24 refuted. 0 times theorem prover too weak. 12300 trivial. 0 not checked. [2025-02-06 14:32:59,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:32:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 13676 backedges. 1352 proven. 24 refuted. 0 times theorem prover too weak. 12300 trivial. 0 not checked. [2025-02-06 14:32:59,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251915004] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:32:59,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:32:59,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2025-02-06 14:32:59,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206581886] [2025-02-06 14:32:59,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:32:59,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 14:32:59,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:32:59,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 14:32:59,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-02-06 14:32:59,990 INFO L87 Difference]: Start difference. First operand 538 states and 538 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 7 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:33:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:33:00,141 INFO L93 Difference]: Finished difference Result 538 states and 538 transitions. [2025-02-06 14:33:00,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 14:33:00,142 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 7 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 531 [2025-02-06 14:33:00,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:33:00,142 INFO L225 Difference]: With dead ends: 538 [2025-02-06 14:33:00,143 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 14:33:00,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1081 GetRequests, 1062 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2025-02-06 14:33:00,144 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:33:00,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 93 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:33:00,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 14:33:00,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 14:33:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:33:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 14:33:00,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 531 [2025-02-06 14:33:00,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:33:00,145 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 14:33:00,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 7 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:33:00,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 14:33:00,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 14:33:00,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-06 14:33:00,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-06 14:33:00,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-06 14:33:00,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location id2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-06 14:33:00,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-06 14:33:00,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-06 14:33:00,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-06 14:33:00,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-06 14:33:00,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 14:33:00,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:33:00,352 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:33:00,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 14:33:01,272 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 14:33:01,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:33:01 BoogieIcfgContainer [2025-02-06 14:33:01,278 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 14:33:01,279 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 14:33:01,279 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 14:33:01,279 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 14:33:01,279 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:32:25" (3/4) ... [2025-02-06 14:33:01,281 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 14:33:01,286 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure id2 [2025-02-06 14:33:01,286 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure id [2025-02-06 14:33:01,289 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-06 14:33:01,289 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 14:33:01,289 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 14:33:01,289 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 14:33:01,350 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 14:33:01,350 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 14:33:01,350 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 14:33:01,351 INFO L158 Benchmark]: Toolchain (without parser) took 36333.46ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 104.1MB in the beginning and 203.4MB in the end (delta: -99.3MB). Peak memory consumption was 304.8MB. Max. memory is 16.1GB. [2025-02-06 14:33:01,351 INFO L158 Benchmark]: CDTParser took 1.38ms. Allocated memory is still 201.3MB. Free memory was 126.6MB in the beginning and 126.4MB in the end (delta: 280.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:33:01,352 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.75ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 94.3MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:33:01,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.54ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 93.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:33:01,353 INFO L158 Benchmark]: Boogie Preprocessor took 18.74ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 92.1MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:33:01,354 INFO L158 Benchmark]: IcfgBuilder took 242.53ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 80.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:33:01,354 INFO L158 Benchmark]: TraceAbstraction took 35777.65ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 79.6MB in the beginning and 207.8MB in the end (delta: -128.2MB). Peak memory consumption was 294.8MB. Max. memory is 16.1GB. [2025-02-06 14:33:01,355 INFO L158 Benchmark]: Witness Printer took 71.54ms. Allocated memory is still 545.3MB. Free memory was 207.8MB in the beginning and 203.4MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:33:01,356 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38ms. Allocated memory is still 201.3MB. Free memory was 126.6MB in the beginning and 126.4MB in the end (delta: 280.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.75ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 94.3MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.54ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 93.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.74ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 92.1MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 242.53ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 80.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 35777.65ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 79.6MB in the beginning and 207.8MB in the end (delta: -128.2MB). Peak memory consumption was 294.8MB. Max. memory is 16.1GB. * Witness Printer took 71.54ms. Allocated memory is still 545.3MB. Free memory was 207.8MB in the beginning and 203.4MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 34.8s, OverallIterations: 19, TraceHistogramMax: 53, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3876 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3872 mSDsluCounter, 3052 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2611 mSDsCounter, 273 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3690 IncrementalHoareTripleChecker+Invalid, 3963 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 273 mSolverCounterUnsat, 441 mSDtfsCounter, 3690 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2949 GetRequests, 2178 SyntacticMatches, 16 SemanticMatches, 755 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42848 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=564occurred in iteration=15, InterpolantAutomatonStates: 525, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 150 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 2679 NumberOfCodeBlocks, 2179 NumberOfCodeBlocksAsserted, 138 NumberOfCheckSat, 3858 ConstructedInterpolants, 0 QuantifiedInterpolants, 10444 SizeOfPredicates, 120 NumberOfNonLiveVariables, 1926 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 37 InterpolantComputations, 10 PerfectInterpolantSequences, 41385/54493 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 14:33:01,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE