./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/nr5.c --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/array-tiling/nr5.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a05e17fa6f76d5004d5085f0b83441da7dbecb194f05c3b661e69c00b5f4df0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:49:59,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:49:59,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 08:49:59,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:49:59,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:49:59,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:49:59,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:49:59,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:49:59,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:49:59,212 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:49:59,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:49:59,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:49:59,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:49:59,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:49:59,213 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:49:59,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:49:59,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 08:49:59,213 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:49:59,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:49:59,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:49:59,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:49:59,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 08:49:59,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:49:59,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 08:49:59,213 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 08:49:59,214 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:49:59,214 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:49:59,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 08:49:59,214 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:49:59,214 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:49:59,214 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:49:59,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:49:59,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:49:59,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:49:59,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:49:59,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:49:59,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:49:59,215 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 08:49:59,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 08:49:59,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:49:59,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:49:59,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:49:59,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:49:59,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:49:59,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:49:59,215 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 -> 7a05e17fa6f76d5004d5085f0b83441da7dbecb194f05c3b661e69c00b5f4df0 [2025-02-08 08:49:59,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:49:59,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:49:59,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:49:59,450 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:49:59,454 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:49:59,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr5.c [2025-02-08 08:50:00,603 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad11c177e/c66f864d810947369eea1889262873c2/FLAG0e9fc81c6 [2025-02-08 08:50:00,831 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:50:00,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/nr5.c [2025-02-08 08:50:00,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad11c177e/c66f864d810947369eea1889262873c2/FLAG0e9fc81c6 [2025-02-08 08:50:00,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad11c177e/c66f864d810947369eea1889262873c2 [2025-02-08 08:50:00,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:50:00,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:50:00,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:50:00,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:50:00,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:50:00,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:50:00" (1/1) ... [2025-02-08 08:50:00,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f92fc21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:50:00, skipping insertion in model container [2025-02-08 08:50:00,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:50:00" (1/1) ... [2025-02-08 08:50:00,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:50:00,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:50:01,003 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:50:01,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:50:01,034 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:50:01,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:50:01 WrapperNode [2025-02-08 08:50:01,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:50:01,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:50:01,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:50:01,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:50:01,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:50:01" (1/1) ... [2025-02-08 08:50:01,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:50:01" (1/1) ... [2025-02-08 08:50:01,062 INFO L138 Inliner]: procedures = 15, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 91 [2025-02-08 08:50:01,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:50:01,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:50:01,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:50:01,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:50:01,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:50:01" (1/1) ... [2025-02-08 08:50:01,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:50:01" (1/1) ... [2025-02-08 08:50:01,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:50:01" (1/1) ... [2025-02-08 08:50:01,087 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 6, 4]. 50 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 2 writes are split as follows [0, 0, 2]. [2025-02-08 08:50:01,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:50:01" (1/1) ... [2025-02-08 08:50:01,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:50:01" (1/1) ... [2025-02-08 08:50:01,093 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:50:01" (1/1) ... [2025-02-08 08:50:01,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:50:01" (1/1) ... [2025-02-08 08:50:01,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:50:01" (1/1) ... [2025-02-08 08:50:01,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:50:01" (1/1) ... [2025-02-08 08:50:01,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:50:01,103 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:50:01,104 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:50:01,104 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:50:01,108 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:50:01" (1/1) ... [2025-02-08 08:50:01,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:50:01,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:01,135 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 08:50:01,137 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 08:50:01,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:50:01,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:50:01,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:50:01,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:50:01,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:50:01,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:50:01,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:50:01,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:50:01,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:50:01,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:50:01,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:50:01,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:50:01,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:50:01,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:50:01,198 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:50:01,199 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:50:01,346 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-02-08 08:50:01,347 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:50:01,353 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:50:01,353 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:50:01,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:50:01 BoogieIcfgContainer [2025-02-08 08:50:01,353 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:50:01,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:50:01,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:50:01,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:50:01,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:50:00" (1/3) ... [2025-02-08 08:50:01,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d14d61e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:50:01, skipping insertion in model container [2025-02-08 08:50:01,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:50:01" (2/3) ... [2025-02-08 08:50:01,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d14d61e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:50:01, skipping insertion in model container [2025-02-08 08:50:01,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:50:01" (3/3) ... [2025-02-08 08:50:01,359 INFO L128 eAbstractionObserver]: Analyzing ICFG nr5.c [2025-02-08 08:50:01,368 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:50:01,370 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nr5.c that has 1 procedures, 52 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-02-08 08:50:01,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:50:01,417 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;@3fcb8192, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:50:01,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 08:50:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 51 states have internal predecessors, (60), 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 08:50:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:50:01,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:01,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:01,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:01,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:01,426 INFO L85 PathProgramCache]: Analyzing trace with hash -670549157, now seen corresponding path program 1 times [2025-02-08 08:50:01,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:01,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145081694] [2025-02-08 08:50:01,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:01,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:01,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:50:01,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:50:01,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:01,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:01,539 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 08:50:01,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:01,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145081694] [2025-02-08 08:50:01,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145081694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:01,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:01,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:50:01,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329314404] [2025-02-08 08:50:01,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:01,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 08:50:01,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:01,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 08:50:01,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:50:01,559 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 51 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:01,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:01,570 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2025-02-08 08:50:01,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 08:50:01,572 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 08:50:01,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:01,576 INFO L225 Difference]: With dead ends: 99 [2025-02-08 08:50:01,577 INFO L226 Difference]: Without dead ends: 48 [2025-02-08 08:50:01,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 08:50:01,582 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:01,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:01,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-08 08:50:01,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-08 08:50:01,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.625) internal successors, (52), 47 states have internal predecessors, (52), 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 08:50:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-02-08 08:50:01,611 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 7 [2025-02-08 08:50:01,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:01,611 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-02-08 08:50:01,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:01,612 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-02-08 08:50:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:50:01,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:01,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:01,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:50:01,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:01,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:01,614 INFO L85 PathProgramCache]: Analyzing trace with hash -670519366, now seen corresponding path program 1 times [2025-02-08 08:50:01,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:01,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586034590] [2025-02-08 08:50:01,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:01,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:01,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:50:01,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:50:01,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:01,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:01,786 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 08:50:01,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:01,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586034590] [2025-02-08 08:50:01,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586034590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:01,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:01,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:50:01,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908495087] [2025-02-08 08:50:01,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:01,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:50:01,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:01,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:50:01,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:01,787 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:01,806 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2025-02-08 08:50:01,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:50:01,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 08:50:01,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:01,807 INFO L225 Difference]: With dead ends: 48 [2025-02-08 08:50:01,807 INFO L226 Difference]: Without dead ends: 47 [2025-02-08 08:50:01,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:01,811 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 44 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 08:50:01,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-08 08:50:01,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-08 08:50:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.59375) internal successors, (51), 46 states have internal predecessors, (51), 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 08:50:01,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-02-08 08:50:01,814 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 7 [2025-02-08 08:50:01,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:01,814 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-02-08 08:50:01,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:01,814 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-02-08 08:50:01,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 08:50:01,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:01,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:01,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:50:01,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:01,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:01,815 INFO L85 PathProgramCache]: Analyzing trace with hash 688736151, now seen corresponding path program 1 times [2025-02-08 08:50:01,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:01,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081340158] [2025-02-08 08:50:01,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:01,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:01,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:50:01,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:50:01,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:01,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:01,986 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 08:50:01,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:01,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081340158] [2025-02-08 08:50:01,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081340158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:01,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:01,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:50:01,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459896240] [2025-02-08 08:50:01,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:01,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:50:01,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:01,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:50:01,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:50:01,988 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:02,005 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2025-02-08 08:50:02,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:50:02,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 08:50:02,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:02,006 INFO L225 Difference]: With dead ends: 47 [2025-02-08 08:50:02,006 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 08:50:02,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:50:02,007 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:02,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 43 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:02,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 08:50:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-08 08:50:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.5625) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2025-02-08 08:50:02,010 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 8 [2025-02-08 08:50:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:02,010 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2025-02-08 08:50:02,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2025-02-08 08:50:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 08:50:02,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:02,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:02,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:50:02,011 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:02,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:02,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1079916439, now seen corresponding path program 1 times [2025-02-08 08:50:02,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:02,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130766517] [2025-02-08 08:50:02,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:02,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:02,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:50:02,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:50:02,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:02,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:02,071 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 08:50:02,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:02,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130766517] [2025-02-08 08:50:02,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130766517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:02,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:02,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:50:02,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733789468] [2025-02-08 08:50:02,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:02,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:50:02,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:02,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:50:02,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:50:02,072 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 08:50:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:02,119 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2025-02-08 08:50:02,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:50:02,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-02-08 08:50:02,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:02,120 INFO L225 Difference]: With dead ends: 102 [2025-02-08 08:50:02,120 INFO L226 Difference]: Without dead ends: 61 [2025-02-08 08:50:02,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 08:50:02,120 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:02,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 71 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:02,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-08 08:50:02,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2025-02-08 08:50:02,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 46 states have internal predecessors, (51), 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 08:50:02,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-02-08 08:50:02,125 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 11 [2025-02-08 08:50:02,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:02,125 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-02-08 08:50:02,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 08:50:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-02-08 08:50:02,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 08:50:02,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:02,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:02,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:50:02,126 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:02,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:02,126 INFO L85 PathProgramCache]: Analyzing trace with hash -882304951, now seen corresponding path program 1 times [2025-02-08 08:50:02,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:02,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875582992] [2025-02-08 08:50:02,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:02,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:02,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:50:02,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:50:02,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:02,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:02,169 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 08:50:02,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:02,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875582992] [2025-02-08 08:50:02,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875582992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:02,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:02,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:50:02,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724593277] [2025-02-08 08:50:02,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:02,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:50:02,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:02,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:50:02,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:50:02,170 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 08:50:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:02,213 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2025-02-08 08:50:02,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:50:02,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 08:50:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:02,214 INFO L225 Difference]: With dead ends: 71 [2025-02-08 08:50:02,214 INFO L226 Difference]: Without dead ends: 67 [2025-02-08 08:50:02,214 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 08:50:02,215 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:02,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 57 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-08 08:50:02,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2025-02-08 08:50:02,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 64 states have internal predecessors, (78), 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 08:50:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2025-02-08 08:50:02,219 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 12 [2025-02-08 08:50:02,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:02,219 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2025-02-08 08:50:02,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 08:50:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2025-02-08 08:50:02,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 08:50:02,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:02,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:02,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:50:02,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:02,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:02,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1786500665, now seen corresponding path program 1 times [2025-02-08 08:50:02,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:02,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028426275] [2025-02-08 08:50:02,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:02,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:02,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:50:02,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:50:02,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:02,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:02,264 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 08:50:02,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:02,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028426275] [2025-02-08 08:50:02,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028426275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:02,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:02,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:50:02,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173615686] [2025-02-08 08:50:02,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:02,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:50:02,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:02,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:50:02,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:02,265 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 08:50:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:02,346 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2025-02-08 08:50:02,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:50:02,346 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-08 08:50:02,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:02,347 INFO L225 Difference]: With dead ends: 81 [2025-02-08 08:50:02,347 INFO L226 Difference]: Without dead ends: 77 [2025-02-08 08:50:02,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:02,348 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 24 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:02,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 70 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:02,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-08 08:50:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2025-02-08 08:50:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 73 states have internal predecessors, (88), 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 08:50:02,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2025-02-08 08:50:02,353 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 14 [2025-02-08 08:50:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:02,353 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2025-02-08 08:50:02,353 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), 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 08:50:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2025-02-08 08:50:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 08:50:02,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:02,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:02,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:50:02,354 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:02,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:02,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1371504718, now seen corresponding path program 1 times [2025-02-08 08:50:02,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:02,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232061974] [2025-02-08 08:50:02,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:02,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:02,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:50:02,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:50:02,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:02,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:02,424 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 08:50:02,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:02,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232061974] [2025-02-08 08:50:02,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232061974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:02,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:02,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:50:02,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014650407] [2025-02-08 08:50:02,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:02,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:50:02,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:02,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:50:02,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:02,426 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 08:50:02,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:02,463 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2025-02-08 08:50:02,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:50:02,463 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), 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 16 [2025-02-08 08:50:02,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:02,464 INFO L225 Difference]: With dead ends: 83 [2025-02-08 08:50:02,465 INFO L226 Difference]: Without dead ends: 81 [2025-02-08 08:50:02,465 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 08:50:02,465 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 2 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:02,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 108 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-08 08:50:02,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-08 08:50:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 80 states have internal predecessors, (96), 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 08:50:02,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2025-02-08 08:50:02,470 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 16 [2025-02-08 08:50:02,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:02,470 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2025-02-08 08:50:02,470 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), 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 08:50:02,470 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2025-02-08 08:50:02,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 08:50:02,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:02,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:02,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:50:02,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:02,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:02,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1593415025, now seen corresponding path program 1 times [2025-02-08 08:50:02,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:02,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105628469] [2025-02-08 08:50:02,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:02,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:02,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:50:02,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:50:02,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:02,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:02,542 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 08:50:02,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:02,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105628469] [2025-02-08 08:50:02,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105628469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:02,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:02,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:50:02,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729873067] [2025-02-08 08:50:02,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:02,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:50:02,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:02,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:50:02,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:02,543 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 08:50:02,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:02,587 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2025-02-08 08:50:02,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:50:02,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2025-02-08 08:50:02,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:02,588 INFO L225 Difference]: With dead ends: 102 [2025-02-08 08:50:02,588 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 08:50:02,588 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 08:50:02,589 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:02,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 109 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:02,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 08:50:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2025-02-08 08:50:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 95 states have internal predecessors, (120), 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 08:50:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2025-02-08 08:50:02,597 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 17 [2025-02-08 08:50:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:02,597 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2025-02-08 08:50:02,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 08:50:02,597 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2025-02-08 08:50:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 08:50:02,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:02,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:02,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:50:02,597 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:02,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:02,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1448443426, now seen corresponding path program 1 times [2025-02-08 08:50:02,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:02,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279620834] [2025-02-08 08:50:02,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:02,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:02,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:50:02,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:50:02,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:02,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:50:02,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:02,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279620834] [2025-02-08 08:50:02,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279620834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:02,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:02,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:50:02,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297524590] [2025-02-08 08:50:02,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:02,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:50:02,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:02,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:50:02,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:02,667 INFO L87 Difference]: Start difference. First operand 96 states and 120 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:02,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:02,723 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2025-02-08 08:50:02,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:50:02,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-08 08:50:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:02,723 INFO L225 Difference]: With dead ends: 102 [2025-02-08 08:50:02,724 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 08:50:02,724 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 08:50:02,724 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:02,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 08:50:02,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2025-02-08 08:50:02,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 97 states have internal predecessors, (122), 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 08:50:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 122 transitions. [2025-02-08 08:50:02,732 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 122 transitions. Word has length 20 [2025-02-08 08:50:02,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:02,732 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 122 transitions. [2025-02-08 08:50:02,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:02,732 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2025-02-08 08:50:02,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 08:50:02,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:02,733 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:02,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:50:02,733 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:02,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:02,733 INFO L85 PathProgramCache]: Analyzing trace with hash -796236211, now seen corresponding path program 1 times [2025-02-08 08:50:02,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:02,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555181813] [2025-02-08 08:50:02,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:02,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:02,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:50:02,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:50:02,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:02,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:50:02,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:02,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555181813] [2025-02-08 08:50:02,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555181813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:02,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:02,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:50:02,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855169156] [2025-02-08 08:50:02,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:02,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:50:02,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:02,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:50:02,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:50:02,913 INFO L87 Difference]: Start difference. First operand 98 states and 122 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 08:50:02,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:02,970 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2025-02-08 08:50:02,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:50:02,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 23 [2025-02-08 08:50:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:02,971 INFO L225 Difference]: With dead ends: 117 [2025-02-08 08:50:02,972 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 08:50:02,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:50:02,972 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 84 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:02,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 50 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:02,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 08:50:02,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2025-02-08 08:50:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 97 states have internal predecessors, (121), 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 08:50:02,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2025-02-08 08:50:02,979 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 23 [2025-02-08 08:50:02,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:02,979 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2025-02-08 08:50:02,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 08:50:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2025-02-08 08:50:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 08:50:02,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:02,981 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:02,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:50:02,981 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:02,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:02,981 INFO L85 PathProgramCache]: Analyzing trace with hash -935439524, now seen corresponding path program 1 times [2025-02-08 08:50:02,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:02,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240072235] [2025-02-08 08:50:02,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:02,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:02,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:50:02,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:50:02,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:02,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:50:03,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:03,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240072235] [2025-02-08 08:50:03,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240072235] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:03,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971821752] [2025-02-08 08:50:03,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:03,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:03,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:03,082 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 08:50:03,086 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 08:50:03,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:50:03,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:50:03,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:03,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:03,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:50:03,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:50:03,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:50:03,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971821752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:03,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:50:03,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-02-08 08:50:03,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743694350] [2025-02-08 08:50:03,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:03,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:50:03,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:03,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:50:03,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:50:03,243 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:03,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:03,344 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2025-02-08 08:50:03,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:50:03,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-08 08:50:03,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:03,345 INFO L225 Difference]: With dead ends: 102 [2025-02-08 08:50:03,345 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 08:50:03,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:50:03,345 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:03,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 82 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:03,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 08:50:03,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2025-02-08 08:50:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 96 states have internal predecessors, (117), 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 08:50:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2025-02-08 08:50:03,353 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 23 [2025-02-08 08:50:03,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:03,353 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2025-02-08 08:50:03,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:03,353 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2025-02-08 08:50:03,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 08:50:03,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:03,354 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:03,363 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 08:50:03,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 08:50:03,554 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:03,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:03,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1066145822, now seen corresponding path program 1 times [2025-02-08 08:50:03,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:03,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656114251] [2025-02-08 08:50:03,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:03,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:03,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:50:03,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:50:03,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:03,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:50:03,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:03,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656114251] [2025-02-08 08:50:03,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656114251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:03,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:03,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:50:03,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378538463] [2025-02-08 08:50:03,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:03,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:50:03,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:03,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:50:03,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:03,605 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:03,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:03,664 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2025-02-08 08:50:03,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:50:03,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-08 08:50:03,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:03,665 INFO L225 Difference]: With dead ends: 100 [2025-02-08 08:50:03,665 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 08:50:03,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:03,666 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:03,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 08:50:03,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-02-08 08:50:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 96 states have internal predecessors, (115), 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 08:50:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2025-02-08 08:50:03,669 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 24 [2025-02-08 08:50:03,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:03,669 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2025-02-08 08:50:03,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:03,669 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2025-02-08 08:50:03,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 08:50:03,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:03,670 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:03,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:50:03,670 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:03,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:03,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1931049028, now seen corresponding path program 1 times [2025-02-08 08:50:03,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:03,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472159669] [2025-02-08 08:50:03,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:03,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:03,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 08:50:03,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 08:50:03,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:03,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:50:03,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:03,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472159669] [2025-02-08 08:50:03,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472159669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:03,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:03,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:50:03,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743884290] [2025-02-08 08:50:03,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:03,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:50:03,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:03,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:50:03,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:03,708 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:03,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:03,740 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2025-02-08 08:50:03,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:50:03,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-08 08:50:03,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:03,742 INFO L225 Difference]: With dead ends: 97 [2025-02-08 08:50:03,742 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 08:50:03,742 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 08:50:03,742 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:03,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 89 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:03,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 08:50:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2025-02-08 08:50:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 84 states have internal predecessors, (101), 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 08:50:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2025-02-08 08:50:03,748 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 26 [2025-02-08 08:50:03,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:03,748 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2025-02-08 08:50:03,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2025-02-08 08:50:03,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 08:50:03,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:03,749 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:03,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:50:03,749 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:03,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:03,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1958649321, now seen corresponding path program 1 times [2025-02-08 08:50:03,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:03,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136994632] [2025-02-08 08:50:03,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:03,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:03,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:50:03,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:50:03,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:03,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:50:03,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:03,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136994632] [2025-02-08 08:50:03,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136994632] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:03,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900299456] [2025-02-08 08:50:03,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:03,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:03,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:03,830 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 08:50:03,830 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 08:50:03,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:50:03,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:50:03,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:03,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:03,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:50:03,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:50:03,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:50:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:50:03,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900299456] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:50:03,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:50:03,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 08:50:03,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306282965] [2025-02-08 08:50:03,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:50:03,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:50:03,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:03,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:50:03,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:50:03,926 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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 08:50:03,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:03,989 INFO L93 Difference]: Finished difference Result 195 states and 233 transitions. [2025-02-08 08:50:03,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:50:03,989 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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 28 [2025-02-08 08:50:03,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:03,990 INFO L225 Difference]: With dead ends: 195 [2025-02-08 08:50:03,990 INFO L226 Difference]: Without dead ends: 133 [2025-02-08 08:50:03,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:50:03,990 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 57 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:03,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 223 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-08 08:50:03,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2025-02-08 08:50:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 112 states have (on average 1.3660714285714286) internal successors, (153), 124 states have internal predecessors, (153), 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 08:50:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2025-02-08 08:50:03,994 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 28 [2025-02-08 08:50:03,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:03,994 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2025-02-08 08:50:03,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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 08:50:03,994 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2025-02-08 08:50:03,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 08:50:03,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:03,995 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:04,002 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 08:50:04,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:04,199 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:04,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:04,199 INFO L85 PathProgramCache]: Analyzing trace with hash 704938423, now seen corresponding path program 2 times [2025-02-08 08:50:04,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:04,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042147126] [2025-02-08 08:50:04,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:04,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:04,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-08 08:50:04,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 08:50:04,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:50:04,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 08:50:04,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:04,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042147126] [2025-02-08 08:50:04,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042147126] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:04,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996337424] [2025-02-08 08:50:04,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:04,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:04,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:04,280 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 08:50:04,282 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 08:50:04,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-08 08:50:04,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 08:50:04,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:50:04,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:04,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 08:50:04,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:04,401 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:50:04,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:50:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:50:04,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996337424] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:50:04,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:50:04,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 14 [2025-02-08 08:50:04,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254820957] [2025-02-08 08:50:04,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:50:04,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:50:04,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:04,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:50:04,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:50:04,484 INFO L87 Difference]: Start difference. First operand 125 states and 153 transitions. Second operand has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 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 08:50:04,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:04,869 INFO L93 Difference]: Finished difference Result 340 states and 454 transitions. [2025-02-08 08:50:04,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-08 08:50:04,869 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 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 46 [2025-02-08 08:50:04,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:04,870 INFO L225 Difference]: With dead ends: 340 [2025-02-08 08:50:04,870 INFO L226 Difference]: Without dead ends: 264 [2025-02-08 08:50:04,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=815, Unknown=0, NotChecked=0, Total=992 [2025-02-08 08:50:04,871 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 254 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:04,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 199 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 08:50:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-02-08 08:50:04,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 247. [2025-02-08 08:50:04,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 234 states have (on average 1.4444444444444444) internal successors, (338), 246 states have internal predecessors, (338), 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 08:50:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 338 transitions. [2025-02-08 08:50:04,883 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 338 transitions. Word has length 46 [2025-02-08 08:50:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:04,883 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 338 transitions. [2025-02-08 08:50:04,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 14 states have internal predecessors, (81), 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 08:50:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 338 transitions. [2025-02-08 08:50:04,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-08 08:50:04,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:04,885 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:04,897 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 08:50:05,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:05,091 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:05,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:05,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1627664775, now seen corresponding path program 1 times [2025-02-08 08:50:05,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:05,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854258823] [2025-02-08 08:50:05,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:05,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:05,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 08:50:05,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 08:50:05,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:05,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-08 08:50:05,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:05,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854258823] [2025-02-08 08:50:05,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854258823] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:05,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370231714] [2025-02-08 08:50:05,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:05,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:05,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:05,211 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 08:50:05,214 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 08:50:05,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 08:50:05,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 08:50:05,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:05,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:05,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 08:50:05,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:05,438 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:50:05,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:50:05,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370231714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:05,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:50:05,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 15 [2025-02-08 08:50:05,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241115075] [2025-02-08 08:50:05,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:05,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:50:05,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:05,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:50:05,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-08 08:50:05,440 INFO L87 Difference]: Start difference. First operand 247 states and 338 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 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 08:50:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:05,575 INFO L93 Difference]: Finished difference Result 433 states and 591 transitions. [2025-02-08 08:50:05,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:50:05,575 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 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 65 [2025-02-08 08:50:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:05,577 INFO L225 Difference]: With dead ends: 433 [2025-02-08 08:50:05,577 INFO L226 Difference]: Without dead ends: 248 [2025-02-08 08:50:05,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-08 08:50:05,578 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 64 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:05,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 237 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:05,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-02-08 08:50:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 234. [2025-02-08 08:50:05,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 222 states have (on average 1.3873873873873874) internal successors, (308), 233 states have internal predecessors, (308), 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 08:50:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 308 transitions. [2025-02-08 08:50:05,590 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 308 transitions. Word has length 65 [2025-02-08 08:50:05,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:05,590 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 308 transitions. [2025-02-08 08:50:05,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 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 08:50:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 308 transitions. [2025-02-08 08:50:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-08 08:50:05,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:05,593 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:05,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:50:05,794 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,SelfDestructingSolverStorable15 [2025-02-08 08:50:05,794 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:05,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:05,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1275669176, now seen corresponding path program 1 times [2025-02-08 08:50:05,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:05,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941929367] [2025-02-08 08:50:05,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:05,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:05,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 08:50:05,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 08:50:05,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:05,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-02-08 08:50:05,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:05,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941929367] [2025-02-08 08:50:05,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941929367] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:05,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884164391] [2025-02-08 08:50:05,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:05,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:05,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:05,894 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 08:50:05,897 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 08:50:05,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 08:50:05,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 08:50:05,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:05,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:05,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:50:05,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-02-08 08:50:06,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:50:06,086 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-02-08 08:50:06,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884164391] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:50:06,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:50:06,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 08:50:06,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836733007] [2025-02-08 08:50:06,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:50:06,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:50:06,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:06,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:50:06,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:50:06,087 INFO L87 Difference]: Start difference. First operand 234 states and 308 transitions. Second operand has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 10 states have internal predecessors, (86), 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 08:50:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:06,194 INFO L93 Difference]: Finished difference Result 249 states and 328 transitions. [2025-02-08 08:50:06,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:50:06,195 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 10 states have internal predecessors, (86), 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 65 [2025-02-08 08:50:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:06,196 INFO L225 Difference]: With dead ends: 249 [2025-02-08 08:50:06,196 INFO L226 Difference]: Without dead ends: 246 [2025-02-08 08:50:06,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:50:06,196 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 32 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:06,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 148 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:06,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-08 08:50:06,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-02-08 08:50:06,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 234 states have (on average 1.3205128205128205) internal successors, (309), 245 states have internal predecessors, (309), 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 08:50:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 309 transitions. [2025-02-08 08:50:06,203 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 309 transitions. Word has length 65 [2025-02-08 08:50:06,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:06,204 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 309 transitions. [2025-02-08 08:50:06,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.555555555555555) internal successors, (86), 10 states have internal predecessors, (86), 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 08:50:06,204 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 309 transitions. [2025-02-08 08:50:06,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 08:50:06,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:06,204 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:06,210 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 08:50:06,404 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,SelfDestructingSolverStorable16 [2025-02-08 08:50:06,405 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:06,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:06,405 INFO L85 PathProgramCache]: Analyzing trace with hash -891038796, now seen corresponding path program 1 times [2025-02-08 08:50:06,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:06,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683067167] [2025-02-08 08:50:06,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:06,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:06,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 08:50:06,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 08:50:06,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:06,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-02-08 08:50:06,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:06,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683067167] [2025-02-08 08:50:06,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683067167] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:06,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830997750] [2025-02-08 08:50:06,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:06,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:06,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:06,478 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 08:50:06,479 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 08:50:06,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-08 08:50:06,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 08:50:06,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:06,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:06,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:50:06,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:06,591 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-02-08 08:50:06,591 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:50:06,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830997750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:06,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:50:06,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-08 08:50:06,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630408290] [2025-02-08 08:50:06,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:06,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:50:06,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:06,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:50:06,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:50:06,592 INFO L87 Difference]: Start difference. First operand 246 states and 309 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 08:50:06,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:06,662 INFO L93 Difference]: Finished difference Result 248 states and 309 transitions. [2025-02-08 08:50:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:50:06,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-08 08:50:06,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:06,663 INFO L225 Difference]: With dead ends: 248 [2025-02-08 08:50:06,663 INFO L226 Difference]: Without dead ends: 243 [2025-02-08 08:50:06,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:50:06,664 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 29 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:06,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 88 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-02-08 08:50:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-02-08 08:50:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 234 states have (on average 1.2478632478632479) internal successors, (292), 242 states have internal predecessors, (292), 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 08:50:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 292 transitions. [2025-02-08 08:50:06,669 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 292 transitions. Word has length 66 [2025-02-08 08:50:06,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:06,669 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 292 transitions. [2025-02-08 08:50:06,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 08:50:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 292 transitions. [2025-02-08 08:50:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 08:50:06,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:06,670 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:06,676 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 08:50:06,870 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,SelfDestructingSolverStorable17 [2025-02-08 08:50:06,870 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:06,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:06,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1852398906, now seen corresponding path program 1 times [2025-02-08 08:50:06,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:06,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474798967] [2025-02-08 08:50:06,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:06,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:06,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 08:50:06,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 08:50:06,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:06,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-08 08:50:06,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:06,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474798967] [2025-02-08 08:50:06,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474798967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:06,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:06,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:50:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305387998] [2025-02-08 08:50:06,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:06,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:50:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:06,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:50:06,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:06,935 INFO L87 Difference]: Start difference. First operand 243 states and 292 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 08:50:06,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:06,967 INFO L93 Difference]: Finished difference Result 245 states and 292 transitions. [2025-02-08 08:50:06,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:50:06,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 67 [2025-02-08 08:50:06,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:06,968 INFO L225 Difference]: With dead ends: 245 [2025-02-08 08:50:06,968 INFO L226 Difference]: Without dead ends: 243 [2025-02-08 08:50:06,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:06,969 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:06,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 63 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:06,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-02-08 08:50:06,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-02-08 08:50:06,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 234 states have (on average 1.2307692307692308) internal successors, (288), 242 states have internal predecessors, (288), 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 08:50:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 288 transitions. [2025-02-08 08:50:06,981 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 288 transitions. Word has length 67 [2025-02-08 08:50:06,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:06,981 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 288 transitions. [2025-02-08 08:50:06,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 08:50:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 288 transitions. [2025-02-08 08:50:06,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-08 08:50:06,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:06,982 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:06,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 08:50:06,982 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:06,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:06,984 INFO L85 PathProgramCache]: Analyzing trace with hash -642345216, now seen corresponding path program 1 times [2025-02-08 08:50:06,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:06,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500628115] [2025-02-08 08:50:06,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:06,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:06,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 08:50:07,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 08:50:07,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:07,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-08 08:50:07,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:07,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500628115] [2025-02-08 08:50:07,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500628115] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:07,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519611124] [2025-02-08 08:50:07,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:07,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:07,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:07,081 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 08:50:07,084 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 08:50:07,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 08:50:07,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 08:50:07,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:07,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:07,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:50:07,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-08 08:50:07,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:50:07,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519611124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:07,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:50:07,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 08:50:07,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611965853] [2025-02-08 08:50:07,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:07,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:50:07,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:07,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:50:07,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:50:07,171 INFO L87 Difference]: Start difference. First operand 243 states and 288 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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 08:50:07,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:07,269 INFO L93 Difference]: Finished difference Result 243 states and 288 transitions. [2025-02-08 08:50:07,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:50:07,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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 75 [2025-02-08 08:50:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:07,270 INFO L225 Difference]: With dead ends: 243 [2025-02-08 08:50:07,270 INFO L226 Difference]: Without dead ends: 242 [2025-02-08 08:50:07,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 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 08:50:07,271 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:07,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 120 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:07,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-02-08 08:50:07,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2025-02-08 08:50:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 234 states have (on average 1.2264957264957266) internal successors, (287), 241 states have internal predecessors, (287), 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 08:50:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 287 transitions. [2025-02-08 08:50:07,280 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 287 transitions. Word has length 75 [2025-02-08 08:50:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:07,280 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 287 transitions. [2025-02-08 08:50:07,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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 08:50:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 287 transitions. [2025-02-08 08:50:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-08 08:50:07,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:07,280 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:07,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 08:50:07,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:07,485 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:07,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:07,485 INFO L85 PathProgramCache]: Analyzing trace with hash -781548529, now seen corresponding path program 2 times [2025-02-08 08:50:07,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:07,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809182290] [2025-02-08 08:50:07,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:07,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:07,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-08 08:50:07,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 08:50:07,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:50:07,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 65 proven. 5 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-08 08:50:07,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:07,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809182290] [2025-02-08 08:50:07,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809182290] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:07,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790339368] [2025-02-08 08:50:07,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:07,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:07,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:07,622 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 08:50:07,623 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 08:50:07,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-08 08:50:07,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 08:50:07,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:50:07,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:07,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 08:50:07,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-02-08 08:50:07,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:50:07,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790339368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:07,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:50:07,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2025-02-08 08:50:07,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178290401] [2025-02-08 08:50:07,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:07,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:50:07,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:07,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:50:07,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:50:07,831 INFO L87 Difference]: Start difference. First operand 242 states and 287 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 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 08:50:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:07,933 INFO L93 Difference]: Finished difference Result 242 states and 287 transitions. [2025-02-08 08:50:07,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:50:07,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 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 75 [2025-02-08 08:50:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:07,934 INFO L225 Difference]: With dead ends: 242 [2025-02-08 08:50:07,934 INFO L226 Difference]: Without dead ends: 240 [2025-02-08 08:50:07,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:50:07,935 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:07,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 93 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:07,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-02-08 08:50:07,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-02-08 08:50:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 234 states have (on average 1.1666666666666667) internal successors, (273), 239 states have internal predecessors, (273), 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 08:50:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 273 transitions. [2025-02-08 08:50:07,941 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 273 transitions. Word has length 75 [2025-02-08 08:50:07,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:07,941 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 273 transitions. [2025-02-08 08:50:07,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 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 08:50:07,941 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 273 transitions. [2025-02-08 08:50:07,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 08:50:07,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:07,942 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:07,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 08:50:08,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:08,142 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:08,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:08,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1562134756, now seen corresponding path program 1 times [2025-02-08 08:50:08,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:08,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534189710] [2025-02-08 08:50:08,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:08,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:08,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 08:50:08,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 08:50:08,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:08,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-08 08:50:08,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:08,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534189710] [2025-02-08 08:50:08,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534189710] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:08,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531752318] [2025-02-08 08:50:08,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:08,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:08,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:08,212 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 08:50:08,213 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 08:50:08,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 08:50:08,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 08:50:08,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:08,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:08,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:50:08,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:08,328 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-08 08:50:08,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:50:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-08 08:50:08,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531752318] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:50:08,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:50:08,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 08:50:08,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054256898] [2025-02-08 08:50:08,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:50:08,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:50:08,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:08,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:50:08,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:50:08,364 INFO L87 Difference]: Start difference. First operand 240 states and 273 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 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 08:50:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:08,452 INFO L93 Difference]: Finished difference Result 262 states and 300 transitions. [2025-02-08 08:50:08,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:50:08,452 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 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 76 [2025-02-08 08:50:08,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:08,453 INFO L225 Difference]: With dead ends: 262 [2025-02-08 08:50:08,453 INFO L226 Difference]: Without dead ends: 261 [2025-02-08 08:50:08,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:50:08,454 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 34 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:08,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 148 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:08,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-02-08 08:50:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2025-02-08 08:50:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 255 states have (on average 1.1647058823529413) internal successors, (297), 260 states have internal predecessors, (297), 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 08:50:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 297 transitions. [2025-02-08 08:50:08,463 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 297 transitions. Word has length 76 [2025-02-08 08:50:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:08,463 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 297 transitions. [2025-02-08 08:50:08,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 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 08:50:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 297 transitions. [2025-02-08 08:50:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 08:50:08,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:08,464 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:08,471 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 08:50:08,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:08,665 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:08,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:08,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1541799371, now seen corresponding path program 2 times [2025-02-08 08:50:08,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:08,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116564589] [2025-02-08 08:50:08,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:08,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:08,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-02-08 08:50:08,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 76 statements. [2025-02-08 08:50:08,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:50:08,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:08,708 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-02-08 08:50:08,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:08,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116564589] [2025-02-08 08:50:08,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116564589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:08,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:08,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:50:08,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484767759] [2025-02-08 08:50:08,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:08,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:50:08,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:08,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:50:08,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:08,710 INFO L87 Difference]: Start difference. First operand 261 states and 297 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:08,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:08,805 INFO L93 Difference]: Finished difference Result 261 states and 297 transitions. [2025-02-08 08:50:08,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:50:08,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-08 08:50:08,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:08,807 INFO L225 Difference]: With dead ends: 261 [2025-02-08 08:50:08,807 INFO L226 Difference]: Without dead ends: 259 [2025-02-08 08:50:08,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:50:08,807 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 13 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:08,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 66 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:50:08,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-02-08 08:50:08,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-02-08 08:50:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 255 states have (on average 1.1098039215686275) internal successors, (283), 258 states have internal predecessors, (283), 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 08:50:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 283 transitions. [2025-02-08 08:50:08,824 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 283 transitions. Word has length 76 [2025-02-08 08:50:08,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:08,824 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 283 transitions. [2025-02-08 08:50:08,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:08,824 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 283 transitions. [2025-02-08 08:50:08,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 08:50:08,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:08,824 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:08,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 08:50:08,825 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:08,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:08,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1833678757, now seen corresponding path program 2 times [2025-02-08 08:50:08,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:08,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764530822] [2025-02-08 08:50:08,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:08,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:08,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-02-08 08:50:08,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 97 statements. [2025-02-08 08:50:08,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:50:08,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-02-08 08:50:08,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764530822] [2025-02-08 08:50:08,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764530822] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095444501] [2025-02-08 08:50:08,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:08,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:08,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:08,873 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 08:50:08,877 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 08:50:08,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-02-08 08:50:08,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 97 statements. [2025-02-08 08:50:08,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:50:08,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:08,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:50:08,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-02-08 08:50:09,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:50:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-02-08 08:50:09,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095444501] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:50:09,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:50:09,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-02-08 08:50:09,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314672515] [2025-02-08 08:50:09,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:50:09,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:50:09,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:09,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:50:09,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:50:09,108 INFO L87 Difference]: Start difference. First operand 259 states and 283 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:09,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:09,164 INFO L93 Difference]: Finished difference Result 259 states and 283 transitions. [2025-02-08 08:50:09,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:50:09,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-02-08 08:50:09,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:09,165 INFO L225 Difference]: With dead ends: 259 [2025-02-08 08:50:09,165 INFO L226 Difference]: Without dead ends: 222 [2025-02-08 08:50:09,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:50:09,166 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:09,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 37 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:09,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-08 08:50:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-02-08 08:50:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 219 states have (on average 1.08675799086758) internal successors, (238), 221 states have internal predecessors, (238), 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 08:50:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 238 transitions. [2025-02-08 08:50:09,171 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 238 transitions. Word has length 97 [2025-02-08 08:50:09,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:09,171 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 238 transitions. [2025-02-08 08:50:09,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:50:09,171 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 238 transitions. [2025-02-08 08:50:09,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-08 08:50:09,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:09,172 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 12, 12, 12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:09,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 08:50:09,373 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,SelfDestructingSolverStorable23 [2025-02-08 08:50:09,373 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:09,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:09,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1689858059, now seen corresponding path program 1 times [2025-02-08 08:50:09,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:09,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124054108] [2025-02-08 08:50:09,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:50:09,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:09,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-08 08:50:09,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-08 08:50:09,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:50:09,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 389 proven. 0 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2025-02-08 08:50:09,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124054108] [2025-02-08 08:50:09,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124054108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:50:09,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:50:09,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:50:09,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911995370] [2025-02-08 08:50:09,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:50:09,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:50:09,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:09,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:50:09,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:50:09,435 INFO L87 Difference]: Start difference. First operand 222 states and 238 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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 08:50:09,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:09,459 INFO L93 Difference]: Finished difference Result 222 states and 238 transitions. [2025-02-08 08:50:09,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:50:09,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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 161 [2025-02-08 08:50:09,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:09,460 INFO L225 Difference]: With dead ends: 222 [2025-02-08 08:50:09,460 INFO L226 Difference]: Without dead ends: 221 [2025-02-08 08:50:09,460 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 08:50:09,461 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:09,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:09,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-02-08 08:50:09,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2025-02-08 08:50:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 219 states have (on average 1.082191780821918) internal successors, (237), 220 states have internal predecessors, (237), 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 08:50:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 237 transitions. [2025-02-08 08:50:09,466 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 237 transitions. Word has length 161 [2025-02-08 08:50:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:09,466 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 237 transitions. [2025-02-08 08:50:09,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 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 08:50:09,467 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 237 transitions. [2025-02-08 08:50:09,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-08 08:50:09,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:50:09,468 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 13, 13, 12, 12, 12, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:09,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 08:50:09,468 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:50:09,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:50:09,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1057057874, now seen corresponding path program 2 times [2025-02-08 08:50:09,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:50:09,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616439747] [2025-02-08 08:50:09,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:09,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:50:09,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 169 statements into 2 equivalence classes. [2025-02-08 08:50:09,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 169 statements. [2025-02-08 08:50:09,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:50:09,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2025-02-08 08:50:09,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:50:09,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616439747] [2025-02-08 08:50:09,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616439747] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:50:09,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833531659] [2025-02-08 08:50:09,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:50:09,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:50:09,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:50:09,556 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 08:50:09,558 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 08:50:09,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 169 statements into 2 equivalence classes. [2025-02-08 08:50:09,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 169 statements. [2025-02-08 08:50:09,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:50:09,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:50:09,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:50:09,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:50:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2025-02-08 08:50:10,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:50:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2025-02-08 08:50:10,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833531659] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:50:10,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:50:10,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 2] total 8 [2025-02-08 08:50:10,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940158113] [2025-02-08 08:50:10,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:50:10,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:50:10,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:50:10,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:50:10,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:50:10,425 INFO L87 Difference]: Start difference. First operand 221 states and 237 transitions. Second operand has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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 08:50:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:50:10,459 INFO L93 Difference]: Finished difference Result 221 states and 237 transitions. [2025-02-08 08:50:10,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:50:10,460 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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 169 [2025-02-08 08:50:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:50:10,460 INFO L225 Difference]: With dead ends: 221 [2025-02-08 08:50:10,460 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 08:50:10,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:50:10,461 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:50:10,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 15 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:50:10,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 08:50:10,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 08:50:10,461 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 08:50:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 08:50:10,461 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 169 [2025-02-08 08:50:10,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:50:10,461 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 08:50:10,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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 08:50:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 08:50:10,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 08:50:10,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-02-08 08:50:10,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-02-08 08:50:10,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-02-08 08:50:10,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-02-08 08:50:10,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-02-08 08:50:10,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-02-08 08:50:10,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-02-08 08:50:10,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-02-08 08:50:10,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-02-08 08:50:10,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-02-08 08:50:10,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-02-08 08:50:10,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-02-08 08:50:10,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-02-08 08:50:10,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-02-08 08:50:10,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-02-08 08:50:10,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-02-08 08:50:10,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 08:50:10,667 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,SelfDestructingSolverStorable25 [2025-02-08 08:50:10,669 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:50:10,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 08:50:10,988 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:50:11,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:50:11 BoogieIcfgContainer [2025-02-08 08:50:11,000 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:50:11,001 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:50:11,001 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:50:11,001 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:50:11,001 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:50:01" (3/4) ... [2025-02-08 08:50:11,002 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:50:11,014 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 08:50:11,014 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 08:50:11,014 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:50:11,014 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:50:11,083 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:50:11,083 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:50:11,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:50:11,084 INFO L158 Benchmark]: Toolchain (without parser) took 10231.47ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 112.6MB in the beginning and 122.3MB in the end (delta: -9.7MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2025-02-08 08:50:11,084 INFO L158 Benchmark]: CDTParser took 1.29ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:50:11,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.27ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 101.4MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:50:11,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.06ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:50:11,084 INFO L158 Benchmark]: Boogie Preprocessor took 38.72ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:50:11,084 INFO L158 Benchmark]: IcfgBuilder took 249.82ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 83.4MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:50:11,086 INFO L158 Benchmark]: TraceAbstraction took 9645.51ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 83.0MB in the beginning and 127.9MB in the end (delta: -45.0MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2025-02-08 08:50:11,086 INFO L158 Benchmark]: Witness Printer took 82.59ms. Allocated memory is still 218.1MB. Free memory was 127.9MB in the beginning and 122.3MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:50:11,086 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.29ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.27ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 101.4MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.06ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.72ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 249.82ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 83.4MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9645.51ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 83.0MB in the beginning and 127.9MB in the end (delta: -45.0MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. * Witness Printer took 82.59ms. Allocated memory is still 218.1MB. Free memory was 127.9MB in the beginning and 122.3MB in the end (delta: 5.6MB). There was no memory consumed. 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: 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: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 26, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 931 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 931 mSDsluCounter, 2415 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1545 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2378 IncrementalHoareTripleChecker+Invalid, 2433 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 870 mSDtfsCounter, 2378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1369 GetRequests, 1217 SyntacticMatches, 8 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=22, InterpolantAutomatonStates: 164, 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, 26 MinimizatonAttempts, 80 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2059 NumberOfCodeBlocks, 1526 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 2497 ConstructedInterpolants, 0 QuantifiedInterpolants, 8873 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1538 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 43 InterpolantComputations, 20 PerfectInterpolantSequences, 5620/6104 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 16 specifications checked. All of them hold - InvariantResult [Line: 30]: Location Invariant Derived location invariant: ((((((((((((((((i <= 429496729) && (2 <= CELLCOUNT)) && (CELLCOUNT <= 2147483647)) && (3 == j)) && (2 <= i)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) && (2 <= MINVAL)) || (((((((2 == j) && (i <= 429496729)) && (2 <= CELLCOUNT)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) && (2 <= MINVAL))) || ((((((2 <= CELLCOUNT) && (i == 1)) && (CELLCOUNT <= 2147483647)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) && (5 == j)) && (2 <= MINVAL))) || (((((((j <= 1) && (i <= 429496729)) && (2 <= CELLCOUNT)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) && (2 <= MINVAL))) || ((((((j == 4) && (2 <= CELLCOUNT)) && (i == 1)) && (CELLCOUNT <= 2147483647)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) && (2 <= MINVAL))) || ((((((2 <= CELLCOUNT) && (i == 1)) && (CELLCOUNT <= 2147483647)) && (3 == j)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) && (2 <= MINVAL))) || ((((((j <= 1) && (2 <= CELLCOUNT)) && (i == 1)) && (CELLCOUNT <= 2147483647)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) && (2 <= MINVAL))) || ((((((2 == j) && (2 <= CELLCOUNT)) && (i == 1)) && (CELLCOUNT <= 2147483647)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) && (2 <= MINVAL))) || (((((((j == 4) && (i <= 429496729)) && (2 <= CELLCOUNT)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) && (2 <= MINVAL))) || (((((((i <= 429496729) && (2 <= CELLCOUNT)) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) && (5 == j)) && (2 <= MINVAL))) - InvariantResult [Line: 43]: Location Invariant Derived location invariant: ((((((i == 0) && (2 <= CELLCOUNT)) && (CELLCOUNT <= 2147483647)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) && (2 <= MINVAL)) || (((((1 <= i) && (2 <= CELLCOUNT)) && (CELLCOUNT <= 2147483647)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) && (2 <= MINVAL))) - InvariantResult [Line: 28]: Location Invariant Derived location invariant: ((((((2 <= CELLCOUNT) && (CELLCOUNT <= 2147483647)) && (2 <= i)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) && (2 <= MINVAL)) || (((((2 <= CELLCOUNT) && (i == 1)) && (CELLCOUNT <= 2147483647)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) && (2 <= MINVAL))) RESULT: Ultimate proved your program to be correct! [2025-02-08 08:50:11,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE