./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-simple/nested_5.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/loop-simple/nested_5.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 3d0f32d2f39934bb8fd732fa206acfa5d2fb4cacaee37919c0e4326d55891c86 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:12:33,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:12:33,415 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 09:12:33,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:12:33,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:12:33,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:12:33,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:12:33,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:12:33,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:12:33,464 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:12:33,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:12:33,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:12:33,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:12:33,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:12:33,465 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:12:33,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:12:33,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:12:33,465 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 09:12:33,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:12:33,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 09:12:33,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:12:33,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:12:33,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:12:33,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:12:33,465 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:12:33,465 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:12:33,465 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 09:12:33,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:12:33,466 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:12:33,466 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:12:33,466 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:12:33,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:12:33,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:12:33,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:12:33,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:12:33,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:12:33,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:12:33,466 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:12:33,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:12:33,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:12:33,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:12:33,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:12:33,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:12:33,466 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:12:33,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:12:33,466 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 -> 3d0f32d2f39934bb8fd732fa206acfa5d2fb4cacaee37919c0e4326d55891c86 [2025-02-08 09:12:33,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:12:33,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:12:33,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:12:33,851 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:12:33,851 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:12:33,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_5.c [2025-02-08 09:12:35,136 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4045d131/8643c74243134299b86310b70b55a4e5/FLAG968a9a20a [2025-02-08 09:12:35,381 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:12:35,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_5.c [2025-02-08 09:12:35,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4045d131/8643c74243134299b86310b70b55a4e5/FLAG968a9a20a [2025-02-08 09:12:35,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4045d131/8643c74243134299b86310b70b55a4e5 [2025-02-08 09:12:35,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:12:35,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:12:35,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:12:35,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:12:35,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:12:35,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:12:35" (1/1) ... [2025-02-08 09:12:35,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443608fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:35, skipping insertion in model container [2025-02-08 09:12:35,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:12:35" (1/1) ... [2025-02-08 09:12:35,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:12:35,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:12:35,820 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:12:35,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:12:35,836 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:12:35,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:35 WrapperNode [2025-02-08 09:12:35,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:12:35,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:12:35,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:12:35,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:12:35,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:35" (1/1) ... [2025-02-08 09:12:35,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:35" (1/1) ... [2025-02-08 09:12:35,854 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2025-02-08 09:12:35,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:12:35,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:12:35,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:12:35,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:12:35,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:35" (1/1) ... [2025-02-08 09:12:35,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:35" (1/1) ... [2025-02-08 09:12:35,859 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:35" (1/1) ... [2025-02-08 09:12:35,865 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 09:12:35,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:35" (1/1) ... [2025-02-08 09:12:35,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:35" (1/1) ... [2025-02-08 09:12:35,867 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:35" (1/1) ... [2025-02-08 09:12:35,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:35" (1/1) ... [2025-02-08 09:12:35,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:35" (1/1) ... [2025-02-08 09:12:35,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:35" (1/1) ... [2025-02-08 09:12:35,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:12:35,869 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:12:35,869 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:12:35,869 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:12:35,869 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:35" (1/1) ... [2025-02-08 09:12:35,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:12:35,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:35,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 09:12:35,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 09:12:35,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 09:12:35,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:12:35,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:12:35,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 09:12:35,946 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:12:35,947 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:12:36,028 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-08 09:12:36,028 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:12:36,034 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:12:36,034 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:12:36,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:12:36 BoogieIcfgContainer [2025-02-08 09:12:36,034 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:12:36,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:12:36,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:12:36,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:12:36,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:12:35" (1/3) ... [2025-02-08 09:12:36,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75de6169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:12:36, skipping insertion in model container [2025-02-08 09:12:36,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:12:35" (2/3) ... [2025-02-08 09:12:36,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75de6169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:12:36, skipping insertion in model container [2025-02-08 09:12:36,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:12:36" (3/3) ... [2025-02-08 09:12:36,040 INFO L128 eAbstractionObserver]: Analyzing ICFG nested_5.c [2025-02-08 09:12:36,049 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:12:36,050 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested_5.c that has 1 procedures, 30 locations, 1 initial locations, 5 loop locations, and 10 error locations. [2025-02-08 09:12:36,079 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:12:36,087 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;@6be5f1af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:12:36,087 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-08 09:12:36,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 29 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 09:12:36,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 09:12:36,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:36,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 09:12:36,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:12:36,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:36,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1937351, now seen corresponding path program 1 times [2025-02-08 09:12:36,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:36,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492611280] [2025-02-08 09:12:36,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:36,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:36,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 09:12:36,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 09:12:36,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:36,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:12:36,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:36,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492611280] [2025-02-08 09:12:36,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492611280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:36,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:12:36,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:12:36,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656064428] [2025-02-08 09:12:36,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:36,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:12:36,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:36,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:12:36,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:12:36,211 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 29 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:36,239 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2025-02-08 09:12:36,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:12:36,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-08 09:12:36,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:36,244 INFO L225 Difference]: With dead ends: 77 [2025-02-08 09:12:36,244 INFO L226 Difference]: Without dead ends: 44 [2025-02-08 09:12:36,246 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 09:12:36,248 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:36,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 55 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:36,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-08 09:12:36,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2025-02-08 09:12:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 37 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 09:12:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2025-02-08 09:12:36,272 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 4 [2025-02-08 09:12:36,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:36,273 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2025-02-08 09:12:36,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:36,275 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2025-02-08 09:12:36,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 09:12:36,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:36,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 09:12:36,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 09:12:36,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:12:36,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:36,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1861785521, now seen corresponding path program 1 times [2025-02-08 09:12:36,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:36,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224566733] [2025-02-08 09:12:36,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:36,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:36,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 09:12:36,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 09:12:36,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:36,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:12:36,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:36,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224566733] [2025-02-08 09:12:36,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224566733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:36,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:12:36,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:12:36,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450648736] [2025-02-08 09:12:36,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:36,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:12:36,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:36,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:12:36,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:12:36,366 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:36,387 INFO L93 Difference]: Finished difference Result 89 states and 125 transitions. [2025-02-08 09:12:36,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:12:36,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 09:12:36,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:36,388 INFO L225 Difference]: With dead ends: 89 [2025-02-08 09:12:36,388 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 09:12:36,389 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 09:12:36,389 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:36,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 49 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:36,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 09:12:36,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2025-02-08 09:12:36,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.725) internal successors, (69), 49 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2025-02-08 09:12:36,394 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 6 [2025-02-08 09:12:36,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:36,394 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 69 transitions. [2025-02-08 09:12:36,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:36,395 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2025-02-08 09:12:36,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 09:12:36,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:36,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:12:36,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 09:12:36,395 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:12:36,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:36,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1880775643, now seen corresponding path program 1 times [2025-02-08 09:12:36,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:36,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147772603] [2025-02-08 09:12:36,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:36,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:36,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 09:12:36,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 09:12:36,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:36,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:36,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:12:36,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:36,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147772603] [2025-02-08 09:12:36,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147772603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:36,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:12:36,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:12:36,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660734064] [2025-02-08 09:12:36,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:36,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:12:36,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:36,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:12:36,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:12:36,424 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 09:12:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:36,447 INFO L93 Difference]: Finished difference Result 111 states and 161 transitions. [2025-02-08 09:12:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:12:36,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 09:12:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:36,452 INFO L225 Difference]: With dead ends: 111 [2025-02-08 09:12:36,453 INFO L226 Difference]: Without dead ends: 62 [2025-02-08 09:12:36,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:12:36,453 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:36,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:36,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-08 09:12:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-08 09:12:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 61 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 09:12:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2025-02-08 09:12:36,460 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 7 [2025-02-08 09:12:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:36,460 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2025-02-08 09:12:36,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 09:12:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2025-02-08 09:12:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 09:12:36,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:36,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:12:36,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 09:12:36,461 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:12:36,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1825065468, now seen corresponding path program 1 times [2025-02-08 09:12:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:36,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15403333] [2025-02-08 09:12:36,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:36,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:36,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 09:12:36,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 09:12:36,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:36,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:36,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:12:36,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:36,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15403333] [2025-02-08 09:12:36,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15403333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:36,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:12:36,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:12:36,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461912596] [2025-02-08 09:12:36,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:36,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:12:36,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:36,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:12:36,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:12:36,488 INFO L87 Difference]: Start difference. First operand 62 states and 81 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 09:12:36,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:36,513 INFO L93 Difference]: Finished difference Result 169 states and 227 transitions. [2025-02-08 09:12:36,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:12:36,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 09:12:36,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:36,515 INFO L225 Difference]: With dead ends: 169 [2025-02-08 09:12:36,515 INFO L226 Difference]: Without dead ends: 108 [2025-02-08 09:12:36,515 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 09:12:36,515 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:36,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 49 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:36,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-08 09:12:36,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2025-02-08 09:12:36,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 94 states have (on average 1.5) internal successors, (141), 103 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:36,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 141 transitions. [2025-02-08 09:12:36,525 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 141 transitions. Word has length 8 [2025-02-08 09:12:36,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:36,525 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 141 transitions. [2025-02-08 09:12:36,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 09:12:36,525 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 141 transitions. [2025-02-08 09:12:36,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 09:12:36,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:36,526 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:12:36,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 09:12:36,526 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:12:36,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:36,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1956173800, now seen corresponding path program 1 times [2025-02-08 09:12:36,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:36,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970784953] [2025-02-08 09:12:36,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:36,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:36,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 09:12:36,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 09:12:36,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:36,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:12:36,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:36,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970784953] [2025-02-08 09:12:36,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970784953] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:36,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690737033] [2025-02-08 09:12:36,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:36,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:36,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:36,566 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:12:36,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 09:12:36,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 09:12:36,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 09:12:36,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:36,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:36,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:12:36,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:12:36,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:12:36,624 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:12:36,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690737033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:36,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:12:36,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 09:12:36,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186538777] [2025-02-08 09:12:36,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:36,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:12:36,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:36,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:12:36,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:12:36,626 INFO L87 Difference]: Start difference. First operand 104 states and 141 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:36,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:36,645 INFO L93 Difference]: Finished difference Result 104 states and 141 transitions. [2025-02-08 09:12:36,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:12:36,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-02-08 09:12:36,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:36,645 INFO L225 Difference]: With dead ends: 104 [2025-02-08 09:12:36,646 INFO L226 Difference]: Without dead ends: 103 [2025-02-08 09:12:36,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 09:12:36,646 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:36,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 24 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:36,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-08 09:12:36,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-02-08 09:12:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 102 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:36,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2025-02-08 09:12:36,655 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 10 [2025-02-08 09:12:36,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:36,655 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2025-02-08 09:12:36,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:36,655 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2025-02-08 09:12:36,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 09:12:36,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:36,655 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:12:36,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 09:12:36,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:36,864 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:12:36,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:36,864 INFO L85 PathProgramCache]: Analyzing trace with hash -511845667, now seen corresponding path program 1 times [2025-02-08 09:12:36,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:36,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652596251] [2025-02-08 09:12:36,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:36,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:36,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 09:12:36,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 09:12:36,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:36,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 09:12:36,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:36,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652596251] [2025-02-08 09:12:36,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652596251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:36,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:12:36,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:12:36,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172535149] [2025-02-08 09:12:36,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:36,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:12:36,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:36,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:12:36,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:12:36,906 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand has 3 states, 2 states have (on average 5.5) 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 09:12:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:36,919 INFO L93 Difference]: Finished difference Result 103 states and 133 transitions. [2025-02-08 09:12:36,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:12:36,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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 09:12:36,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:36,920 INFO L225 Difference]: With dead ends: 103 [2025-02-08 09:12:36,921 INFO L226 Difference]: Without dead ends: 102 [2025-02-08 09:12:36,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:12:36,921 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:36,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:36,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-08 09:12:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 86. [2025-02-08 09:12:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 85 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2025-02-08 09:12:36,929 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 11 [2025-02-08 09:12:36,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:36,929 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2025-02-08 09:12:36,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) 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 09:12:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2025-02-08 09:12:36,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 09:12:36,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:36,930 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:12:36,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 09:12:36,930 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:12:36,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:36,930 INFO L85 PathProgramCache]: Analyzing trace with hash -517263725, now seen corresponding path program 1 times [2025-02-08 09:12:36,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:36,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822378316] [2025-02-08 09:12:36,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:36,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:36,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 09:12:36,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 09:12:36,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:36,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 09:12:36,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:36,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822378316] [2025-02-08 09:12:36,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822378316] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:36,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763524970] [2025-02-08 09:12:36,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:36,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:36,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:36,982 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:12:36,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 09:12:37,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 09:12:37,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 09:12:37,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:37,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:37,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:12:37,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:12:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 09:12:37,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:12:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 09:12:37,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763524970] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:12:37,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:12:37,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 09:12:37,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477563666] [2025-02-08 09:12:37,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:12:37,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 09:12:37,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:37,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 09:12:37,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:12:37,058 INFO L87 Difference]: Start difference. First operand 86 states and 109 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 09:12:37,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:37,084 INFO L93 Difference]: Finished difference Result 243 states and 313 transitions. [2025-02-08 09:12:37,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:12:37,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 17 [2025-02-08 09:12:37,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:37,086 INFO L225 Difference]: With dead ends: 243 [2025-02-08 09:12:37,086 INFO L226 Difference]: Without dead ends: 158 [2025-02-08 09:12:37,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:12:37,087 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:37,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:37,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-08 09:12:37,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-02-08 09:12:37,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 150 states have (on average 1.2066666666666668) internal successors, (181), 157 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 181 transitions. [2025-02-08 09:12:37,098 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 181 transitions. Word has length 17 [2025-02-08 09:12:37,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:37,099 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 181 transitions. [2025-02-08 09:12:37,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 09:12:37,099 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 181 transitions. [2025-02-08 09:12:37,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 09:12:37,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:37,100 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:12:37,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 09:12:37,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:37,301 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:12:37,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:37,301 INFO L85 PathProgramCache]: Analyzing trace with hash -660202972, now seen corresponding path program 1 times [2025-02-08 09:12:37,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:37,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574473778] [2025-02-08 09:12:37,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:37,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:37,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 09:12:37,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 09:12:37,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:37,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 09:12:37,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:37,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574473778] [2025-02-08 09:12:37,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574473778] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:37,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610052612] [2025-02-08 09:12:37,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:37,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:37,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:37,374 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:12:37,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 09:12:37,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 09:12:37,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 09:12:37,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:37,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:37,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 09:12:37,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:12:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 09:12:37,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:12:37,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610052612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:37,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:12:37,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-02-08 09:12:37,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997602872] [2025-02-08 09:12:37,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:37,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:12:37,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:37,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:12:37,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:12:37,445 INFO L87 Difference]: Start difference. First operand 158 states and 181 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:37,457 INFO L93 Difference]: Finished difference Result 158 states and 181 transitions. [2025-02-08 09:12:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:12:37,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 09:12:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:37,458 INFO L225 Difference]: With dead ends: 158 [2025-02-08 09:12:37,458 INFO L226 Difference]: Without dead ends: 157 [2025-02-08 09:12:37,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:12:37,459 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:37,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 23 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:37,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-08 09:12:37,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-02-08 09:12:37,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 150 states have (on average 1.2) internal successors, (180), 156 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:37,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2025-02-08 09:12:37,469 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 28 [2025-02-08 09:12:37,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:37,469 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2025-02-08 09:12:37,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:37,470 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2025-02-08 09:12:37,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 09:12:37,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:37,470 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:12:37,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 09:12:37,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:37,671 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:12:37,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:37,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1008544321, now seen corresponding path program 1 times [2025-02-08 09:12:37,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:37,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254673241] [2025-02-08 09:12:37,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:37,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:37,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 09:12:37,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 09:12:37,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:37,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 09:12:37,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:37,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254673241] [2025-02-08 09:12:37,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254673241] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:37,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304439944] [2025-02-08 09:12:37,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:37,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:37,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:37,710 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:12:37,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 09:12:37,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 09:12:37,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 09:12:37,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:37,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:37,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 09:12:37,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:12:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 09:12:37,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:12:37,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304439944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:37,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:12:37,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-02-08 09:12:37,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078995969] [2025-02-08 09:12:37,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:37,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:12:37,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:37,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:12:37,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:12:37,773 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 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 09:12:37,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:37,794 INFO L93 Difference]: Finished difference Result 313 states and 359 transitions. [2025-02-08 09:12:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:12:37,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 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 29 [2025-02-08 09:12:37,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:37,795 INFO L225 Difference]: With dead ends: 313 [2025-02-08 09:12:37,795 INFO L226 Difference]: Without dead ends: 312 [2025-02-08 09:12:37,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:12:37,796 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:37,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 46 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:37,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-08 09:12:37,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 306. [2025-02-08 09:12:37,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 299 states have (on average 1.1973244147157192) internal successors, (358), 305 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 358 transitions. [2025-02-08 09:12:37,812 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 358 transitions. Word has length 29 [2025-02-08 09:12:37,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:37,813 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 358 transitions. [2025-02-08 09:12:37,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 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 09:12:37,813 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 358 transitions. [2025-02-08 09:12:37,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 09:12:37,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:37,813 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:12:37,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 09:12:38,014 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,SelfDestructingSolverStorable8 [2025-02-08 09:12:38,014 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:12:38,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:38,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1079579943, now seen corresponding path program 2 times [2025-02-08 09:12:38,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:38,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935864206] [2025-02-08 09:12:38,015 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:12:38,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:38,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 09:12:38,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 09:12:38,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:12:38,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:38,058 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-08 09:12:38,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:38,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935864206] [2025-02-08 09:12:38,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935864206] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:38,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130393758] [2025-02-08 09:12:38,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:12:38,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:38,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:38,061 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:12:38,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 09:12:38,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 09:12:38,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 09:12:38,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:12:38,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:38,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 09:12:38,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:12:38,154 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-08 09:12:38,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:12:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-08 09:12:38,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130393758] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:12:38,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:12:38,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 10 [2025-02-08 09:12:38,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613083141] [2025-02-08 09:12:38,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:12:38,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 09:12:38,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:38,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 09:12:38,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:12:38,202 INFO L87 Difference]: Start difference. First operand 306 states and 358 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:38,355 INFO L93 Difference]: Finished difference Result 689 states and 825 transitions. [2025-02-08 09:12:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 09:12:38,356 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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 35 [2025-02-08 09:12:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:38,357 INFO L225 Difference]: With dead ends: 689 [2025-02-08 09:12:38,357 INFO L226 Difference]: Without dead ends: 401 [2025-02-08 09:12:38,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2025-02-08 09:12:38,358 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:38,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 84 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:12:38,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-08 09:12:38,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-02-08 09:12:38,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 395 states have (on average 1.129113924050633) internal successors, (446), 400 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:38,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 446 transitions. [2025-02-08 09:12:38,379 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 446 transitions. Word has length 35 [2025-02-08 09:12:38,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:38,379 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 446 transitions. [2025-02-08 09:12:38,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:38,379 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 446 transitions. [2025-02-08 09:12:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 09:12:38,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:38,380 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 09:12:38,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 09:12:38,580 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,SelfDestructingSolverStorable9 [2025-02-08 09:12:38,581 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:12:38,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:38,582 INFO L85 PathProgramCache]: Analyzing trace with hash -719218504, now seen corresponding path program 1 times [2025-02-08 09:12:38,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:38,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061690619] [2025-02-08 09:12:38,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:38,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:38,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 09:12:38,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 09:12:38,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:38,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:38,614 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-02-08 09:12:38,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:38,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061690619] [2025-02-08 09:12:38,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061690619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:38,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:12:38,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:12:38,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164557707] [2025-02-08 09:12:38,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:38,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:12:38,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:38,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:12:38,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:12:38,616 INFO L87 Difference]: Start difference. First operand 401 states and 446 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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 09:12:38,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:38,638 INFO L93 Difference]: Finished difference Result 401 states and 446 transitions. [2025-02-08 09:12:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:12:38,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 48 [2025-02-08 09:12:38,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:38,640 INFO L225 Difference]: With dead ends: 401 [2025-02-08 09:12:38,640 INFO L226 Difference]: Without dead ends: 400 [2025-02-08 09:12:38,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:12:38,641 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:38,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:38,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-02-08 09:12:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 232. [2025-02-08 09:12:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 227 states have (on average 1.1541850220264318) internal successors, (262), 231 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 262 transitions. [2025-02-08 09:12:38,656 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 262 transitions. Word has length 48 [2025-02-08 09:12:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:38,656 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 262 transitions. [2025-02-08 09:12:38,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 262 transitions. [2025-02-08 09:12:38,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 09:12:38,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:38,658 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 09:12:38,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 09:12:38,658 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:12:38,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:38,658 INFO L85 PathProgramCache]: Analyzing trace with hash 950794254, now seen corresponding path program 1 times [2025-02-08 09:12:38,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:38,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639594356] [2025-02-08 09:12:38,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:38,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:38,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 09:12:38,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 09:12:38,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:38,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 128 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-08 09:12:38,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:38,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639594356] [2025-02-08 09:12:38,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639594356] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:38,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731425307] [2025-02-08 09:12:38,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:38,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:38,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:38,701 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:12:38,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 09:12:38,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 09:12:38,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 09:12:38,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:38,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:38,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:12:38,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:12:38,785 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 128 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-08 09:12:38,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:12:38,817 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 128 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-08 09:12:38,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731425307] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:12:38,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:12:38,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 09:12:38,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598609818] [2025-02-08 09:12:38,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:12:38,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 09:12:38,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:38,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 09:12:38,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:12:38,819 INFO L87 Difference]: Start difference. First operand 232 states and 262 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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 09:12:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:38,871 INFO L93 Difference]: Finished difference Result 965 states and 1071 transitions. [2025-02-08 09:12:38,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:12:38,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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 54 [2025-02-08 09:12:38,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:38,874 INFO L225 Difference]: With dead ends: 965 [2025-02-08 09:12:38,874 INFO L226 Difference]: Without dead ends: 760 [2025-02-08 09:12:38,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:12:38,875 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:38,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 64 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:38,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-02-08 09:12:38,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2025-02-08 09:12:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 755 states have (on average 1.0781456953642383) internal successors, (814), 759 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 814 transitions. [2025-02-08 09:12:38,916 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 814 transitions. Word has length 54 [2025-02-08 09:12:38,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:38,916 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 814 transitions. [2025-02-08 09:12:38,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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 09:12:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 814 transitions. [2025-02-08 09:12:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-08 09:12:38,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:38,918 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 09:12:38,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 09:12:39,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 09:12:39,120 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:12:39,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:39,120 INFO L85 PathProgramCache]: Analyzing trace with hash 276950332, now seen corresponding path program 2 times [2025-02-08 09:12:39,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:39,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809112344] [2025-02-08 09:12:39,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:12:39,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:39,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 186 statements into 2 equivalence classes. [2025-02-08 09:12:39,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 09:12:39,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:12:39,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3899 backedges. 0 proven. 1995 refuted. 0 times theorem prover too weak. 1904 trivial. 0 not checked. [2025-02-08 09:12:39,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:39,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809112344] [2025-02-08 09:12:39,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809112344] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:39,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727039503] [2025-02-08 09:12:39,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:12:39,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:39,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:39,275 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:12:39,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 09:12:39,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 186 statements into 2 equivalence classes. [2025-02-08 09:12:39,338 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 09:12:39,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:12:39,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:39,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 09:12:39,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:12:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3899 backedges. 1994 proven. 748 refuted. 0 times theorem prover too weak. 1157 trivial. 0 not checked. [2025-02-08 09:12:39,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:12:39,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3899 backedges. 1994 proven. 748 refuted. 0 times theorem prover too weak. 1157 trivial. 0 not checked. [2025-02-08 09:12:39,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727039503] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:12:39,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:12:39,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 10 [2025-02-08 09:12:39,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83886193] [2025-02-08 09:12:39,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:12:39,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 09:12:39,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:39,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 09:12:39,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:12:39,607 INFO L87 Difference]: Start difference. First operand 760 states and 814 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:39,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:39,804 INFO L93 Difference]: Finished difference Result 1778 states and 1914 transitions. [2025-02-08 09:12:39,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 09:12:39,805 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 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 186 [2025-02-08 09:12:39,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:39,808 INFO L225 Difference]: With dead ends: 1778 [2025-02-08 09:12:39,808 INFO L226 Difference]: Without dead ends: 1111 [2025-02-08 09:12:39,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 361 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2025-02-08 09:12:39,810 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:39,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 110 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:12:39,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2025-02-08 09:12:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2025-02-08 09:12:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1107 states have (on average 1.0641373080397472) internal successors, (1178), 1110 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:39,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1178 transitions. [2025-02-08 09:12:39,856 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1178 transitions. Word has length 186 [2025-02-08 09:12:39,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:39,856 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1178 transitions. [2025-02-08 09:12:39,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1178 transitions. [2025-02-08 09:12:39,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-08 09:12:39,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:39,858 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 12, 12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 09:12:39,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 09:12:40,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:40,062 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:12:40,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:40,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1343365181, now seen corresponding path program 1 times [2025-02-08 09:12:40,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:40,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699132942] [2025-02-08 09:12:40,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:40,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:40,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-08 09:12:40,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-08 09:12:40,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:40,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 8824 backedges. 4479 proven. 0 refuted. 0 times theorem prover too weak. 4345 trivial. 0 not checked. [2025-02-08 09:12:40,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:40,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699132942] [2025-02-08 09:12:40,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699132942] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:40,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:12:40,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:12:40,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090096514] [2025-02-08 09:12:40,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:40,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:12:40,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:40,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:12:40,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:12:40,232 INFO L87 Difference]: Start difference. First operand 1111 states and 1178 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:40,285 INFO L93 Difference]: Finished difference Result 1111 states and 1178 transitions. [2025-02-08 09:12:40,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:12:40,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 275 [2025-02-08 09:12:40,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:40,289 INFO L225 Difference]: With dead ends: 1111 [2025-02-08 09:12:40,289 INFO L226 Difference]: Without dead ends: 1110 [2025-02-08 09:12:40,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:12:40,290 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:40,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:40,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-02-08 09:12:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 570. [2025-02-08 09:12:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 567 states have (on average 1.0687830687830688) internal successors, (606), 569 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 606 transitions. [2025-02-08 09:12:40,323 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 606 transitions. Word has length 275 [2025-02-08 09:12:40,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:40,324 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 606 transitions. [2025-02-08 09:12:40,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 606 transitions. [2025-02-08 09:12:40,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-02-08 09:12:40,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:40,326 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 12, 12, 12, 12, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 09:12:40,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 09:12:40,326 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:12:40,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:40,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1207147635, now seen corresponding path program 1 times [2025-02-08 09:12:40,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:40,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377766805] [2025-02-08 09:12:40,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:40,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:40,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-02-08 09:12:40,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-02-08 09:12:40,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:40,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:40,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8831 backedges. 4484 proven. 1 refuted. 0 times theorem prover too weak. 4346 trivial. 0 not checked. [2025-02-08 09:12:40,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:40,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377766805] [2025-02-08 09:12:40,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377766805] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:40,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997508790] [2025-02-08 09:12:40,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:40,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:40,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:40,480 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:12:40,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 09:12:40,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-02-08 09:12:40,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-02-08 09:12:40,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:40,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:40,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:12:40,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:12:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8831 backedges. 4484 proven. 1 refuted. 0 times theorem prover too weak. 4346 trivial. 0 not checked. [2025-02-08 09:12:40,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:12:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 8831 backedges. 4484 proven. 1 refuted. 0 times theorem prover too weak. 4346 trivial. 0 not checked. [2025-02-08 09:12:40,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997508790] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:12:40,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:12:40,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 09:12:40,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044327512] [2025-02-08 09:12:40,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:12:40,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 09:12:40,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:40,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 09:12:40,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:12:40,836 INFO L87 Difference]: Start difference. First operand 570 states and 606 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:40,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:40,984 INFO L93 Difference]: Finished difference Result 2632 states and 2792 transitions. [2025-02-08 09:12:40,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:12:40,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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 281 [2025-02-08 09:12:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:40,998 INFO L225 Difference]: With dead ends: 2632 [2025-02-08 09:12:40,998 INFO L226 Difference]: Without dead ends: 2202 [2025-02-08 09:12:41,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 559 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 09:12:41,006 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:41,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 79 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:41,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2025-02-08 09:12:41,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2202. [2025-02-08 09:12:41,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2202 states, 2199 states have (on average 1.0559345156889495) internal successors, (2322), 2201 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 2322 transitions. [2025-02-08 09:12:41,213 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 2322 transitions. Word has length 281 [2025-02-08 09:12:41,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:41,213 INFO L471 AbstractCegarLoop]: Abstraction has 2202 states and 2322 transitions. [2025-02-08 09:12:41,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:41,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 2322 transitions. [2025-02-08 09:12:41,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1098 [2025-02-08 09:12:41,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:41,243 INFO L218 NwaCegarLoop]: trace histogram [288, 288, 288, 48, 48, 48, 48, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 09:12:41,251 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 09:12:41,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 09:12:41,448 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:12:41,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:41,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1210512921, now seen corresponding path program 2 times [2025-02-08 09:12:41,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:41,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610328809] [2025-02-08 09:12:41,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:12:41,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:41,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1097 statements into 2 equivalence classes. [2025-02-08 09:12:41,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1097 of 1097 statements. [2025-02-08 09:12:41,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:12:41,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 142835 backedges. 0 proven. 71691 refuted. 0 times theorem prover too weak. 71144 trivial. 0 not checked. [2025-02-08 09:12:42,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:42,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610328809] [2025-02-08 09:12:42,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610328809] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:42,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781842969] [2025-02-08 09:12:42,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:12:42,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:42,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:42,148 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:12:42,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 09:12:42,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1097 statements into 2 equivalence classes. [2025-02-08 09:12:42,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1097 of 1097 statements. [2025-02-08 09:12:42,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:12:42,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:42,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 1935 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 09:12:42,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:12:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 142835 backedges. 71690 proven. 26884 refuted. 0 times theorem prover too weak. 44261 trivial. 0 not checked. [2025-02-08 09:12:43,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:12:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 142835 backedges. 71690 proven. 26884 refuted. 0 times theorem prover too weak. 44261 trivial. 0 not checked. [2025-02-08 09:12:43,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781842969] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:12:43,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:12:43,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 10 [2025-02-08 09:12:43,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407091986] [2025-02-08 09:12:43,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:12:43,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 09:12:43,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:43,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 09:12:43,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-08 09:12:43,772 INFO L87 Difference]: Start difference. First operand 2202 states and 2322 transitions. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:44,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:44,045 INFO L93 Difference]: Finished difference Result 4943 states and 5219 transitions. [2025-02-08 09:12:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 09:12:44,046 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 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 1097 [2025-02-08 09:12:44,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:44,056 INFO L225 Difference]: With dead ends: 4943 [2025-02-08 09:12:44,056 INFO L226 Difference]: Without dead ends: 3289 [2025-02-08 09:12:44,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2207 GetRequests, 2183 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2025-02-08 09:12:44,057 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 25 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:44,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 132 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:12:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2025-02-08 09:12:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 3289. [2025-02-08 09:12:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3289 states, 3287 states have (on average 1.0538484940675388) internal successors, (3464), 3288 states have internal predecessors, (3464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 3464 transitions. [2025-02-08 09:12:44,259 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 3464 transitions. Word has length 1097 [2025-02-08 09:12:44,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:44,260 INFO L471 AbstractCegarLoop]: Abstraction has 3289 states and 3464 transitions. [2025-02-08 09:12:44,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:44,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 3464 transitions. [2025-02-08 09:12:44,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1643 [2025-02-08 09:12:44,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:44,287 INFO L218 NwaCegarLoop]: trace histogram [432, 432, 432, 72, 72, 72, 72, 12, 12, 12, 12, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 09:12:44,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 09:12:44,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:44,488 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:12:44,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:44,489 INFO L85 PathProgramCache]: Analyzing trace with hash 551133734, now seen corresponding path program 1 times [2025-02-08 09:12:44,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:44,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606666729] [2025-02-08 09:12:44,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:44,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:44,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1642 statements into 1 equivalence classes. [2025-02-08 09:12:44,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1642 of 1642 statements. [2025-02-08 09:12:44,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:44,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 321772 backedges. 161295 proven. 0 refuted. 0 times theorem prover too weak. 160477 trivial. 0 not checked. [2025-02-08 09:12:45,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:45,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606666729] [2025-02-08 09:12:45,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606666729] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:45,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:12:45,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:12:45,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912426200] [2025-02-08 09:12:45,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:45,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:12:45,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:45,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:12:45,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:12:45,701 INFO L87 Difference]: Start difference. First operand 3289 states and 3464 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 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 09:12:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:45,889 INFO L93 Difference]: Finished difference Result 3289 states and 3464 transitions. [2025-02-08 09:12:45,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:12:45,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 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 1642 [2025-02-08 09:12:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:45,910 INFO L225 Difference]: With dead ends: 3289 [2025-02-08 09:12:45,910 INFO L226 Difference]: Without dead ends: 3288 [2025-02-08 09:12:45,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:12:45,912 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:45,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:45,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2025-02-08 09:12:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 1650. [2025-02-08 09:12:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1649 states have (on average 1.0539721043056398) internal successors, (1738), 1649 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 1738 transitions. [2025-02-08 09:12:46,028 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 1738 transitions. Word has length 1642 [2025-02-08 09:12:46,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:46,030 INFO L471 AbstractCegarLoop]: Abstraction has 1650 states and 1738 transitions. [2025-02-08 09:12:46,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 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 09:12:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 1738 transitions. [2025-02-08 09:12:46,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1650 [2025-02-08 09:12:46,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:12:46,043 INFO L218 NwaCegarLoop]: trace histogram [432, 432, 432, 72, 72, 72, 72, 12, 12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-02-08 09:12:46,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 09:12:46,043 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-08 09:12:46,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:12:46,044 INFO L85 PathProgramCache]: Analyzing trace with hash 647325749, now seen corresponding path program 1 times [2025-02-08 09:12:46,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:12:46,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787116049] [2025-02-08 09:12:46,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:46,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:12:46,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1649 statements into 1 equivalence classes. [2025-02-08 09:12:46,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1649 of 1649 statements. [2025-02-08 09:12:46,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:46,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 321780 backedges. 161300 proven. 1 refuted. 0 times theorem prover too weak. 160479 trivial. 0 not checked. [2025-02-08 09:12:46,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:12:46,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787116049] [2025-02-08 09:12:46,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787116049] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:12:46,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265517634] [2025-02-08 09:12:46,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:12:46,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:12:46,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:12:46,786 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:12:46,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 09:12:46,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1649 statements into 1 equivalence classes. [2025-02-08 09:12:47,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1649 of 1649 statements. [2025-02-08 09:12:47,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:12:47,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:12:47,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 2893 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 09:12:47,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:12:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 321780 backedges. 161301 proven. 0 refuted. 0 times theorem prover too weak. 160479 trivial. 0 not checked. [2025-02-08 09:12:47,968 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:12:47,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265517634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:12:47,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:12:47,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 09:12:47,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093674294] [2025-02-08 09:12:47,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:12:47,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:12:47,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:12:47,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:12:47,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:12:47,970 INFO L87 Difference]: Start difference. First operand 1650 states and 1738 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:12:48,068 INFO L93 Difference]: Finished difference Result 1650 states and 1738 transitions. [2025-02-08 09:12:48,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:12:48,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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 1649 [2025-02-08 09:12:48,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:12:48,071 INFO L225 Difference]: With dead ends: 1650 [2025-02-08 09:12:48,071 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 09:12:48,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1652 GetRequests, 1649 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 09:12:48,073 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:12:48,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:12:48,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 09:12:48,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 09:12:48,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:48,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 09:12:48,074 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1649 [2025-02-08 09:12:48,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:12:48,074 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 09:12:48,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:12:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 09:12:48,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 09:12:48,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-02-08 09:12:48,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-02-08 09:12:48,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-02-08 09:12:48,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-02-08 09:12:48,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-02-08 09:12:48,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-02-08 09:12:48,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-02-08 09:12:48,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-02-08 09:12:48,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-02-08 09:12:48,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-02-08 09:12:48,088 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 09:12:48,281 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,SelfDestructingSolverStorable17 [2025-02-08 09:12:48,283 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:12:48,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 09:13:38,674 WARN L286 SmtUtils]: Spent 50.38s on a formula simplification. DAG size of input: 2738 DAG size of output: 2547 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-02-08 09:13:51,378 WARN L286 SmtUtils]: Spent 11.87s on a formula simplification. DAG size of input: 2547 DAG size of output: 42 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-02-08 09:13:52,291 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 09:13:52,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 09:13:52 BoogieIcfgContainer [2025-02-08 09:13:52,332 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 09:13:52,333 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 09:13:52,333 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 09:13:52,333 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 09:13:52,336 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:12:36" (3/4) ... [2025-02-08 09:13:52,337 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 09:13:52,344 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-08 09:13:52,344 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 09:13:52,344 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 09:13:52,344 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 09:13:52,405 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 09:13:52,406 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 09:13:52,406 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 09:13:52,406 INFO L158 Benchmark]: Toolchain (without parser) took 76685.35ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 135.2MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 134.5MB. Max. memory is 16.1GB. [2025-02-08 09:13:52,406 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:13:52,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 115.48ms. Allocated memory is still 167.8MB. Free memory was 135.2MB in the beginning and 124.4MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 09:13:52,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.43ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 123.5MB in the end (delta: 945.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:13:52,408 INFO L158 Benchmark]: Boogie Preprocessor took 13.96ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 122.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:13:52,408 INFO L158 Benchmark]: IcfgBuilder took 165.99ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 110.6MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 09:13:52,411 INFO L158 Benchmark]: TraceAbstraction took 76296.45ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 109.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-02-08 09:13:52,411 INFO L158 Benchmark]: Witness Printer took 72.55ms. Allocated memory is still 1.7GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 09:13:52,412 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 115.48ms. Allocated memory is still 167.8MB. Free memory was 135.2MB in the beginning and 124.4MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.43ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 123.5MB in the end (delta: 945.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.96ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 122.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 165.99ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 110.6MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 76296.45ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 109.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 72.55ms. Allocated memory is still 1.7GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 4.2MB). 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: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: 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, 30 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 18, TraceHistogramMax: 432, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 984 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 569 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 415 IncrementalHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 415 mSDtfsCounter, 415 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5131 GetRequests, 5024 SyntacticMatches, 12 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3289occurred in iteration=16, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 2380 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 8773 NumberOfCodeBlocks, 8773 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 10409 ConstructedInterpolants, 0 QuantifiedInterpolants, 22049 SizeOfPredicates, 0 NumberOfNonLiveVariables, 6194 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 34 InterpolantComputations, 12 PerfectInterpolantSequences, 1313156/1442223 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 27]: Location Invariant Derived location invariant: (((a <= 5) && ((((c <= 5) && (b == 0)) && ((((c == 0) && (d <= 5)) && ((((1 <= e) && (1 <= d)) && (0 <= a)) || (((1 <= e) && (d == 0)) && (0 <= a)))) || (((d <= 5) && (1 <= c)) && ((((1 <= e) && (1 <= d)) && (0 <= a)) || (((1 <= e) && (d == 0)) && (0 <= a)))))) || ((((c <= 5) && (b <= 5)) && (1 <= b)) && ((((c == 0) && (d <= 5)) && ((((1 <= e) && (1 <= d)) && (0 <= a)) || (((1 <= e) && (d == 0)) && (0 <= a)))) || (((d <= 5) && (1 <= c)) && ((((1 <= e) && (1 <= d)) && (0 <= a)) || (((1 <= e) && (d == 0)) && (0 <= a)))))))) || ((a <= 5) && ((((c <= 5) && (b == 0)) && ((((d <= 5) && (1 <= c)) && ((((d == 0) && (0 <= a)) && (e == 0)) || (((1 <= d) && (0 <= a)) && (e == 0)))) || (((c == 0) && (d <= 5)) && ((((d == 0) && (0 <= a)) && (e == 0)) || (((1 <= d) && (0 <= a)) && (e == 0)))))) || ((((c <= 5) && ((((d <= 5) && (1 <= c)) && ((((d == 0) && (0 <= a)) && (e == 0)) || (((1 <= d) && (0 <= a)) && (e == 0)))) || (((c == 0) && (d <= 5)) && ((((d == 0) && (0 <= a)) && (e == 0)) || (((1 <= d) && (0 <= a)) && (e == 0)))))) && (b <= 5)) && (1 <= b))))) - InvariantResult [Line: 25]: Location Invariant Derived location invariant: (((a <= 5) && ((((((b == 0) && (1 <= c)) && (1 <= e)) && (1 <= d)) && (0 <= a)) || ((((((1 <= c) && (1 <= e)) && (b <= 5)) && (1 <= b)) && (1 <= d)) && (0 <= a)))) || (((((((c == 0) && (b == 0)) && (1 <= e)) && (1 <= d)) && (0 <= a)) || ((((((c == 0) && (1 <= e)) && (b <= 5)) && (1 <= b)) && (1 <= d)) && (0 <= a))) && (a <= 5))) - InvariantResult [Line: 23]: Location Invariant Derived location invariant: (((((1 <= c) && (1 <= e)) && (1 <= b)) && (1 <= d)) && (0 <= a)) - InvariantResult [Line: 26]: Location Invariant Derived location invariant: (((a <= 5) && ((((c <= 5) && (b == 0)) && (((((1 <= c) && (1 <= e)) && (1 <= d)) && (0 <= a)) || ((((c == 0) && (1 <= e)) && (1 <= d)) && (0 <= a)))) || ((((c <= 5) && (b <= 5)) && (1 <= b)) && (((((1 <= c) && (1 <= e)) && (1 <= d)) && (0 <= a)) || ((((c == 0) && (1 <= e)) && (1 <= d)) && (0 <= a)))))) || ((((((c <= 5) && (((((1 <= c) && (1 <= e)) && (d == 0)) && (0 <= a)) || ((((c == 0) && (1 <= e)) && (d == 0)) && (0 <= a)))) && (b <= 5)) && (1 <= b)) || (((c <= 5) && (((((1 <= c) && (1 <= e)) && (d == 0)) && (0 <= a)) || ((((c == 0) && (1 <= e)) && (d == 0)) && (0 <= a)))) && (b == 0))) && (a <= 5))) - InvariantResult [Line: 24]: Location Invariant Derived location invariant: (((((((1 <= c) && (a <= 5)) && (1 <= e)) && (1 <= b)) && (1 <= d)) && (0 <= a)) || ((((((b == 0) && (1 <= c)) && (a <= 5)) && (1 <= e)) && (1 <= d)) && (0 <= a))) RESULT: Ultimate proved your program to be correct! [2025-02-08 09:13:52,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE