./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound1.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 bd4ff7f95c7aab1abb3428488ee9247a9f3cbeb30d436182472263a0c2dcf758 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:25:07,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:25:07,952 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:25:07,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:25:07,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:25:07,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:25:07,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:25:07,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:25:07,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:25:07,974 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:25:07,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:25:07,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:25:07,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:25:07,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:25:07,976 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:25:07,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:25:07,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:25:07,976 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:25:07,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:25:07,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:25:07,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:25:07,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:25:07,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:25:07,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:25:07,977 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:25:07,977 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:25:07,977 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:25:07,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:25:07,977 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:25:07,977 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:25:07,977 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:25:07,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:25:07,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:25:07,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:25:07,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:25:07,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:25:07,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:25:07,978 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:25:07,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:25:07,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:25:07,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:25:07,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:25:07,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:25:07,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:25:07,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:25:07,978 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 -> bd4ff7f95c7aab1abb3428488ee9247a9f3cbeb30d436182472263a0c2dcf758 [2025-02-06 14:25:08,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:25:08,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:25:08,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:25:08,200 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:25:08,200 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:25:08,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound1.c [2025-02-06 14:25:09,337 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6a7a0090/f485f1d53a224a1cb46b3d8eb329ffae/FLAG08e837e60 [2025-02-06 14:25:09,573 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:25:09,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound1.c [2025-02-06 14:25:09,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6a7a0090/f485f1d53a224a1cb46b3d8eb329ffae/FLAG08e837e60 [2025-02-06 14:25:09,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6a7a0090/f485f1d53a224a1cb46b3d8eb329ffae [2025-02-06 14:25:09,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:25:09,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:25:09,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:25:09,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:25:09,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:25:09,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:25:09" (1/1) ... [2025-02-06 14:25:09,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e065841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:09, skipping insertion in model container [2025-02-06 14:25:09,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:25:09" (1/1) ... [2025-02-06 14:25:09,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:25:10,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:25:10,053 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:25:10,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:25:10,084 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:25:10,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:10 WrapperNode [2025-02-06 14:25:10,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:25:10,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:25:10,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:25:10,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:25:10,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:10" (1/1) ... [2025-02-06 14:25:10,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:10" (1/1) ... [2025-02-06 14:25:10,110 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 123 [2025-02-06 14:25:10,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:25:10,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:25:10,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:25:10,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:25:10,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:10" (1/1) ... [2025-02-06 14:25:10,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:10" (1/1) ... [2025-02-06 14:25:10,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:10" (1/1) ... [2025-02-06 14:25:10,137 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 14:25:10,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:10" (1/1) ... [2025-02-06 14:25:10,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:10" (1/1) ... [2025-02-06 14:25:10,139 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:10" (1/1) ... [2025-02-06 14:25:10,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:10" (1/1) ... [2025-02-06 14:25:10,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:10" (1/1) ... [2025-02-06 14:25:10,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:10" (1/1) ... [2025-02-06 14:25:10,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:25:10,145 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:25:10,145 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:25:10,145 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:25:10,146 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:10" (1/1) ... [2025-02-06 14:25:10,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:25:10,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:25:10,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 14:25:10,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 14:25:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:25:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 14:25:10,190 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 14:25:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:25:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:25:10,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:25:10,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 14:25:10,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 14:25:10,224 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:25:10,225 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:25:10,552 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-02-06 14:25:10,553 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:25:10,565 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:25:10,566 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:25:10,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:25:10 BoogieIcfgContainer [2025-02-06 14:25:10,566 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:25:10,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:25:10,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:25:10,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:25:10,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:25:09" (1/3) ... [2025-02-06 14:25:10,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60199ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:25:10, skipping insertion in model container [2025-02-06 14:25:10,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:25:10" (2/3) ... [2025-02-06 14:25:10,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60199ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:25:10, skipping insertion in model container [2025-02-06 14:25:10,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:25:10" (3/3) ... [2025-02-06 14:25:10,576 INFO L128 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound1.c [2025-02-06 14:25:10,587 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:25:10,588 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps5-ll_valuebound1.c that has 3 procedures, 192 locations, 1 initial locations, 1 loop locations, and 84 error locations. [2025-02-06 14:25:10,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:25:10,639 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;@36bda771, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:25:10,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2025-02-06 14:25:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 100 states have (on average 1.88) internal successors, (188), 184 states have internal predecessors, (188), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:25:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 14:25:10,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:10,647 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:25:10,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:10,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:10,652 INFO L85 PathProgramCache]: Analyzing trace with hash 603286069, now seen corresponding path program 1 times [2025-02-06 14:25:10,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:10,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777763580] [2025-02-06 14:25:10,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:10,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:10,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 14:25:10,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 14:25:10,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:10,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:25:10,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:10,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777763580] [2025-02-06 14:25:10,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777763580] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:25:10,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531730735] [2025-02-06 14:25:10,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:10,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:25:10,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:25:10,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:25:10,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 14:25:10,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 14:25:10,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 14:25:10,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:10,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:10,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 14:25:10,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:25:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:25:10,800 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:25:10,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531730735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:10,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:25:10,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 14:25:10,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176782419] [2025-02-06 14:25:10,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:10,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 14:25:10,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:10,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 14:25:10,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 14:25:10,820 INFO L87 Difference]: Start difference. First operand has 192 states, 100 states have (on average 1.88) internal successors, (188), 184 states have internal predecessors, (188), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:25:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:10,843 INFO L93 Difference]: Finished difference Result 367 states and 396 transitions. [2025-02-06 14:25:10,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 14:25:10,844 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2025-02-06 14:25:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:10,848 INFO L225 Difference]: With dead ends: 367 [2025-02-06 14:25:10,848 INFO L226 Difference]: Without dead ends: 172 [2025-02-06 14:25:10,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 14:25:10,852 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:10,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:25:10,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-02-06 14:25:10,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-02-06 14:25:10,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 95 states have (on average 1.7473684210526317) internal successors, (166), 165 states have internal predecessors, (166), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 14:25:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 174 transitions. [2025-02-06 14:25:10,878 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 174 transitions. Word has length 15 [2025-02-06 14:25:10,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:10,878 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 174 transitions. [2025-02-06 14:25:10,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:25:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 174 transitions. [2025-02-06 14:25:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 14:25:10,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:10,879 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:25:10,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 14:25:11,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 14:25:11,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:11,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:11,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1165036139, now seen corresponding path program 1 times [2025-02-06 14:25:11,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:11,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757234131] [2025-02-06 14:25:11,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:11,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:11,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 14:25:11,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 14:25:11,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:11,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:11,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:11,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757234131] [2025-02-06 14:25:11,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757234131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:11,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:25:11,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:25:11,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712830896] [2025-02-06 14:25:11,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:11,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:25:11,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:11,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:25:11,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:25:11,140 INFO L87 Difference]: Start difference. First operand 172 states and 174 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:25:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:11,409 INFO L93 Difference]: Finished difference Result 309 states and 321 transitions. [2025-02-06 14:25:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:25:11,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2025-02-06 14:25:11,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:11,411 INFO L225 Difference]: With dead ends: 309 [2025-02-06 14:25:11,411 INFO L226 Difference]: Without dead ends: 253 [2025-02-06 14:25:11,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:25:11,412 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 82 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:11,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 127 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:25:11,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-06 14:25:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 247. [2025-02-06 14:25:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 169 states have (on average 1.5029585798816567) internal successors, (254), 239 states have internal predecessors, (254), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:25:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 264 transitions. [2025-02-06 14:25:11,421 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 264 transitions. Word has length 15 [2025-02-06 14:25:11,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:11,422 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 264 transitions. [2025-02-06 14:25:11,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:25:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 264 transitions. [2025-02-06 14:25:11,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 14:25:11,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:11,423 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:25:11,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:25:11,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:11,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:11,432 INFO L85 PathProgramCache]: Analyzing trace with hash -569588615, now seen corresponding path program 1 times [2025-02-06 14:25:11,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:11,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102390387] [2025-02-06 14:25:11,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:11,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:11,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 14:25:11,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 14:25:11,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:11,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:11,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:11,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:11,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102390387] [2025-02-06 14:25:11,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102390387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:11,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:25:11,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:25:11,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136370829] [2025-02-06 14:25:11,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:11,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:25:11,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:11,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:25:11,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:25:11,513 INFO L87 Difference]: Start difference. First operand 247 states and 264 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:25:11,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:11,568 INFO L93 Difference]: Finished difference Result 266 states and 278 transitions. [2025-02-06 14:25:11,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:25:11,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-02-06 14:25:11,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:11,569 INFO L225 Difference]: With dead ends: 266 [2025-02-06 14:25:11,570 INFO L226 Difference]: Without dead ends: 261 [2025-02-06 14:25:11,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:25:11,570 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 58 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:11,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 296 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:25:11,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-02-06 14:25:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 254. [2025-02-06 14:25:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 176 states have (on average 1.4829545454545454) internal successors, (261), 246 states have internal predecessors, (261), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:25:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 271 transitions. [2025-02-06 14:25:11,579 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 271 transitions. Word has length 43 [2025-02-06 14:25:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:11,579 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 271 transitions. [2025-02-06 14:25:11,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:25:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 271 transitions. [2025-02-06 14:25:11,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 14:25:11,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:11,580 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:25:11,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:25:11,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:11,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:11,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1913809673, now seen corresponding path program 1 times [2025-02-06 14:25:11,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:11,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190845365] [2025-02-06 14:25:11,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:11,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:11,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 14:25:11,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 14:25:11,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:11,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:11,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:11,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190845365] [2025-02-06 14:25:11,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190845365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:11,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:25:11,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:25:11,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397700047] [2025-02-06 14:25:11,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:11,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:25:11,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:11,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:25:11,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:25:11,694 INFO L87 Difference]: Start difference. First operand 254 states and 271 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:25:11,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:11,985 INFO L93 Difference]: Finished difference Result 265 states and 273 transitions. [2025-02-06 14:25:11,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:25:11,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-02-06 14:25:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:11,987 INFO L225 Difference]: With dead ends: 265 [2025-02-06 14:25:11,987 INFO L226 Difference]: Without dead ends: 260 [2025-02-06 14:25:11,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:25:11,988 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 81 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:11,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 255 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:25:11,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-02-06 14:25:11,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 254. [2025-02-06 14:25:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 176 states have (on average 1.4545454545454546) internal successors, (256), 246 states have internal predecessors, (256), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:25:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 266 transitions. [2025-02-06 14:25:11,995 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 266 transitions. Word has length 45 [2025-02-06 14:25:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:11,995 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 266 transitions. [2025-02-06 14:25:11,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:25:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 266 transitions. [2025-02-06 14:25:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 14:25:11,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:11,996 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:25:11,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:25:11,997 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:11,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:11,997 INFO L85 PathProgramCache]: Analyzing trace with hash 801442363, now seen corresponding path program 1 times [2025-02-06 14:25:11,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:11,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846718225] [2025-02-06 14:25:11,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:11,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:12,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 14:25:12,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 14:25:12,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:12,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:12,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:12,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846718225] [2025-02-06 14:25:12,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846718225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:12,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:25:12,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:25:12,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530060026] [2025-02-06 14:25:12,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:12,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:25:12,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:12,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:25:12,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:25:12,052 INFO L87 Difference]: Start difference. First operand 254 states and 266 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:25:12,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:12,192 INFO L93 Difference]: Finished difference Result 264 states and 268 transitions. [2025-02-06 14:25:12,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:25:12,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2025-02-06 14:25:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:12,194 INFO L225 Difference]: With dead ends: 264 [2025-02-06 14:25:12,194 INFO L226 Difference]: Without dead ends: 226 [2025-02-06 14:25:12,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:25:12,195 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 125 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:12,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 246 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:25:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-02-06 14:25:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 220. [2025-02-06 14:25:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 212 states have internal predecessors, (218), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:25:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 228 transitions. [2025-02-06 14:25:12,210 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 228 transitions. Word has length 46 [2025-02-06 14:25:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:12,211 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 228 transitions. [2025-02-06 14:25:12,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:25:12,211 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 228 transitions. [2025-02-06 14:25:12,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 14:25:12,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:12,212 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:25:12,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 14:25:12,212 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:12,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:12,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1176305615, now seen corresponding path program 1 times [2025-02-06 14:25:12,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:12,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982421067] [2025-02-06 14:25:12,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:12,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:12,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 14:25:12,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 14:25:12,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:12,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:12,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:12,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982421067] [2025-02-06 14:25:12,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982421067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:12,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:25:12,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:25:12,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519255470] [2025-02-06 14:25:12,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:12,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:25:12,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:12,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:25:12,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:25:12,285 INFO L87 Difference]: Start difference. First operand 220 states and 228 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:12,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:12,297 INFO L93 Difference]: Finished difference Result 222 states and 228 transitions. [2025-02-06 14:25:12,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:25:12,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 55 [2025-02-06 14:25:12,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:12,299 INFO L225 Difference]: With dead ends: 222 [2025-02-06 14:25:12,299 INFO L226 Difference]: Without dead ends: 220 [2025-02-06 14:25:12,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:25:12,300 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:12,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 337 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:25:12,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-06 14:25:12,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-02-06 14:25:12,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 142 states have (on average 1.5211267605633803) internal successors, (216), 212 states have internal predecessors, (216), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:25:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 226 transitions. [2025-02-06 14:25:12,311 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 226 transitions. Word has length 55 [2025-02-06 14:25:12,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:12,311 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 226 transitions. [2025-02-06 14:25:12,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:12,311 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 226 transitions. [2025-02-06 14:25:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 14:25:12,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:12,314 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:25:12,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 14:25:12,314 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:12,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1403214962, now seen corresponding path program 1 times [2025-02-06 14:25:12,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:12,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551498549] [2025-02-06 14:25:12,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:12,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:12,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 14:25:12,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 14:25:12,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:12,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:25:12,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [115756527] [2025-02-06 14:25:12,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:12,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:25:12,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:25:12,344 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:25:12,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 14:25:12,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 14:25:12,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 14:25:12,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:12,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:12,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 14:25:12,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:25:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:12,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:25:12,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:12,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551498549] [2025-02-06 14:25:12,455 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:25:12,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115756527] [2025-02-06 14:25:12,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115756527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:12,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:25:12,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:25:12,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705659608] [2025-02-06 14:25:12,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:12,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:25:12,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:12,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:25:12,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:25:12,458 INFO L87 Difference]: Start difference. First operand 220 states and 226 transitions. Second operand has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:12,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:12,730 INFO L93 Difference]: Finished difference Result 359 states and 375 transitions. [2025-02-06 14:25:12,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:25:12,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2025-02-06 14:25:12,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:12,731 INFO L225 Difference]: With dead ends: 359 [2025-02-06 14:25:12,731 INFO L226 Difference]: Without dead ends: 305 [2025-02-06 14:25:12,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:25:12,732 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 90 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:12,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 153 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:25:12,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-06 14:25:12,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 299. [2025-02-06 14:25:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 219 states have (on average 1.4018264840182648) internal successors, (307), 289 states have internal predecessors, (307), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:25:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 321 transitions. [2025-02-06 14:25:12,739 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 321 transitions. Word has length 60 [2025-02-06 14:25:12,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:12,739 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 321 transitions. [2025-02-06 14:25:12,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 321 transitions. [2025-02-06 14:25:12,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 14:25:12,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:12,740 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:25:12,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 14:25:12,944 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-06 14:25:12,944 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:12,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:12,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2069461556, now seen corresponding path program 1 times [2025-02-06 14:25:12,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:12,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724961754] [2025-02-06 14:25:12,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:12,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:12,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 14:25:12,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 14:25:12,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:12,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:13,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:13,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724961754] [2025-02-06 14:25:13,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724961754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:13,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:25:13,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:25:13,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485619436] [2025-02-06 14:25:13,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:13,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:25:13,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:13,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:25:13,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:25:13,012 INFO L87 Difference]: Start difference. First operand 299 states and 321 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:13,073 INFO L93 Difference]: Finished difference Result 300 states and 321 transitions. [2025-02-06 14:25:13,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:25:13,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2025-02-06 14:25:13,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:13,074 INFO L225 Difference]: With dead ends: 300 [2025-02-06 14:25:13,074 INFO L226 Difference]: Without dead ends: 299 [2025-02-06 14:25:13,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:25:13,075 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 39 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:13,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 280 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:25:13,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-06 14:25:13,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-02-06 14:25:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 219 states have (on average 1.3972602739726028) internal successors, (306), 289 states have internal predecessors, (306), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:25:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 320 transitions. [2025-02-06 14:25:13,081 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 320 transitions. Word has length 66 [2025-02-06 14:25:13,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:13,081 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 320 transitions. [2025-02-06 14:25:13,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 320 transitions. [2025-02-06 14:25:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 14:25:13,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:13,082 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:25:13,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 14:25:13,082 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:13,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2053706350, now seen corresponding path program 1 times [2025-02-06 14:25:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:13,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295379350] [2025-02-06 14:25:13,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:13,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:13,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 14:25:13,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 14:25:13,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:13,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:25:13,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1125504600] [2025-02-06 14:25:13,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:13,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:25:13,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:25:13,121 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:25:13,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 14:25:13,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 14:25:13,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 14:25:13,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:13,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:13,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 14:25:13,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:25:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-06 14:25:13,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:25:13,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:13,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295379350] [2025-02-06 14:25:13,277 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:25:13,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125504600] [2025-02-06 14:25:13,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125504600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:13,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:25:13,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:25:13,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342644659] [2025-02-06 14:25:13,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:13,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:25:13,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:13,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:25:13,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:25:13,279 INFO L87 Difference]: Start difference. First operand 299 states and 320 transitions. Second operand has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:13,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:13,315 INFO L93 Difference]: Finished difference Result 299 states and 320 transitions. [2025-02-06 14:25:13,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:25:13,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 96 [2025-02-06 14:25:13,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:13,316 INFO L225 Difference]: With dead ends: 299 [2025-02-06 14:25:13,316 INFO L226 Difference]: Without dead ends: 296 [2025-02-06 14:25:13,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:25:13,317 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 95 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:13,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 159 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:25:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-02-06 14:25:13,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-02-06 14:25:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 219 states have (on average 1.3744292237442923) internal successors, (301), 286 states have internal predecessors, (301), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:25:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 315 transitions. [2025-02-06 14:25:13,323 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 315 transitions. Word has length 96 [2025-02-06 14:25:13,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:13,323 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 315 transitions. [2025-02-06 14:25:13,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:13,323 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 315 transitions. [2025-02-06 14:25:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 14:25:13,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:13,324 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:25:13,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 14:25:13,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:25:13,525 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:13,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:13,525 INFO L85 PathProgramCache]: Analyzing trace with hash -759612504, now seen corresponding path program 1 times [2025-02-06 14:25:13,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:13,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540965812] [2025-02-06 14:25:13,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:13,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:13,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 14:25:13,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 14:25:13,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:13,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:25:13,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1917822864] [2025-02-06 14:25:13,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:13,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:25:13,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:25:13,559 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:25:13,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 14:25:13,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 14:25:13,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 14:25:13,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:13,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:13,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 14:25:13,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:25:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:13,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:25:14,014 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:14,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:14,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540965812] [2025-02-06 14:25:14,014 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:25:14,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917822864] [2025-02-06 14:25:14,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917822864] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:25:14,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 14:25:14,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-02-06 14:25:14,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342933002] [2025-02-06 14:25:14,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 14:25:14,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:25:14,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:14,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:25:14,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:25:14,016 INFO L87 Difference]: Start difference. First operand 296 states and 315 transitions. Second operand has 8 states, 7 states have (on average 24.0) internal successors, (168), 8 states have internal predecessors, (168), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 14:25:14,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:14,655 INFO L93 Difference]: Finished difference Result 368 states and 383 transitions. [2025-02-06 14:25:14,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:25:14,655 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 24.0) internal successors, (168), 8 states have internal predecessors, (168), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 97 [2025-02-06 14:25:14,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:14,657 INFO L225 Difference]: With dead ends: 368 [2025-02-06 14:25:14,658 INFO L226 Difference]: Without dead ends: 361 [2025-02-06 14:25:14,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:25:14,659 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 284 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:14,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 333 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 14:25:14,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-02-06 14:25:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 334. [2025-02-06 14:25:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 258 states have (on average 1.3953488372093024) internal successors, (360), 324 states have internal predecessors, (360), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:25:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 374 transitions. [2025-02-06 14:25:14,669 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 374 transitions. Word has length 97 [2025-02-06 14:25:14,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:14,669 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 374 transitions. [2025-02-06 14:25:14,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 24.0) internal successors, (168), 8 states have internal predecessors, (168), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 14:25:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 374 transitions. [2025-02-06 14:25:14,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 14:25:14,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:14,671 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:25:14,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 14:25:14,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 14:25:14,872 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:14,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:14,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2073151060, now seen corresponding path program 1 times [2025-02-06 14:25:14,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:14,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729287909] [2025-02-06 14:25:14,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:14,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:14,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 14:25:14,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 14:25:14,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:14,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:25:14,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [491921072] [2025-02-06 14:25:14,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:14,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:25:14,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:25:14,901 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:25:14,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 14:25:14,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 14:25:14,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 14:25:14,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:14,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:14,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 14:25:14,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:25:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:15,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:25:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:16,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:16,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729287909] [2025-02-06 14:25:16,030 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:25:16,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491921072] [2025-02-06 14:25:16,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491921072] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 14:25:16,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:25:16,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2025-02-06 14:25:16,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42422740] [2025-02-06 14:25:16,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:16,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:25:16,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:16,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:25:16,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:25:16,031 INFO L87 Difference]: Start difference. First operand 334 states and 374 transitions. Second operand has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:18,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:25:22,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:25:26,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:25:29,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:25:31,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:25:35,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:25:39,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:25:46,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:25:48,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:25:50,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:25:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:50,968 INFO L93 Difference]: Finished difference Result 334 states and 374 transitions. [2025-02-06 14:25:50,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:25:50,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 98 [2025-02-06 14:25:50,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:50,970 INFO L225 Difference]: With dead ends: 334 [2025-02-06 14:25:50,970 INFO L226 Difference]: Without dead ends: 332 [2025-02-06 14:25:50,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:25:50,970 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 203 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 12 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.9s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:50,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 58 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 352 Invalid, 5 Unknown, 0 Unchecked, 34.9s Time] [2025-02-06 14:25:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-02-06 14:25:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-02-06 14:25:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 258 states have (on average 1.37984496124031) internal successors, (356), 322 states have internal predecessors, (356), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:25:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 370 transitions. [2025-02-06 14:25:50,978 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 370 transitions. Word has length 98 [2025-02-06 14:25:50,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:50,978 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 370 transitions. [2025-02-06 14:25:50,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:50,979 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 370 transitions. [2025-02-06 14:25:50,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 14:25:50,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:50,980 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:25:50,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 14:25:51,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 14:25:51,181 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:51,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:51,181 INFO L85 PathProgramCache]: Analyzing trace with hash 156826662, now seen corresponding path program 1 times [2025-02-06 14:25:51,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:51,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130544518] [2025-02-06 14:25:51,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:51,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:51,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 14:25:51,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 14:25:51,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:51,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:25:51,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1634134977] [2025-02-06 14:25:51,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:51,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:25:51,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:25:51,213 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:25:51,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 14:25:51,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 14:25:51,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 14:25:51,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:51,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:51,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 14:25:51,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:25:51,369 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:51,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:25:51,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:51,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130544518] [2025-02-06 14:25:51,371 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:25:51,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634134977] [2025-02-06 14:25:51,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634134977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:25:51,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:25:51,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:25:51,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117610251] [2025-02-06 14:25:51,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:51,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:25:51,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:51,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:25:51,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:25:51,372 INFO L87 Difference]: Start difference. First operand 332 states and 370 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:51,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:25:51,610 INFO L93 Difference]: Finished difference Result 332 states and 370 transitions. [2025-02-06 14:25:51,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:25:51,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 99 [2025-02-06 14:25:51,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:25:51,612 INFO L225 Difference]: With dead ends: 332 [2025-02-06 14:25:51,612 INFO L226 Difference]: Without dead ends: 312 [2025-02-06 14:25:51,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:25:51,613 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 201 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:25:51,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 48 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:25:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-06 14:25:51,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2025-02-06 14:25:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 258 states have (on average 1.2635658914728682) internal successors, (326), 302 states have internal predecessors, (326), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:25:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 340 transitions. [2025-02-06 14:25:51,621 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 340 transitions. Word has length 99 [2025-02-06 14:25:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:25:51,622 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 340 transitions. [2025-02-06 14:25:51,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 340 transitions. [2025-02-06 14:25:51,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 14:25:51,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:25:51,622 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:25:51,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 14:25:51,823 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-06 14:25:51,823 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:25:51,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:25:51,824 INFO L85 PathProgramCache]: Analyzing trace with hash 566659306, now seen corresponding path program 1 times [2025-02-06 14:25:51,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:25:51,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680739701] [2025-02-06 14:25:51,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:51,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:25:51,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 14:25:51,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 14:25:51,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:51,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:25:51,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [601540091] [2025-02-06 14:25:51,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:25:51,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:25:51,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:25:51,843 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:25:51,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 14:25:51,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 14:25:51,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 14:25:51,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:25:51,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:25:51,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 14:25:51,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:25:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:25:52,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:25:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-06 14:25:52,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:25:52,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680739701] [2025-02-06 14:25:52,267 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:25:52,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601540091] [2025-02-06 14:25:52,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601540091] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 14:25:52,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:25:52,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-06 14:25:52,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10230809] [2025-02-06 14:25:52,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:25:52,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:25:52,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:25:52,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:25:52,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:25:52,268 INFO L87 Difference]: Start difference. First operand 312 states and 340 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:25:55,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:25:59,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-06 14:26:00,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:00,203 INFO L93 Difference]: Finished difference Result 312 states and 340 transitions. [2025-02-06 14:26:00,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:26:00,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 100 [2025-02-06 14:26:00,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:00,205 INFO L225 Difference]: With dead ends: 312 [2025-02-06 14:26:00,205 INFO L226 Difference]: Without dead ends: 310 [2025-02-06 14:26:00,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:26:00,205 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 79 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:00,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 44 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2025-02-06 14:26:00,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-06 14:26:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2025-02-06 14:26:00,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 258 states have (on average 1.248062015503876) internal successors, (322), 300 states have internal predecessors, (322), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:26:00,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 336 transitions. [2025-02-06 14:26:00,213 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 336 transitions. Word has length 100 [2025-02-06 14:26:00,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:00,213 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 336 transitions. [2025-02-06 14:26:00,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:26:00,213 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 336 transitions. [2025-02-06 14:26:00,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 14:26:00,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:26:00,214 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:26:00,220 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-06 14:26:00,418 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-06 14:26:00,418 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:26:00,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:26:00,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1486423718, now seen corresponding path program 1 times [2025-02-06 14:26:00,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:26:00,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951567122] [2025-02-06 14:26:00,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:00,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:26:00,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 14:26:00,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 14:26:00,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:00,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 14:26:00,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:26:00,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951567122] [2025-02-06 14:26:00,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951567122] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:26:00,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86460493] [2025-02-06 14:26:00,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:00,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:00,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:26:00,516 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:26:00,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 14:26:00,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 14:26:00,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 14:26:00,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:00,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:00,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 14:26:00,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:26:00,645 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 14:26:00,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:26:00,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86460493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:26:00,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:26:00,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 14:26:00,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138250168] [2025-02-06 14:26:00,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:26:00,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:26:00,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:26:00,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:26:00,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:26:00,647 INFO L87 Difference]: Start difference. First operand 310 states and 336 transitions. Second operand has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 14:26:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:00,666 INFO L93 Difference]: Finished difference Result 310 states and 336 transitions. [2025-02-06 14:26:00,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:26:00,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 108 [2025-02-06 14:26:00,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:00,668 INFO L225 Difference]: With dead ends: 310 [2025-02-06 14:26:00,668 INFO L226 Difference]: Without dead ends: 309 [2025-02-06 14:26:00,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 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-06 14:26:00,669 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 25 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:00,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 350 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:26:00,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-02-06 14:26:00,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2025-02-06 14:26:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 258 states have (on average 1.2403100775193798) internal successors, (320), 299 states have internal predecessors, (320), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 14:26:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 334 transitions. [2025-02-06 14:26:00,676 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 334 transitions. Word has length 108 [2025-02-06 14:26:00,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:00,677 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 334 transitions. [2025-02-06 14:26:00,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 14:26:00,677 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 334 transitions. [2025-02-06 14:26:00,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 14:26:00,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:26:00,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:26:00,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 14:26:00,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:00,882 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:26:00,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:26:00,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1165504927, now seen corresponding path program 1 times [2025-02-06 14:26:00,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:26:00,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061487854] [2025-02-06 14:26:00,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:00,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:26:00,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 14:26:00,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 14:26:00,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:00,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 14:26:00,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:26:00,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061487854] [2025-02-06 14:26:00,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061487854] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:26:00,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061322376] [2025-02-06 14:26:00,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:00,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:00,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:26:00,984 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:26:00,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 14:26:01,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 14:26:01,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 14:26:01,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:01,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:01,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 14:26:01,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:26:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 14:26:01,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:26:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 14:26:01,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061322376] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:26:01,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:26:01,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 14:26:01,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431427974] [2025-02-06 14:26:01,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:26:01,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:26:01,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:26:01,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:26:01,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:26:01,205 INFO L87 Difference]: Start difference. First operand 309 states and 334 transitions. Second operand has 7 states, 6 states have (on average 36.833333333333336) internal successors, (221), 7 states have internal predecessors, (221), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-06 14:26:01,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:01,236 INFO L93 Difference]: Finished difference Result 408 states and 421 transitions. [2025-02-06 14:26:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:26:01,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 36.833333333333336) internal successors, (221), 7 states have internal predecessors, (221), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 109 [2025-02-06 14:26:01,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:01,238 INFO L225 Difference]: With dead ends: 408 [2025-02-06 14:26:01,238 INFO L226 Difference]: Without dead ends: 407 [2025-02-06 14:26:01,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 214 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-06 14:26:01,240 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 68 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:01,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 667 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:26:01,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-02-06 14:26:01,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 366. [2025-02-06 14:26:01,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 313 states have (on average 1.2779552715654952) internal successors, (400), 354 states have internal predecessors, (400), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 14:26:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 418 transitions. [2025-02-06 14:26:01,251 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 418 transitions. Word has length 109 [2025-02-06 14:26:01,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:01,251 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 418 transitions. [2025-02-06 14:26:01,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 36.833333333333336) internal successors, (221), 7 states have internal predecessors, (221), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-06 14:26:01,251 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 418 transitions. [2025-02-06 14:26:01,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 14:26:01,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:26:01,253 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:26:01,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 14:26:01,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:01,453 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:26:01,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:26:01,455 INFO L85 PathProgramCache]: Analyzing trace with hash -616745803, now seen corresponding path program 1 times [2025-02-06 14:26:01,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:26:01,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395695518] [2025-02-06 14:26:01,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:01,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:26:01,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 14:26:01,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 14:26:01,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:01,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 14:26:01,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:26:01,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395695518] [2025-02-06 14:26:01,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395695518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:26:01,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:26:01,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:26:01,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977620529] [2025-02-06 14:26:01,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:26:01,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:26:01,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:26:01,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:26:01,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:26:01,539 INFO L87 Difference]: Start difference. First operand 366 states and 418 transitions. Second operand has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 14:26:01,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:01,733 INFO L93 Difference]: Finished difference Result 366 states and 418 transitions. [2025-02-06 14:26:01,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:26:01,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 121 [2025-02-06 14:26:01,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:01,735 INFO L225 Difference]: With dead ends: 366 [2025-02-06 14:26:01,735 INFO L226 Difference]: Without dead ends: 359 [2025-02-06 14:26:01,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:26:01,735 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 78 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:01,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 54 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:26:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-02-06 14:26:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-02-06 14:26:01,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 313 states have (on average 1.233226837060703) internal successors, (386), 347 states have internal predecessors, (386), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 14:26:01,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 404 transitions. [2025-02-06 14:26:01,744 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 404 transitions. Word has length 121 [2025-02-06 14:26:01,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:01,744 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 404 transitions. [2025-02-06 14:26:01,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 14:26:01,745 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 404 transitions. [2025-02-06 14:26:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 14:26:01,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:26:01,745 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:26:01,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 14:26:01,746 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:26:01,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:26:01,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1939250567, now seen corresponding path program 1 times [2025-02-06 14:26:01,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:26:01,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079222416] [2025-02-06 14:26:01,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:01,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:26:01,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 14:26:01,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 14:26:01,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:01,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:01,792 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 14:26:01,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:26:01,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079222416] [2025-02-06 14:26:01,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079222416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:26:01,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:26:01,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:26:01,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696342524] [2025-02-06 14:26:01,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:26:01,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:26:01,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:26:01,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:26:01,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:26:01,793 INFO L87 Difference]: Start difference. First operand 359 states and 404 transitions. Second operand has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 14:26:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:01,904 INFO L93 Difference]: Finished difference Result 359 states and 404 transitions. [2025-02-06 14:26:01,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:26:01,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 122 [2025-02-06 14:26:01,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:01,905 INFO L225 Difference]: With dead ends: 359 [2025-02-06 14:26:01,905 INFO L226 Difference]: Without dead ends: 358 [2025-02-06 14:26:01,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:26:01,906 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 108 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:01,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 41 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:26:01,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-06 14:26:01,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2025-02-06 14:26:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 313 states have (on average 1.2236421725239617) internal successors, (383), 346 states have internal predecessors, (383), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 14:26:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 401 transitions. [2025-02-06 14:26:01,917 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 401 transitions. Word has length 122 [2025-02-06 14:26:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:01,918 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 401 transitions. [2025-02-06 14:26:01,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 14:26:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 401 transitions. [2025-02-06 14:26:01,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 14:26:01,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:26:01,919 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:26:01,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 14:26:01,919 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:26:01,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:26:01,919 INFO L85 PathProgramCache]: Analyzing trace with hash 396016055, now seen corresponding path program 1 times [2025-02-06 14:26:01,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:26:01,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730467196] [2025-02-06 14:26:01,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:01,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:26:01,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 14:26:01,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 14:26:01,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:01,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 22 proven. 40 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 14:26:02,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:26:02,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730467196] [2025-02-06 14:26:02,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730467196] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:26:02,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040590630] [2025-02-06 14:26:02,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:02,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:02,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:26:02,091 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-06 14:26:02,092 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-06 14:26:02,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 14:26:02,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 14:26:02,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:02,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:02,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 14:26:02,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:26:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 14:26:02,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:26:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 14:26:02,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040590630] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:26:02,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:26:02,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 14:26:02,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680144215] [2025-02-06 14:26:02,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:26:02,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 14:26:02,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:26:02,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 14:26:02,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-06 14:26:02,586 INFO L87 Difference]: Start difference. First operand 358 states and 401 transitions. Second operand has 13 states, 13 states have (on average 21.923076923076923) internal successors, (285), 11 states have internal predecessors, (285), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2025-02-06 14:26:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:02,645 INFO L93 Difference]: Finished difference Result 366 states and 406 transitions. [2025-02-06 14:26:02,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:26:02,645 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 21.923076923076923) internal successors, (285), 11 states have internal predecessors, (285), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 124 [2025-02-06 14:26:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:02,646 INFO L225 Difference]: With dead ends: 366 [2025-02-06 14:26:02,646 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 14:26:02,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-02-06 14:26:02,647 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 73 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:02,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 644 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:26:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 14:26:02,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2025-02-06 14:26:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 129 states have (on average 1.0077519379844961) internal successors, (130), 130 states have internal predecessors, (130), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:26:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2025-02-06 14:26:02,655 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 124 [2025-02-06 14:26:02,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:02,655 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2025-02-06 14:26:02,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.923076923076923) internal successors, (285), 11 states have internal predecessors, (285), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2025-02-06 14:26:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2025-02-06 14:26:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 14:26:02,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:26:02,656 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:26:02,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 14:26:02,857 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-06 14:26:02,857 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:26:02,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:26:02,858 INFO L85 PathProgramCache]: Analyzing trace with hash 773652483, now seen corresponding path program 1 times [2025-02-06 14:26:02,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:26:02,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122960548] [2025-02-06 14:26:02,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:02,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:26:02,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 14:26:02,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 14:26:02,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:02,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:26:02,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [40543158] [2025-02-06 14:26:02,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:02,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:02,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:26:02,885 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:26:02,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 14:26:02,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 14:26:02,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 14:26:02,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:02,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:02,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 14:26:02,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:26:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 14:26:03,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:26:03,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:26:03,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122960548] [2025-02-06 14:26:03,743 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:26:03,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40543158] [2025-02-06 14:26:03,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40543158] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:26:03,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:26:03,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-02-06 14:26:03,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499218895] [2025-02-06 14:26:03,744 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 14:26:03,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:26:03,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:26:03,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:26:03,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:26:03,745 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-06 14:26:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:03,909 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2025-02-06 14:26:03,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:26:03,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 147 [2025-02-06 14:26:03,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:03,911 INFO L225 Difference]: With dead ends: 138 [2025-02-06 14:26:03,911 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 14:26:03,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:26:03,911 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 18 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:03,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 166 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:26:03,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 14:26:03,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-02-06 14:26:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 129 states have (on average 1.0) internal successors, (129), 129 states have internal predecessors, (129), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:26:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2025-02-06 14:26:03,916 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 147 [2025-02-06 14:26:03,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:03,916 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2025-02-06 14:26:03,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.333333333333332) internal successors, (128), 7 states have internal predecessors, (128), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-06 14:26:03,916 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2025-02-06 14:26:03,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 14:26:03,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:26:03,917 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:26:03,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 14:26:04,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:04,121 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-02-06 14:26:04,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:26:04,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1786576825, now seen corresponding path program 1 times [2025-02-06 14:26:04,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:26:04,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792030733] [2025-02-06 14:26:04,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:04,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:26:04,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 14:26:04,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 14:26:04,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:04,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:26:04,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [566281064] [2025-02-06 14:26:04,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:26:04,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:04,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:26:04,140 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:26:04,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 14:26:04,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 14:26:04,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 14:26:04,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:26:04,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:26:04,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 14:26:04,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:26:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-06 14:26:04,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:26:05,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:26:05,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792030733] [2025-02-06 14:26:05,220 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:26:05,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566281064] [2025-02-06 14:26:05,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566281064] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:26:05,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:26:05,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-02-06 14:26:05,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980181236] [2025-02-06 14:26:05,220 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 14:26:05,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:26:05,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:26:05,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:26:05,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:26:05,222 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-06 14:26:05,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:26:05,427 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2025-02-06 14:26:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:26:05,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 148 [2025-02-06 14:26:05,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:26:05,427 INFO L225 Difference]: With dead ends: 137 [2025-02-06 14:26:05,427 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 14:26:05,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:26:05,428 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 18 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:26:05,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 213 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:26:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 14:26:05,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 14:26:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:26:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 14:26:05,428 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 148 [2025-02-06 14:26:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:26:05,428 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 14:26:05,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-06 14:26:05,429 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 14:26:05,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 14:26:05,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 84 remaining) [2025-02-06 14:26:05,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 84 remaining) [2025-02-06 14:26:05,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 84 remaining) [2025-02-06 14:26:05,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 84 remaining) [2025-02-06 14:26:05,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 84 remaining) [2025-02-06 14:26:05,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 84 remaining) [2025-02-06 14:26:05,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 84 remaining) [2025-02-06 14:26:05,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 84 remaining) [2025-02-06 14:26:05,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 84 remaining) [2025-02-06 14:26:05,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 84 remaining) [2025-02-06 14:26:05,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 84 remaining) [2025-02-06 14:26:05,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 84 remaining) [2025-02-06 14:26:05,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 84 remaining) [2025-02-06 14:26:05,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 84 remaining) [2025-02-06 14:26:05,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 84 remaining) [2025-02-06 14:26:05,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 84 remaining) [2025-02-06 14:26:05,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 84 remaining) [2025-02-06 14:26:05,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 84 remaining) [2025-02-06 14:26:05,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 84 remaining) [2025-02-06 14:26:05,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 84 remaining) [2025-02-06 14:26:05,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 84 remaining) [2025-02-06 14:26:05,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 84 remaining) [2025-02-06 14:26:05,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 84 remaining) [2025-02-06 14:26:05,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 84 remaining) [2025-02-06 14:26:05,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 84 remaining) [2025-02-06 14:26:05,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 84 remaining) [2025-02-06 14:26:05,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 84 remaining) [2025-02-06 14:26:05,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 84 remaining) [2025-02-06 14:26:05,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 84 remaining) [2025-02-06 14:26:05,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 84 remaining) [2025-02-06 14:26:05,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 84 remaining) [2025-02-06 14:26:05,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 84 remaining) [2025-02-06 14:26:05,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 84 remaining) [2025-02-06 14:26:05,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 84 remaining) [2025-02-06 14:26:05,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 84 remaining) [2025-02-06 14:26:05,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 84 remaining) [2025-02-06 14:26:05,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 84 remaining) [2025-02-06 14:26:05,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 84 remaining) [2025-02-06 14:26:05,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 84 remaining) [2025-02-06 14:26:05,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 84 remaining) [2025-02-06 14:26:05,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 84 remaining) [2025-02-06 14:26:05,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 84 remaining) [2025-02-06 14:26:05,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 84 remaining) [2025-02-06 14:26:05,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 84 remaining) [2025-02-06 14:26:05,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 84 remaining) [2025-02-06 14:26:05,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 84 remaining) [2025-02-06 14:26:05,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 84 remaining) [2025-02-06 14:26:05,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 84 remaining) [2025-02-06 14:26:05,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 84 remaining) [2025-02-06 14:26:05,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 84 remaining) [2025-02-06 14:26:05,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 84 remaining) [2025-02-06 14:26:05,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 84 remaining) [2025-02-06 14:26:05,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 84 remaining) [2025-02-06 14:26:05,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 84 remaining) [2025-02-06 14:26:05,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 84 remaining) [2025-02-06 14:26:05,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 84 remaining) [2025-02-06 14:26:05,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 84 remaining) [2025-02-06 14:26:05,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 84 remaining) [2025-02-06 14:26:05,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 84 remaining) [2025-02-06 14:26:05,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 84 remaining) [2025-02-06 14:26:05,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 84 remaining) [2025-02-06 14:26:05,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 84 remaining) [2025-02-06 14:26:05,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 84 remaining) [2025-02-06 14:26:05,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 84 remaining) [2025-02-06 14:26:05,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 14:26:05,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:26:05,643 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:26:05,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 14:26:05,691 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 14:26:05,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:26:05 BoogieIcfgContainer [2025-02-06 14:26:05,699 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 14:26:05,699 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 14:26:05,699 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 14:26:05,699 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 14:26:05,700 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:25:10" (3/4) ... [2025-02-06 14:26:05,701 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 14:26:05,706 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-06 14:26:05,706 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-06 14:26:05,709 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-06 14:26:05,709 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 14:26:05,709 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 14:26:05,710 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 14:26:05,760 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 14:26:05,761 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 14:26:05,761 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 14:26:05,761 INFO L158 Benchmark]: Toolchain (without parser) took 55834.48ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 129.3MB in the beginning and 78.1MB in the end (delta: 51.2MB). Peak memory consumption was 124.6MB. Max. memory is 16.1GB. [2025-02-06 14:26:05,761 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:26:05,762 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.09ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 117.7MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:26:05,762 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.42ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 115.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:26:05,762 INFO L158 Benchmark]: Boogie Preprocessor took 29.89ms. Allocated memory is still 167.8MB. Free memory was 115.8MB in the beginning and 114.7MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:26:05,762 INFO L158 Benchmark]: IcfgBuilder took 422.19ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 85.5MB in the end (delta: 29.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 14:26:05,762 INFO L158 Benchmark]: TraceAbstraction took 55129.86ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 85.0MB in the beginning and 83.5MB in the end (delta: 1.5MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. [2025-02-06 14:26:05,762 INFO L158 Benchmark]: Witness Printer took 61.83ms. Allocated memory is still 243.3MB. Free memory was 83.5MB in the beginning and 78.1MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:26:05,763 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.81ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 157.09ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 117.7MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.42ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 115.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.89ms. Allocated memory is still 167.8MB. Free memory was 115.8MB in the beginning and 114.7MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 422.19ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 85.5MB in the end (delta: 29.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 55129.86ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 85.0MB in the beginning and 83.5MB in the end (delta: 1.5MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. * Witness Printer took 61.83ms. Allocated memory is still 243.3MB. Free memory was 83.5MB in the beginning and 78.1MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 192 locations, 84 error locations. Started 1 CEGAR loops. OverallTime: 55.0s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 45.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 1747 SdHoareTripleChecker+Valid, 45.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1726 mSDsluCounter, 4652 SdHoareTripleChecker+Invalid, 44.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2686 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3846 IncrementalHoareTripleChecker+Invalid, 4042 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 1966 mSDtfsCounter, 3846 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1943 GetRequests, 1861 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=366occurred in iteration=15, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 101 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 2915 NumberOfCodeBlocks, 2915 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2569 ConstructedInterpolants, 0 QuantifiedInterpolants, 17289 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1751 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 29 InterpolantComputations, 15 PerfectInterpolantSequences, 584/989 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 84 specifications checked. All of them hold - InvariantResult [Line: 28]: Location Invariant Derived location invariant: (((((k == 1) && (c == 1)) && (x == 1)) && (y == 1)) || (((((0 <= k) && (c == 0)) && (k <= 1)) && (y == 0)) && (x == 0))) RESULT: Ultimate proved your program to be correct! [2025-02-06 14:26:05,781 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