./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:11:36,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:11:36,286 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 09:11:36,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:11:36,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:11:36,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:11:36,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:11:36,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:11:36,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:11:36,315 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:11:36,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:11:36,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:11:36,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:11:36,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:11:36,316 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:11:36,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:11:36,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:11:36,316 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 09:11:36,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:11:36,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 09:11:36,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:11:36,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:11:36,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:11:36,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:11:36,316 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:11:36,316 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:11:36,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 09:11:36,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:11:36,317 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:11:36,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:11:36,317 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:11:36,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:11:36,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:11:36,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:11:36,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:11:36,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:11:36,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:11:36,317 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:11:36,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:11:36,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:11:36,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:11:36,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:11:36,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:11:36,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:11:36,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:11:36,317 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 -> 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 [2025-02-08 09:11:36,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:11:36,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:11:36,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:11:36,492 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:11:36,492 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:11:36,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2025-02-08 09:11:37,606 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87bb1d017/bd78a4bf0c534e69bbcf5cc64f145539/FLAG35f308212 [2025-02-08 09:11:37,819 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:11:37,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2025-02-08 09:11:37,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87bb1d017/bd78a4bf0c534e69bbcf5cc64f145539/FLAG35f308212 [2025-02-08 09:11:37,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87bb1d017/bd78a4bf0c534e69bbcf5cc64f145539 [2025-02-08 09:11:37,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:11:37,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:11:37,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:11:37,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:11:37,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:11:37,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:11:37" (1/1) ... [2025-02-08 09:11:37,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c8be21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:37, skipping insertion in model container [2025-02-08 09:11:37,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:11:37" (1/1) ... [2025-02-08 09:11:37,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:11:37,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:11:37,990 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:11:38,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:11:38,014 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:11:38,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:38 WrapperNode [2025-02-08 09:11:38,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:11:38,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:11:38,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:11:38,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:11:38,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:38" (1/1) ... [2025-02-08 09:11:38,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:38" (1/1) ... [2025-02-08 09:11:38,035 INFO L138 Inliner]: procedures = 16, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2025-02-08 09:11:38,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:11:38,037 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:11:38,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:11:38,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:11:38,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:38" (1/1) ... [2025-02-08 09:11:38,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:38" (1/1) ... [2025-02-08 09:11:38,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:38" (1/1) ... [2025-02-08 09:11:38,062 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-08 09:11:38,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:38" (1/1) ... [2025-02-08 09:11:38,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:38" (1/1) ... [2025-02-08 09:11:38,064 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:38" (1/1) ... [2025-02-08 09:11:38,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:38" (1/1) ... [2025-02-08 09:11:38,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:38" (1/1) ... [2025-02-08 09:11:38,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:38" (1/1) ... [2025-02-08 09:11:38,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:11:38,070 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:11:38,071 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:11:38,072 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:11:38,072 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:38" (1/1) ... [2025-02-08 09:11:38,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:11:38,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:38,107 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-08 09:11:38,114 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-08 09:11:38,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 09:11:38,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 09:11:38,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:11:38,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:11:38,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 09:11:38,131 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 09:11:38,170 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:11:38,172 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:11:38,280 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-08 09:11:38,281 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:11:38,290 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:11:38,292 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:11:38,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:11:38 BoogieIcfgContainer [2025-02-08 09:11:38,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:11:38,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:11:38,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:11:38,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:11:38,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:11:37" (1/3) ... [2025-02-08 09:11:38,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2555b33d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:11:38, skipping insertion in model container [2025-02-08 09:11:38,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:11:38" (2/3) ... [2025-02-08 09:11:38,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2555b33d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:11:38, skipping insertion in model container [2025-02-08 09:11:38,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:11:38" (3/3) ... [2025-02-08 09:11:38,301 INFO L128 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2025-02-08 09:11:38,313 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:11:38,315 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sendmail-close-angle.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2025-02-08 09:11:38,358 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:11:38,370 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;@23b86f06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:11:38,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-08 09:11:38,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 38 states have internal predecessors, (44), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:11:38,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 09:11:38,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:38,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 09:11:38,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:38,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:38,387 INFO L85 PathProgramCache]: Analyzing trace with hash 74371175, now seen corresponding path program 1 times [2025-02-08 09:11:38,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:38,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771379430] [2025-02-08 09:11:38,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:38,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:38,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 09:11:38,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 09:11:38,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:38,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:38,521 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-08 09:11:38,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:38,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771379430] [2025-02-08 09:11:38,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771379430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:38,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:11:38,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:11:38,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825532516] [2025-02-08 09:11:38,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:38,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:11:38,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:38,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:11:38,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:11:38,544 INFO L87 Difference]: Start difference. First operand has 47 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 38 states have internal predecessors, (44), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:38,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:38,589 INFO L93 Difference]: Finished difference Result 85 states and 116 transitions. [2025-02-08 09:11:38,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:11:38,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 09:11:38,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:38,595 INFO L225 Difference]: With dead ends: 85 [2025-02-08 09:11:38,595 INFO L226 Difference]: Without dead ends: 41 [2025-02-08 09:11:38,598 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-08 09:11:38,601 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 26 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:38,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 63 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:38,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-08 09:11:38,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-08 09:11:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.434782608695652) internal successors, (33), 32 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:11:38,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2025-02-08 09:11:38,638 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 5 [2025-02-08 09:11:38,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:38,639 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-02-08 09:11:38,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:38,639 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2025-02-08 09:11:38,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 09:11:38,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:38,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 09:11:38,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 09:11:38,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:38,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:38,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1989460868, now seen corresponding path program 1 times [2025-02-08 09:11:38,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:38,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635109570] [2025-02-08 09:11:38,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:38,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:38,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 09:11:38,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 09:11:38,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:38,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:11:38,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:38,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635109570] [2025-02-08 09:11:38,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635109570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:38,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:11:38,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:11:38,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372272876] [2025-02-08 09:11:38,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:38,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:11:38,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:38,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:11:38,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:11:38,675 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:38,691 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2025-02-08 09:11:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:11:38,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 09:11:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:38,694 INFO L225 Difference]: With dead ends: 41 [2025-02-08 09:11:38,696 INFO L226 Difference]: Without dead ends: 40 [2025-02-08 09:11:38,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-08 09:11:38,697 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 24 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:38,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 55 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:38,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-08 09:11:38,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-08 09:11:38,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.391304347826087) internal successors, (32), 31 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 09:11:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-02-08 09:11:38,708 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 6 [2025-02-08 09:11:38,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:38,708 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-02-08 09:11:38,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:11:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-02-08 09:11:38,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 09:11:38,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:38,709 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:38,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 09:11:38,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:38,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:38,709 INFO L85 PathProgramCache]: Analyzing trace with hash -451286603, now seen corresponding path program 1 times [2025-02-08 09:11:38,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:38,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215740403] [2025-02-08 09:11:38,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:38,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:38,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 09:11:38,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 09:11:38,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:38,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:38,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:11:38,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:38,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215740403] [2025-02-08 09:11:38,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215740403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:38,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:11:38,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:11:38,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137549709] [2025-02-08 09:11:38,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:38,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:11:38,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:38,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:11:38,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:11:38,787 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:11:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:38,816 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2025-02-08 09:11:38,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:11:38,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-02-08 09:11:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:38,818 INFO L225 Difference]: With dead ends: 53 [2025-02-08 09:11:38,818 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 09:11:38,818 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-08 09:11:38,819 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:38,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 117 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:38,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 09:11:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-02-08 09:11:38,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 36 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 09:11:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2025-02-08 09:11:38,827 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 20 [2025-02-08 09:11:38,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:38,827 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2025-02-08 09:11:38,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:11:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2025-02-08 09:11:38,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 09:11:38,828 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:38,828 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:38,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 09:11:38,828 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:38,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:38,828 INFO L85 PathProgramCache]: Analyzing trace with hash 578766814, now seen corresponding path program 1 times [2025-02-08 09:11:38,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:38,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662953744] [2025-02-08 09:11:38,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:38,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:38,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 09:11:38,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 09:11:38,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:38,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:11:38,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:38,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662953744] [2025-02-08 09:11:38,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662953744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:38,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:11:38,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:11:38,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889041148] [2025-02-08 09:11:38,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:38,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:11:38,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:38,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:11:38,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:11:38,888 INFO L87 Difference]: Start difference. First operand 48 states and 60 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:11:38,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:38,928 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2025-02-08 09:11:38,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:11:38,928 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-02-08 09:11:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:38,929 INFO L225 Difference]: With dead ends: 55 [2025-02-08 09:11:38,929 INFO L226 Difference]: Without dead ends: 53 [2025-02-08 09:11:38,929 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-08 09:11:38,929 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:38,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 117 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:38,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-08 09:11:38,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-08 09:11:38,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.34375) internal successors, (43), 39 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 09:11:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2025-02-08 09:11:38,936 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 21 [2025-02-08 09:11:38,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:38,936 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2025-02-08 09:11:38,936 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:11:38,936 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2025-02-08 09:11:38,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 09:11:38,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:38,937 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:38,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 09:11:38,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:38,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:38,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2144126748, now seen corresponding path program 1 times [2025-02-08 09:11:38,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:38,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731405506] [2025-02-08 09:11:38,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:38,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:38,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 09:11:38,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 09:11:38,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:38,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:11:39,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:39,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731405506] [2025-02-08 09:11:39,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731405506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:39,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:11:39,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:11:39,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748904888] [2025-02-08 09:11:39,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:39,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:11:39,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:39,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:11:39,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:11:39,009 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:11:39,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:39,027 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2025-02-08 09:11:39,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:11:39,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-02-08 09:11:39,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:39,028 INFO L225 Difference]: With dead ends: 64 [2025-02-08 09:11:39,028 INFO L226 Difference]: Without dead ends: 62 [2025-02-08 09:11:39,028 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-08 09:11:39,028 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 128 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-08 09:11:39,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 128 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:39,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-08 09:11:39,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2025-02-08 09:11:39,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 41 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 09:11:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2025-02-08 09:11:39,035 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 23 [2025-02-08 09:11:39,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:39,035 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2025-02-08 09:11:39,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 09:11:39,035 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2025-02-08 09:11:39,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 09:11:39,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:39,036 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:39,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 09:11:39,036 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:39,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:39,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1477498254, now seen corresponding path program 1 times [2025-02-08 09:11:39,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:39,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668307999] [2025-02-08 09:11:39,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:39,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:39,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 09:11:39,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 09:11:39,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:39,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:39,162 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-08 09:11:39,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:39,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668307999] [2025-02-08 09:11:39,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668307999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:39,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:11:39,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 09:11:39,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426655003] [2025-02-08 09:11:39,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:39,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 09:11:39,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:39,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 09:11:39,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 09:11:39,164 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 09:11:39,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:39,242 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2025-02-08 09:11:39,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:11:39,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2025-02-08 09:11:39,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:39,243 INFO L225 Difference]: With dead ends: 61 [2025-02-08 09:11:39,243 INFO L226 Difference]: Without dead ends: 60 [2025-02-08 09:11:39,243 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-08 09:11:39,244 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:39,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 176 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:11:39,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-08 09:11:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2025-02-08 09:11:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 43 states have internal predecessors, (47), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-08 09:11:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2025-02-08 09:11:39,257 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 33 [2025-02-08 09:11:39,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:39,258 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2025-02-08 09:11:39,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 09:11:39,258 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2025-02-08 09:11:39,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 09:11:39,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:39,258 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:39,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 09:11:39,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:39,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:39,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1442194412, now seen corresponding path program 1 times [2025-02-08 09:11:39,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:39,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159486964] [2025-02-08 09:11:39,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:39,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:39,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 09:11:39,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 09:11:39,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:39,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:39,357 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-08 09:11:39,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:39,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159486964] [2025-02-08 09:11:39,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159486964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:39,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:11:39,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 09:11:39,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208560131] [2025-02-08 09:11:39,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:39,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 09:11:39,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:39,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 09:11:39,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 09:11:39,358 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 09:11:39,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:39,428 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2025-02-08 09:11:39,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:11:39,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-02-08 09:11:39,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:39,429 INFO L225 Difference]: With dead ends: 61 [2025-02-08 09:11:39,429 INFO L226 Difference]: Without dead ends: 50 [2025-02-08 09:11:39,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 09:11:39,430 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:39,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 182 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:11:39,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-08 09:11:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-08 09:11:39,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 38 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 09:11:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2025-02-08 09:11:39,439 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 34 [2025-02-08 09:11:39,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:39,439 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2025-02-08 09:11:39,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 09:11:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2025-02-08 09:11:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 09:11:39,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:39,441 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:39,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 09:11:39,441 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:39,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:39,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1551971701, now seen corresponding path program 1 times [2025-02-08 09:11:39,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:39,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812812681] [2025-02-08 09:11:39,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:39,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:39,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 09:11:39,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 09:11:39,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:39,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:39,547 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:11:39,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:39,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812812681] [2025-02-08 09:11:39,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812812681] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:39,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373378853] [2025-02-08 09:11:39,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:39,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:39,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:39,553 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-08 09:11:39,556 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-08 09:11:39,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 09:11:39,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 09:11:39,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:39,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:39,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:11:39,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:11:39,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:11:39,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373378853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:39,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:11:39,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 09:11:39,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872861894] [2025-02-08 09:11:39,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:39,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 09:11:39,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:39,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 09:11:39,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:11:39,711 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 09:11:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:39,753 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-02-08 09:11:39,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:11:39,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2025-02-08 09:11:39,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:39,754 INFO L225 Difference]: With dead ends: 50 [2025-02-08 09:11:39,755 INFO L226 Difference]: Without dead ends: 48 [2025-02-08 09:11:39,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:11:39,755 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:39,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 143 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:39,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-08 09:11:39,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-08 09:11:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 36 states have internal predecessors, (38), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 09:11:39,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2025-02-08 09:11:39,760 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 48 [2025-02-08 09:11:39,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:39,760 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2025-02-08 09:11:39,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 09:11:39,761 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2025-02-08 09:11:39,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 09:11:39,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:39,762 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:39,768 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-08 09:11:39,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:39,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:39,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:39,965 INFO L85 PathProgramCache]: Analyzing trace with hash -866482498, now seen corresponding path program 1 times [2025-02-08 09:11:39,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:39,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716529317] [2025-02-08 09:11:39,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:39,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:39,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 09:11:39,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 09:11:39,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:39,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:11:40,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:40,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716529317] [2025-02-08 09:11:40,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716529317] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:40,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254095906] [2025-02-08 09:11:40,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:40,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:40,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:40,103 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-08 09:11:40,104 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-08 09:11:40,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 09:11:40,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 09:11:40,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:40,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:40,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:11:40,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:40,189 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:11:40,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:11:40,260 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:11:40,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254095906] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:11:40,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:11:40,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 09:11:40,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102467637] [2025-02-08 09:11:40,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:11:40,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 09:11:40,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:40,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 09:11:40,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-08 09:11:40,261 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-08 09:11:40,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:40,337 INFO L93 Difference]: Finished difference Result 85 states and 114 transitions. [2025-02-08 09:11:40,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 09:11:40,338 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 49 [2025-02-08 09:11:40,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:40,339 INFO L225 Difference]: With dead ends: 85 [2025-02-08 09:11:40,339 INFO L226 Difference]: Without dead ends: 83 [2025-02-08 09:11:40,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-08 09:11:40,340 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:40,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 249 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:11:40,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-08 09:11:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2025-02-08 09:11:40,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.288888888888889) internal successors, (58), 50 states have internal predecessors, (58), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-08 09:11:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2025-02-08 09:11:40,347 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 49 [2025-02-08 09:11:40,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:40,347 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 94 transitions. [2025-02-08 09:11:40,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-08 09:11:40,347 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2025-02-08 09:11:40,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 09:11:40,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:40,348 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:40,357 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-08 09:11:40,548 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-08 09:11:40,549 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:40,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:40,549 INFO L85 PathProgramCache]: Analyzing trace with hash -585290106, now seen corresponding path program 1 times [2025-02-08 09:11:40,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:40,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510606159] [2025-02-08 09:11:40,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:40,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:40,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 09:11:40,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 09:11:40,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:40,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:11:40,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:40,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510606159] [2025-02-08 09:11:40,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510606159] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:40,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539758593] [2025-02-08 09:11:40,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:40,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:40,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:40,615 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-08 09:11:40,619 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-08 09:11:40,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 09:11:40,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 09:11:40,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:40,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:40,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:11:40,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:11:40,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:11:40,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539758593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:40,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:11:40,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 09:11:40,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228508246] [2025-02-08 09:11:40,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:40,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 09:11:40,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:40,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 09:11:40,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:11:40,695 INFO L87 Difference]: Start difference. First operand 70 states and 94 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 09:11:40,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:40,721 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2025-02-08 09:11:40,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:11:40,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 51 [2025-02-08 09:11:40,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:40,723 INFO L225 Difference]: With dead ends: 70 [2025-02-08 09:11:40,723 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 09:11:40,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:11:40,724 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 23 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:40,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 170 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:40,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 09:11:40,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-08 09:11:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 49 states have internal predecessors, (56), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-08 09:11:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2025-02-08 09:11:40,730 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 51 [2025-02-08 09:11:40,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:40,730 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2025-02-08 09:11:40,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 09:11:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2025-02-08 09:11:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 09:11:40,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:40,731 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:40,739 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-08 09:11:40,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:40,932 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:40,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:40,932 INFO L85 PathProgramCache]: Analyzing trace with hash -964124116, now seen corresponding path program 1 times [2025-02-08 09:11:40,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:40,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118959606] [2025-02-08 09:11:40,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:40,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:40,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 09:11:40,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 09:11:40,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:40,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:11:41,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:41,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118959606] [2025-02-08 09:11:41,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118959606] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:41,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763696829] [2025-02-08 09:11:41,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:41,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:41,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:41,009 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-08 09:11:41,009 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-08 09:11:41,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 09:11:41,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 09:11:41,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:41,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:41,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:11:41,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:11:41,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:11:41,187 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-08 09:11:41,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763696829] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:11:41,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:11:41,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 09:11:41,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705271973] [2025-02-08 09:11:41,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:11:41,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 09:11:41,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:41,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 09:11:41,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 09:11:41,188 INFO L87 Difference]: Start difference. First operand 69 states and 92 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-08 09:11:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:41,265 INFO L93 Difference]: Finished difference Result 123 states and 162 transitions. [2025-02-08 09:11:41,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 09:11:41,266 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 52 [2025-02-08 09:11:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:41,267 INFO L225 Difference]: With dead ends: 123 [2025-02-08 09:11:41,267 INFO L226 Difference]: Without dead ends: 122 [2025-02-08 09:11:41,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 09:11:41,267 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 40 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:41,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 290 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:11:41,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-08 09:11:41,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2025-02-08 09:11:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 62 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 09:11:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2025-02-08 09:11:41,280 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 52 [2025-02-08 09:11:41,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:41,281 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2025-02-08 09:11:41,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-02-08 09:11:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2025-02-08 09:11:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 09:11:41,281 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:41,281 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:41,291 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-08 09:11:41,488 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,SelfDestructingSolverStorable10 [2025-02-08 09:11:41,490 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:41,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:41,490 INFO L85 PathProgramCache]: Analyzing trace with hash -67207048, now seen corresponding path program 1 times [2025-02-08 09:11:41,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:41,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458629945] [2025-02-08 09:11:41,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:41,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:41,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 09:11:41,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 09:11:41,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:41,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-08 09:11:41,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:41,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458629945] [2025-02-08 09:11:41,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458629945] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:41,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891366946] [2025-02-08 09:11:41,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:41,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:41,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:41,579 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-08 09:11:41,582 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-08 09:11:41,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 09:11:41,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 09:11:41,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:41,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:41,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 09:11:41,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:41,654 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-08 09:11:41,654 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:11:41,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891366946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:41,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:11:41,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-02-08 09:11:41,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011837921] [2025-02-08 09:11:41,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:41,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 09:11:41,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:41,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 09:11:41,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:11:41,656 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-08 09:11:41,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:41,707 INFO L93 Difference]: Finished difference Result 88 states and 120 transitions. [2025-02-08 09:11:41,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 09:11:41,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 61 [2025-02-08 09:11:41,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:41,709 INFO L225 Difference]: With dead ends: 88 [2025-02-08 09:11:41,709 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 09:11:41,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:11:41,710 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:41,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 185 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:41,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 09:11:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-08 09:11:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 61 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 09:11:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2025-02-08 09:11:41,717 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 61 [2025-02-08 09:11:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:41,717 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2025-02-08 09:11:41,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-08 09:11:41,717 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2025-02-08 09:11:41,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 09:11:41,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:41,718 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:41,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 09:11:41,922 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,SelfDestructingSolverStorable11 [2025-02-08 09:11:41,923 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:41,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:41,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2083418518, now seen corresponding path program 1 times [2025-02-08 09:11:41,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:41,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805499101] [2025-02-08 09:11:41,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:41,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:41,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 09:11:41,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 09:11:41,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:41,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-08 09:11:42,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:42,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805499101] [2025-02-08 09:11:42,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805499101] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:42,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099100963] [2025-02-08 09:11:42,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:42,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:42,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:42,017 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-08 09:11:42,020 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-08 09:11:42,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 09:11:42,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 09:11:42,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:42,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:42,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 09:11:42,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:42,102 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-08 09:11:42,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:11:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-08 09:11:42,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099100963] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:11:42,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:11:42,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-08 09:11:42,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035675145] [2025-02-08 09:11:42,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:11:42,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 09:11:42,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:42,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 09:11:42,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-02-08 09:11:42,220 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-02-08 09:11:42,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:42,323 INFO L93 Difference]: Finished difference Result 103 states and 140 transitions. [2025-02-08 09:11:42,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 09:11:42,324 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 62 [2025-02-08 09:11:42,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:42,325 INFO L225 Difference]: With dead ends: 103 [2025-02-08 09:11:42,325 INFO L226 Difference]: Without dead ends: 82 [2025-02-08 09:11:42,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-02-08 09:11:42,325 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:42,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 239 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:11:42,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-08 09:11:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-08 09:11:42,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 58 states have internal predecessors, (64), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-08 09:11:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 108 transitions. [2025-02-08 09:11:42,349 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 108 transitions. Word has length 62 [2025-02-08 09:11:42,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:42,349 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 108 transitions. [2025-02-08 09:11:42,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-02-08 09:11:42,350 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 108 transitions. [2025-02-08 09:11:42,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-08 09:11:42,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:42,350 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:42,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 09:11:42,554 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,SelfDestructingSolverStorable12 [2025-02-08 09:11:42,554 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:42,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:42,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2024931964, now seen corresponding path program 1 times [2025-02-08 09:11:42,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:42,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783235494] [2025-02-08 09:11:42,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:42,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:42,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 09:11:42,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 09:11:42,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:42,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:42,632 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-08 09:11:42,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:42,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783235494] [2025-02-08 09:11:42,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783235494] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:42,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540167610] [2025-02-08 09:11:42,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:11:42,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:42,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:42,635 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-08 09:11:42,642 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-08 09:11:42,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 09:11:42,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 09:11:42,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:11:42,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:42,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 09:11:42,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:42,725 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-08 09:11:42,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:11:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-08 09:11:42,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540167610] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:11:42,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:11:42,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-08 09:11:42,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339311692] [2025-02-08 09:11:42,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:11:42,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 09:11:42,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:42,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 09:11:42,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-02-08 09:11:42,822 INFO L87 Difference]: Start difference. First operand 82 states and 108 transitions. Second operand has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 7 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2025-02-08 09:11:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:42,908 INFO L93 Difference]: Finished difference Result 115 states and 160 transitions. [2025-02-08 09:11:42,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 09:11:42,909 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 7 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 78 [2025-02-08 09:11:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:42,910 INFO L225 Difference]: With dead ends: 115 [2025-02-08 09:11:42,910 INFO L226 Difference]: Without dead ends: 114 [2025-02-08 09:11:42,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-02-08 09:11:42,911 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:42,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 213 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:11:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-08 09:11:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2025-02-08 09:11:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.173913043478261) internal successors, (81), 72 states have internal predecessors, (81), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-08 09:11:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 141 transitions. [2025-02-08 09:11:42,920 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 141 transitions. Word has length 78 [2025-02-08 09:11:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:42,920 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 141 transitions. [2025-02-08 09:11:42,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 7 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2025-02-08 09:11:42,920 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 141 transitions. [2025-02-08 09:11:42,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-08 09:11:42,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:42,921 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 3, 3, 3, 3, 3, 3, 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-08 09:11:42,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 09:11:43,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:43,122 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:43,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:43,122 INFO L85 PathProgramCache]: Analyzing trace with hash -880701038, now seen corresponding path program 2 times [2025-02-08 09:11:43,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:43,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641080342] [2025-02-08 09:11:43,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:11:43,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:43,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-02-08 09:11:43,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 09:11:43,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:11:43,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-08 09:11:43,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:43,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641080342] [2025-02-08 09:11:43,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641080342] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:43,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943808604] [2025-02-08 09:11:43,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:11:43,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:43,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:43,267 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-08 09:11:43,269 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-08 09:11:43,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-02-08 09:11:43,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 09:11:43,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:11:43,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:43,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 09:11:43,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:43,389 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-08 09:11:43,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:11:43,559 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-08 09:11:43,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943808604] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:11:43,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:11:43,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-02-08 09:11:43,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868910274] [2025-02-08 09:11:43,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:11:43,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 09:11:43,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:43,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 09:11:43,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-02-08 09:11:43,562 INFO L87 Difference]: Start difference. First operand 104 states and 141 transitions. Second operand has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 20 states have internal predecessors, (79), 9 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2025-02-08 09:11:43,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:43,724 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2025-02-08 09:11:43,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 09:11:43,725 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 20 states have internal predecessors, (79), 9 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) Word has length 105 [2025-02-08 09:11:43,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:43,726 INFO L225 Difference]: With dead ends: 136 [2025-02-08 09:11:43,727 INFO L226 Difference]: Without dead ends: 135 [2025-02-08 09:11:43,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-02-08 09:11:43,728 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:43,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 326 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:11:43,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-08 09:11:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2025-02-08 09:11:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 80 states have internal predecessors, (92), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-08 09:11:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 160 transitions. [2025-02-08 09:11:43,745 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 160 transitions. Word has length 105 [2025-02-08 09:11:43,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:43,745 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 160 transitions. [2025-02-08 09:11:43,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 20 states have internal predecessors, (79), 9 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2025-02-08 09:11:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 160 transitions. [2025-02-08 09:11:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-08 09:11:43,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:43,748 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:43,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 09:11:43,948 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,SelfDestructingSolverStorable14 [2025-02-08 09:11:43,949 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:43,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:43,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1368767510, now seen corresponding path program 2 times [2025-02-08 09:11:43,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:43,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404195266] [2025-02-08 09:11:43,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:11:43,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:43,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-02-08 09:11:43,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 09:11:43,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:11:43,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:44,201 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-08 09:11:44,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:44,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404195266] [2025-02-08 09:11:44,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404195266] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:44,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680654383] [2025-02-08 09:11:44,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:11:44,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:44,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:44,208 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-08 09:11:44,212 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-08 09:11:44,241 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-02-08 09:11:44,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 09:11:44,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:11:44,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:44,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 09:11:44,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-08 09:11:44,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:11:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-08 09:11:44,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680654383] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:11:44,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:11:44,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-02-08 09:11:44,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133979742] [2025-02-08 09:11:44,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:11:44,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 09:11:44,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:44,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 09:11:44,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2025-02-08 09:11:44,539 INFO L87 Difference]: Start difference. First operand 116 states and 160 transitions. Second operand has 24 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 24 states have internal predecessors, (85), 11 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-02-08 09:11:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:44,675 INFO L93 Difference]: Finished difference Result 143 states and 196 transitions. [2025-02-08 09:11:44,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 09:11:44,675 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 24 states have internal predecessors, (85), 11 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) Word has length 118 [2025-02-08 09:11:44,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:44,676 INFO L225 Difference]: With dead ends: 143 [2025-02-08 09:11:44,676 INFO L226 Difference]: Without dead ends: 116 [2025-02-08 09:11:44,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2025-02-08 09:11:44,677 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 23 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:44,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 322 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:11:44,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-08 09:11:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2025-02-08 09:11:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 77 states have internal predecessors, (81), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-08 09:11:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 145 transitions. [2025-02-08 09:11:44,685 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 145 transitions. Word has length 118 [2025-02-08 09:11:44,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:44,685 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 145 transitions. [2025-02-08 09:11:44,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 24 states have internal predecessors, (85), 11 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 11 states have call predecessors, (34), 11 states have call successors, (34) [2025-02-08 09:11:44,686 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 145 transitions. [2025-02-08 09:11:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-08 09:11:44,686 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:44,687 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:44,693 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-08 09:11:44,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:44,888 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:44,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:44,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1915831726, now seen corresponding path program 2 times [2025-02-08 09:11:44,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:44,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808199765] [2025-02-08 09:11:44,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:11:44,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:44,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 136 statements into 2 equivalence classes. [2025-02-08 09:11:44,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 136 of 136 statements. [2025-02-08 09:11:44,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:11:44,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-08 09:11:45,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:45,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808199765] [2025-02-08 09:11:45,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808199765] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:45,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452428443] [2025-02-08 09:11:45,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:11:45,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:45,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:45,047 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:11:45,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 09:11:45,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 136 statements into 2 equivalence classes. [2025-02-08 09:11:45,095 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 136 of 136 statements. [2025-02-08 09:11:45,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:11:45,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:45,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 09:11:45,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-08 09:11:45,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:11:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-08 09:11:45,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452428443] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:11:45,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:11:45,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-02-08 09:11:45,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338414875] [2025-02-08 09:11:45,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:11:45,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 09:11:45,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:45,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 09:11:45,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-02-08 09:11:45,375 INFO L87 Difference]: Start difference. First operand 111 states and 145 transitions. Second operand has 24 states, 23 states have (on average 4.478260869565218) internal successors, (103), 24 states have internal predecessors, (103), 11 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2025-02-08 09:11:45,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:45,498 INFO L93 Difference]: Finished difference Result 195 states and 261 transitions. [2025-02-08 09:11:45,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 09:11:45,499 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.478260869565218) internal successors, (103), 24 states have internal predecessors, (103), 11 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) Word has length 136 [2025-02-08 09:11:45,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:45,502 INFO L225 Difference]: With dead ends: 195 [2025-02-08 09:11:45,502 INFO L226 Difference]: Without dead ends: 194 [2025-02-08 09:11:45,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-02-08 09:11:45,503 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:45,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 328 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:11:45,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-08 09:11:45,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 154. [2025-02-08 09:11:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 103 states have (on average 1.145631067961165) internal successors, (118), 106 states have internal predecessors, (118), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-08 09:11:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 210 transitions. [2025-02-08 09:11:45,516 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 210 transitions. Word has length 136 [2025-02-08 09:11:45,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:45,517 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 210 transitions. [2025-02-08 09:11:45,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.478260869565218) internal successors, (103), 24 states have internal predecessors, (103), 11 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2025-02-08 09:11:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 210 transitions. [2025-02-08 09:11:45,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-08 09:11:45,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:45,519 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:45,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 09:11:45,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 09:11:45,723 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:45,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:45,723 INFO L85 PathProgramCache]: Analyzing trace with hash -661146404, now seen corresponding path program 2 times [2025-02-08 09:11:45,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:45,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29694888] [2025-02-08 09:11:45,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:11:45,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:45,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 190 statements into 2 equivalence classes. [2025-02-08 09:11:45,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 190 of 190 statements. [2025-02-08 09:11:45,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:11:45,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-08 09:11:45,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:45,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29694888] [2025-02-08 09:11:45,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29694888] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:45,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006374000] [2025-02-08 09:11:45,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:11:45,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:45,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:45,974 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:11:46,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 09:11:46,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 190 statements into 2 equivalence classes. [2025-02-08 09:11:46,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 190 of 190 statements. [2025-02-08 09:11:46,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:11:46,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:46,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 09:11:46,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-08 09:11:46,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:11:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-08 09:11:46,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006374000] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:11:46,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:11:46,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2025-02-08 09:11:46,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379572278] [2025-02-08 09:11:46,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:11:46,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 09:11:46,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:46,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 09:11:46,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2025-02-08 09:11:46,470 INFO L87 Difference]: Start difference. First operand 154 states and 210 transitions. Second operand has 32 states, 31 states have (on average 4.161290322580645) internal successors, (129), 32 states have internal predecessors, (129), 15 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) [2025-02-08 09:11:46,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:46,661 INFO L93 Difference]: Finished difference Result 225 states and 322 transitions. [2025-02-08 09:11:46,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-08 09:11:46,661 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.161290322580645) internal successors, (129), 32 states have internal predecessors, (129), 15 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) Word has length 190 [2025-02-08 09:11:46,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:46,663 INFO L225 Difference]: With dead ends: 225 [2025-02-08 09:11:46,663 INFO L226 Difference]: Without dead ends: 224 [2025-02-08 09:11:46,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2025-02-08 09:11:46,664 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 27 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:46,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 525 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:11:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-02-08 09:11:46,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 200. [2025-02-08 09:11:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 133 states have (on average 1.1654135338345866) internal successors, (155), 136 states have internal predecessors, (155), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-08 09:11:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 279 transitions. [2025-02-08 09:11:46,680 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 279 transitions. Word has length 190 [2025-02-08 09:11:46,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:46,682 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 279 transitions. [2025-02-08 09:11:46,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.161290322580645) internal successors, (129), 32 states have internal predecessors, (129), 15 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) [2025-02-08 09:11:46,682 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 279 transitions. [2025-02-08 09:11:46,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-08 09:11:46,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:46,683 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:46,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 09:11:46,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 09:11:46,884 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:46,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:46,888 INFO L85 PathProgramCache]: Analyzing trace with hash 683148090, now seen corresponding path program 3 times [2025-02-08 09:11:46,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:46,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166848116] [2025-02-08 09:11:46,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:11:46,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:46,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 217 statements into 17 equivalence classes. [2025-02-08 09:11:46,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 217 statements. [2025-02-08 09:11:46,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 09:11:46,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2006 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 1919 trivial. 0 not checked. [2025-02-08 09:11:46,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:46,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166848116] [2025-02-08 09:11:46,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166848116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:46,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:11:46,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 09:11:46,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863105508] [2025-02-08 09:11:46,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:46,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 09:11:46,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:46,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 09:11:46,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:11:46,959 INFO L87 Difference]: Start difference. First operand 200 states and 279 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-08 09:11:47,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:47,036 INFO L93 Difference]: Finished difference Result 200 states and 279 transitions. [2025-02-08 09:11:47,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 09:11:47,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 217 [2025-02-08 09:11:47,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:47,038 INFO L225 Difference]: With dead ends: 200 [2025-02-08 09:11:47,038 INFO L226 Difference]: Without dead ends: 199 [2025-02-08 09:11:47,038 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-08 09:11:47,038 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:47,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 107 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:11:47,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-08 09:11:47,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-02-08 09:11:47,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 133 states have (on average 1.1578947368421053) internal successors, (154), 135 states have internal predecessors, (154), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-08 09:11:47,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 278 transitions. [2025-02-08 09:11:47,049 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 278 transitions. Word has length 217 [2025-02-08 09:11:47,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:47,049 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 278 transitions. [2025-02-08 09:11:47,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-08 09:11:47,049 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 278 transitions. [2025-02-08 09:11:47,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-08 09:11:47,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:47,051 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:47,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 09:11:47,051 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:47,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:47,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1146406034, now seen corresponding path program 3 times [2025-02-08 09:11:47,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:47,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621075625] [2025-02-08 09:11:47,052 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:11:47,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:47,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 230 statements into 17 equivalence classes. [2025-02-08 09:11:47,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 230 statements. [2025-02-08 09:11:47,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 09:11:47,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 2157 trivial. 0 not checked. [2025-02-08 09:11:47,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:47,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621075625] [2025-02-08 09:11:47,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621075625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:11:47,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:11:47,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 09:11:47,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819062008] [2025-02-08 09:11:47,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:11:47,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 09:11:47,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:47,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 09:11:47,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:11:47,119 INFO L87 Difference]: Start difference. First operand 199 states and 278 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-08 09:11:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:47,188 INFO L93 Difference]: Finished difference Result 199 states and 278 transitions. [2025-02-08 09:11:47,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 09:11:47,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 230 [2025-02-08 09:11:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:47,190 INFO L225 Difference]: With dead ends: 199 [2025-02-08 09:11:47,191 INFO L226 Difference]: Without dead ends: 188 [2025-02-08 09:11:47,191 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-08 09:11:47,191 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:47,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 106 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:11:47,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-08 09:11:47,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-02-08 09:11:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 128 states have internal predecessors, (132), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-08 09:11:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 248 transitions. [2025-02-08 09:11:47,207 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 248 transitions. Word has length 230 [2025-02-08 09:11:47,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:47,207 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 248 transitions. [2025-02-08 09:11:47,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-08 09:11:47,207 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 248 transitions. [2025-02-08 09:11:47,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-02-08 09:11:47,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:47,209 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:47,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 09:11:47,212 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:47,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:47,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1469620814, now seen corresponding path program 3 times [2025-02-08 09:11:47,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:47,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886333205] [2025-02-08 09:11:47,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:11:47,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:47,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 304 statements into 20 equivalence classes. [2025-02-08 09:11:47,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 45 of 304 statements. [2025-02-08 09:11:47,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 09:11:47,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:47,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4084 backedges. 117 proven. 106 refuted. 0 times theorem prover too weak. 3861 trivial. 0 not checked. [2025-02-08 09:11:47,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:47,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886333205] [2025-02-08 09:11:47,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886333205] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:47,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727268062] [2025-02-08 09:11:47,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:11:47,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:47,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:47,274 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:11:47,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 09:11:47,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 304 statements into 20 equivalence classes. [2025-02-08 09:11:47,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 45 of 304 statements. [2025-02-08 09:11:47,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 09:11:47,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:47,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 09:11:47,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:47,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4084 backedges. 117 proven. 106 refuted. 0 times theorem prover too weak. 3861 trivial. 0 not checked. [2025-02-08 09:11:47,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:11:47,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4084 backedges. 117 proven. 106 refuted. 0 times theorem prover too weak. 3861 trivial. 0 not checked. [2025-02-08 09:11:47,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727268062] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:11:47,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:11:47,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-02-08 09:11:47,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025402791] [2025-02-08 09:11:47,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:11:47,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 09:11:47,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:47,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 09:11:47,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:11:47,807 INFO L87 Difference]: Start difference. First operand 188 states and 248 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-08 09:11:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:47,860 INFO L93 Difference]: Finished difference Result 188 states and 248 transitions. [2025-02-08 09:11:47,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 09:11:47,861 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 304 [2025-02-08 09:11:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:47,863 INFO L225 Difference]: With dead ends: 188 [2025-02-08 09:11:47,863 INFO L226 Difference]: Without dead ends: 187 [2025-02-08 09:11:47,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 604 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:11:47,864 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:47,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:47,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-02-08 09:11:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-02-08 09:11:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 127 states have (on average 1.0078740157480315) internal successors, (128), 127 states have internal predecessors, (128), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-08 09:11:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 244 transitions. [2025-02-08 09:11:47,880 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 244 transitions. Word has length 304 [2025-02-08 09:11:47,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:47,880 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 244 transitions. [2025-02-08 09:11:47,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-08 09:11:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 244 transitions. [2025-02-08 09:11:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-02-08 09:11:47,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:11:47,885 INFO L218 NwaCegarLoop]: trace histogram [58, 58, 58, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:47,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 09:11:48,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:48,088 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:11:48,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:11:48,089 INFO L85 PathProgramCache]: Analyzing trace with hash 83866508, now seen corresponding path program 3 times [2025-02-08 09:11:48,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:11:48,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513743306] [2025-02-08 09:11:48,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:11:48,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:11:48,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 414 statements into 27 equivalence classes. [2025-02-08 09:11:48,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 414 statements. [2025-02-08 09:11:48,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 09:11:48,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 7816 backedges. 171 proven. 70 refuted. 0 times theorem prover too weak. 7575 trivial. 0 not checked. [2025-02-08 09:11:48,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:11:48,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513743306] [2025-02-08 09:11:48,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513743306] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:11:48,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252784618] [2025-02-08 09:11:48,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:11:48,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:48,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:11:48,245 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:11:48,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 09:11:48,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 414 statements into 27 equivalence classes. [2025-02-08 09:11:48,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 414 statements. [2025-02-08 09:11:48,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 09:11:48,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:11:48,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 09:11:48,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:11:48,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7816 backedges. 171 proven. 42 refuted. 0 times theorem prover too weak. 7603 trivial. 0 not checked. [2025-02-08 09:11:48,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:11:48,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7816 backedges. 171 proven. 42 refuted. 0 times theorem prover too weak. 7603 trivial. 0 not checked. [2025-02-08 09:11:48,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252784618] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:11:48,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:11:48,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 09:11:48,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241701093] [2025-02-08 09:11:48,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:11:48,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 09:11:48,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:11:48,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 09:11:48,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-08 09:11:48,929 INFO L87 Difference]: Start difference. First operand 187 states and 244 transitions. Second operand has 14 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-08 09:11:49,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:11:49,008 INFO L93 Difference]: Finished difference Result 187 states and 244 transitions. [2025-02-08 09:11:49,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 09:11:49,009 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 414 [2025-02-08 09:11:49,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:11:49,009 INFO L225 Difference]: With dead ends: 187 [2025-02-08 09:11:49,009 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 09:11:49,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 837 GetRequests, 819 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-02-08 09:11:49,011 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:11:49,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 75 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:11:49,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 09:11:49,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 09:11:49,011 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-08 09:11:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 09:11:49,012 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 414 [2025-02-08 09:11:49,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:11:49,012 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 09:11:49,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-08 09:11:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 09:11:49,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 09:11:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-02-08 09:11:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-02-08 09:11:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-02-08 09:11:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-02-08 09:11:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-02-08 09:11:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-02-08 09:11:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-02-08 09:11:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-02-08 09:11:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-02-08 09:11:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-02-08 09:11:49,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-08 09:11:49,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:11:49,220 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:11:49,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 09:11:50,843 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 09:11:50,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 09:11:50 BoogieIcfgContainer [2025-02-08 09:11:50,858 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 09:11:50,859 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 09:11:50,859 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 09:11:50,859 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 09:11:50,859 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:11:38" (3/4) ... [2025-02-08 09:11:50,861 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 09:11:50,865 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-08 09:11:50,869 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-08 09:11:50,869 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 09:11:50,869 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 09:11:50,869 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 09:11:50,931 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 09:11:50,931 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 09:11:50,931 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 09:11:50,932 INFO L158 Benchmark]: Toolchain (without parser) took 13073.90ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 111.6MB in the beginning and 416.3MB in the end (delta: -304.6MB). Peak memory consumption was 118.1MB. Max. memory is 16.1GB. [2025-02-08 09:11:50,933 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory was 125.3MB in the beginning and 125.0MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:11:50,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.28ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 100.4MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:11:50,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.38ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:11:50,934 INFO L158 Benchmark]: Boogie Preprocessor took 32.64ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 98.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:11:50,934 INFO L158 Benchmark]: IcfgBuilder took 222.01ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 84.7MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 09:11:50,934 INFO L158 Benchmark]: TraceAbstraction took 12563.84ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 84.7MB in the beginning and 424.0MB in the end (delta: -339.3MB). Peak memory consumption was 169.6MB. Max. memory is 16.1GB. [2025-02-08 09:11:50,934 INFO L158 Benchmark]: Witness Printer took 72.70ms. Allocated memory is still 570.4MB. Free memory was 424.0MB in the beginning and 416.3MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:11:50,935 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory was 125.3MB in the beginning and 125.0MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.28ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 100.4MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.38ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.64ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 98.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 222.01ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 84.7MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12563.84ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 84.7MB in the beginning and 424.0MB in the end (delta: -339.3MB). Peak memory consumption was 169.6MB. Max. memory is 16.1GB. * Witness Printer took 72.70ms. Allocated memory is still 570.4MB. Free memory was 424.0MB in the beginning and 416.3MB in the end (delta: 7.8MB). 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: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: 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 2 procedures, 47 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 22, TraceHistogramMax: 58, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 457 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 335 mSDsluCounter, 4191 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3387 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1836 IncrementalHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 804 mSDtfsCounter, 1836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3297 GetRequests, 3079 SyntacticMatches, 4 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=18, InterpolantAutomatonStates: 217, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 156 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 3925 NumberOfCodeBlocks, 2250 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 5388 ConstructedInterpolants, 0 QuantifiedInterpolants, 10214 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2143 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 45 InterpolantComputations, 12 PerfectInterpolantSequences, 49525/51408 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 10 specifications checked. All of them hold - InvariantResult [Line: 37]: Location Invariant Derived location invariant: ((((((((inlen <= 2147483647) && (2 <= bufferlen)) && (in <= 2147483646)) && (1 <= in)) && (bufferlen <= 2147483646)) && (buf <= 2147483646)) && (1 <= buf)) || (((((inlen <= 2147483647) && (2 <= bufferlen)) && (buf == 0)) && (bufferlen <= 2147483646)) && (in == 0))) RESULT: Ultimate proved your program to be correct! [2025-02-08 09:11:50,949 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