./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.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 df76811034b688387cfe28dd1eb6de91c21580662ac8ddb8163b41c1d6179172 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:21:13,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:21:13,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:21:13,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:21:13,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:21:13,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:21:13,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:21:13,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:21:13,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:21:13,622 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:21:13,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:21:13,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:21:13,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:21:13,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:21:13,622 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:21:13,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:21:13,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:21:13,622 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:21:13,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:21:13,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:21:13,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:21:13,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:21:13,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:21:13,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:21:13,623 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:21:13,623 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:21:13,623 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:21:13,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:21:13,623 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:21:13,623 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:21:13,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:21:13,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:21:13,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:21:13,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:21:13,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:21:13,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:21:13,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:21:13,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:21:13,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:21:13,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:21:13,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:21:13,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:21:13,627 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:21:13,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:21:13,627 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:21:13,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:21:13,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:21:13,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:21:13,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:21:13,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:21:13,628 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 -> df76811034b688387cfe28dd1eb6de91c21580662ac8ddb8163b41c1d6179172 [2025-01-10 01:21:13,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:21:13,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:21:13,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:21:13,950 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:21:13,951 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:21:13,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c [2025-01-10 01:21:15,322 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21af8caff/a520c58caec04a0695379ba554c1678d/FLAGeff57c75b [2025-01-10 01:21:15,549 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:21:15,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c [2025-01-10 01:21:15,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21af8caff/a520c58caec04a0695379ba554c1678d/FLAGeff57c75b [2025-01-10 01:21:15,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21af8caff/a520c58caec04a0695379ba554c1678d [2025-01-10 01:21:15,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:21:15,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:21:15,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:21:15,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:21:15,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:21:15,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:21:15" (1/1) ... [2025-01-10 01:21:15,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9faf85f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:15, skipping insertion in model container [2025-01-10 01:21:15,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:21:15" (1/1) ... [2025-01-10 01:21:15,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:21:15,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:21:15,724 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:21:15,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:21:15,749 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:21:15,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:15 WrapperNode [2025-01-10 01:21:15,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:21:15,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:21:15,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:21:15,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:21:15,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:15" (1/1) ... [2025-01-10 01:21:15,763 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:15" (1/1) ... [2025-01-10 01:21:15,776 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2025-01-10 01:21:15,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:21:15,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:21:15,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:21:15,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:21:15,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:15" (1/1) ... [2025-01-10 01:21:15,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:15" (1/1) ... [2025-01-10 01:21:15,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:15" (1/1) ... [2025-01-10 01:21:15,799 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 01:21:15,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:15" (1/1) ... [2025-01-10 01:21:15,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:15" (1/1) ... [2025-01-10 01:21:15,805 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:15" (1/1) ... [2025-01-10 01:21:15,806 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:15" (1/1) ... [2025-01-10 01:21:15,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:15" (1/1) ... [2025-01-10 01:21:15,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:15" (1/1) ... [2025-01-10 01:21:15,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:15" (1/1) ... [2025-01-10 01:21:15,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:21:15,812 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:21:15,812 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:21:15,812 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:21:15,813 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:15" (1/1) ... [2025-01-10 01:21:15,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:21:15,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:15,847 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-01-10 01:21:15,852 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-01-10 01:21:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:21:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:21:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:21:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:21:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:21:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:21:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:21:15,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:21:15,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:21:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:21:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:21:15,920 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:21:15,921 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:21:16,084 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2025-01-10 01:21:16,084 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:21:16,100 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:21:16,100 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:21:16,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:21:16 BoogieIcfgContainer [2025-01-10 01:21:16,101 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:21:16,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:21:16,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:21:16,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:21:16,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:21:15" (1/3) ... [2025-01-10 01:21:16,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1ffae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:21:16, skipping insertion in model container [2025-01-10 01:21:16,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:15" (2/3) ... [2025-01-10 01:21:16,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1ffae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:21:16, skipping insertion in model container [2025-01-10 01:21:16,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:21:16" (3/3) ... [2025-01-10 01:21:16,113 INFO L128 eAbstractionObserver]: Analyzing ICFG init-non-constant-3-u.c [2025-01-10 01:21:16,127 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:21:16,129 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG init-non-constant-3-u.c that has 1 procedures, 55 locations, 1 initial locations, 6 loop locations, and 20 error locations. [2025-01-10 01:21:16,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:21:16,189 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;@5e796787, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:21:16,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-01-10 01:21:16,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 states have internal predecessors, (61), 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-01-10 01:21:16,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:21:16,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:16,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:21:16,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 01:21:16,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:16,203 INFO L85 PathProgramCache]: Analyzing trace with hash 28695588, now seen corresponding path program 1 times [2025-01-10 01:21:16,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:16,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349219845] [2025-01-10 01:21:16,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:16,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:21:16,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:21:16,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:16,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:21:16,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:16,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349219845] [2025-01-10 01:21:16,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349219845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:16,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:16,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:21:16,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310332523] [2025-01-10 01:21:16,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:16,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:21:16,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:16,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:21:16,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:21:16,477 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:16,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:16,632 INFO L93 Difference]: Finished difference Result 134 states and 163 transitions. [2025-01-10 01:21:16,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:21:16,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-10 01:21:16,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:16,643 INFO L225 Difference]: With dead ends: 134 [2025-01-10 01:21:16,644 INFO L226 Difference]: Without dead ends: 76 [2025-01-10 01:21:16,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-01-10 01:21:16,649 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 89 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:16,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 50 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-10 01:21:16,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2025-01-10 01:21:16,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.75) internal successors, (91), 71 states have internal predecessors, (91), 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-01-10 01:21:16,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2025-01-10 01:21:16,683 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 5 [2025-01-10 01:21:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:16,684 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2025-01-10 01:21:16,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:16,684 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2025-01-10 01:21:16,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:21:16,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:16,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:21:16,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:21:16,685 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 01:21:16,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:16,686 INFO L85 PathProgramCache]: Analyzing trace with hash 889539528, now seen corresponding path program 1 times [2025-01-10 01:21:16,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:16,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516474161] [2025-01-10 01:21:16,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:16,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:16,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:21:16,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:21:16,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:16,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:21:16,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:16,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516474161] [2025-01-10 01:21:16,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516474161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:16,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:16,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:21:16,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051902399] [2025-01-10 01:21:16,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:16,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:21:16,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:16,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:21:16,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:21:16,796 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:16,960 INFO L93 Difference]: Finished difference Result 142 states and 180 transitions. [2025-01-10 01:21:16,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:21:16,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 01:21:16,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:16,963 INFO L225 Difference]: With dead ends: 142 [2025-01-10 01:21:16,963 INFO L226 Difference]: Without dead ends: 134 [2025-01-10 01:21:16,963 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-01-10 01:21:16,966 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 87 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:16,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 64 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-10 01:21:16,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 122. [2025-01-10 01:21:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 102 states have (on average 1.6862745098039216) internal successors, (172), 121 states have internal predecessors, (172), 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-01-10 01:21:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2025-01-10 01:21:16,990 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 6 [2025-01-10 01:21:16,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:16,991 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2025-01-10 01:21:16,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:16,991 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2025-01-10 01:21:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:21:16,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:16,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:16,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:21:16,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 01:21:16,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:16,993 INFO L85 PathProgramCache]: Analyzing trace with hash 148996042, now seen corresponding path program 1 times [2025-01-10 01:21:16,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:16,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747032770] [2025-01-10 01:21:16,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:16,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:17,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:21:17,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:21:17,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:17,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:21:17,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:17,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747032770] [2025-01-10 01:21:17,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747032770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:17,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:17,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:21:17,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935926864] [2025-01-10 01:21:17,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:17,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:21:17,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:17,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:21:17,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:21:17,140 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:17,362 INFO L93 Difference]: Finished difference Result 158 states and 198 transitions. [2025-01-10 01:21:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:21:17,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:21:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:17,363 INFO L225 Difference]: With dead ends: 158 [2025-01-10 01:21:17,364 INFO L226 Difference]: Without dead ends: 150 [2025-01-10 01:21:17,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-01-10 01:21:17,367 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 84 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:17,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 66 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:21:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-10 01:21:17,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2025-01-10 01:21:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 118 states have (on average 1.6101694915254237) internal successors, (190), 137 states have internal predecessors, (190), 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-01-10 01:21:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 190 transitions. [2025-01-10 01:21:17,386 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 190 transitions. Word has length 8 [2025-01-10 01:21:17,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:17,386 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 190 transitions. [2025-01-10 01:21:17,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:17,386 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 190 transitions. [2025-01-10 01:21:17,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:21:17,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:17,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:17,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:21:17,387 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 01:21:17,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:17,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1865422324, now seen corresponding path program 1 times [2025-01-10 01:21:17,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:17,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124635969] [2025-01-10 01:21:17,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:17,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:17,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:21:17,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:21:17,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:17,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:17,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:21:17,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:17,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124635969] [2025-01-10 01:21:17,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124635969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:17,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:17,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:21:17,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132587074] [2025-01-10 01:21:17,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:17,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:21:17,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:17,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:21:17,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:21:17,466 INFO L87 Difference]: Start difference. First operand 138 states and 190 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:17,550 INFO L93 Difference]: Finished difference Result 310 states and 445 transitions. [2025-01-10 01:21:17,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:21:17,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 01:21:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:17,554 INFO L225 Difference]: With dead ends: 310 [2025-01-10 01:21:17,555 INFO L226 Difference]: Without dead ends: 190 [2025-01-10 01:21:17,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-01-10 01:21:17,559 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 89 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:17,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 63 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-10 01:21:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 186. [2025-01-10 01:21:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 166 states have (on average 1.5662650602409638) internal successors, (260), 185 states have internal predecessors, (260), 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-01-10 01:21:17,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 260 transitions. [2025-01-10 01:21:17,578 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 260 transitions. Word has length 10 [2025-01-10 01:21:17,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:17,578 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 260 transitions. [2025-01-10 01:21:17,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 260 transitions. [2025-01-10 01:21:17,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:21:17,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:17,579 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:17,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:21:17,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 01:21:17,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:17,580 INFO L85 PathProgramCache]: Analyzing trace with hash 855808752, now seen corresponding path program 1 times [2025-01-10 01:21:17,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:17,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571752470] [2025-01-10 01:21:17,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:17,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:17,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:21:17,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:21:17,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:17,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:21:17,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:17,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571752470] [2025-01-10 01:21:17,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571752470] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:17,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76021890] [2025-01-10 01:21:17,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:17,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:17,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:17,736 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-01-10 01:21:17,738 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-01-10 01:21:17,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:21:17,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:21:17,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:17,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:17,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:21:17,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:21:17,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:21:17,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76021890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:17,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:21:17,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-01-10 01:21:17,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318417187] [2025-01-10 01:21:17,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:17,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:21:17,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:17,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:21:17,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:21:17,947 INFO L87 Difference]: Start difference. First operand 186 states and 260 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-01-10 01:21:18,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:18,072 INFO L93 Difference]: Finished difference Result 186 states and 260 transitions. [2025-01-10 01:21:18,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:21:18,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 01:21:18,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:18,076 INFO L225 Difference]: With dead ends: 186 [2025-01-10 01:21:18,076 INFO L226 Difference]: Without dead ends: 176 [2025-01-10 01:21:18,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:21:18,077 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 41 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:18,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 10 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:18,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-10 01:21:18,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-01-10 01:21:18,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 166 states have (on average 1.3253012048192772) internal successors, (220), 175 states have internal predecessors, (220), 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-01-10 01:21:18,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 220 transitions. [2025-01-10 01:21:18,093 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 220 transitions. Word has length 15 [2025-01-10 01:21:18,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:18,093 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 220 transitions. [2025-01-10 01:21:18,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-01-10 01:21:18,094 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 220 transitions. [2025-01-10 01:21:18,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:21:18,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:18,094 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:18,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:21:18,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:18,299 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 01:21:18,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:18,300 INFO L85 PathProgramCache]: Analyzing trace with hash 760267588, now seen corresponding path program 1 times [2025-01-10 01:21:18,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:18,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580025915] [2025-01-10 01:21:18,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:18,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:18,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:21:18,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:21:18,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:18,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:21:18,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:18,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580025915] [2025-01-10 01:21:18,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580025915] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:18,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629966646] [2025-01-10 01:21:18,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:18,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:18,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:18,441 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-01-10 01:21:18,442 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-01-10 01:21:18,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:21:18,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:21:18,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:18,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:18,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:21:18,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:18,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:21:18,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:21:18,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629966646] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:18,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:18,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-01-10 01:21:18,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861519571] [2025-01-10 01:21:18,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:18,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:21:18,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:18,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:21:18,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:21:18,706 INFO L87 Difference]: Start difference. First operand 176 states and 220 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 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-01-10 01:21:19,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:19,257 INFO L93 Difference]: Finished difference Result 368 states and 463 transitions. [2025-01-10 01:21:19,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 01:21:19,258 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-10 01:21:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:19,260 INFO L225 Difference]: With dead ends: 368 [2025-01-10 01:21:19,260 INFO L226 Difference]: Without dead ends: 358 [2025-01-10 01:21:19,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=214, Invalid=386, Unknown=0, NotChecked=0, Total=600 [2025-01-10 01:21:19,261 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 475 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:19,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 62 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 01:21:19,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-01-10 01:21:19,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 348. [2025-01-10 01:21:19,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 338 states have (on average 1.2692307692307692) internal successors, (429), 347 states have internal predecessors, (429), 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-01-10 01:21:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 429 transitions. [2025-01-10 01:21:19,303 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 429 transitions. Word has length 16 [2025-01-10 01:21:19,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:19,303 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 429 transitions. [2025-01-10 01:21:19,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 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-01-10 01:21:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 429 transitions. [2025-01-10 01:21:19,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 01:21:19,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:19,304 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:21:19,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:21:19,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:19,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 01:21:19,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:19,506 INFO L85 PathProgramCache]: Analyzing trace with hash 940958888, now seen corresponding path program 1 times [2025-01-10 01:21:19,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:19,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521255169] [2025-01-10 01:21:19,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:19,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:19,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:21:19,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:21:19,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:19,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:21:19,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:19,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521255169] [2025-01-10 01:21:19,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521255169] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:19,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006475595] [2025-01-10 01:21:19,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:19,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:19,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:19,597 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-01-10 01:21:19,599 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-01-10 01:21:19,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:21:19,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:21:19,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:19,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:19,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:21:19,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:19,696 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:21:19,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:19,731 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:21:19,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006475595] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:19,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:19,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 01:21:19,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163166286] [2025-01-10 01:21:19,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:19,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:21:19,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:19,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:21:19,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:21:19,732 INFO L87 Difference]: Start difference. First operand 348 states and 429 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:19,879 INFO L93 Difference]: Finished difference Result 856 states and 1101 transitions. [2025-01-10 01:21:19,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:21:19,880 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-10 01:21:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:19,885 INFO L225 Difference]: With dead ends: 856 [2025-01-10 01:21:19,886 INFO L226 Difference]: Without dead ends: 540 [2025-01-10 01:21:19,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:21:19,890 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 136 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:19,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 95 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-01-10 01:21:19,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 534. [2025-01-10 01:21:19,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 524 states have (on average 1.25) internal successors, (655), 533 states have internal predecessors, (655), 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-01-10 01:21:19,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 655 transitions. [2025-01-10 01:21:19,927 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 655 transitions. Word has length 29 [2025-01-10 01:21:19,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:19,927 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 655 transitions. [2025-01-10 01:21:19,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:19,927 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 655 transitions. [2025-01-10 01:21:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 01:21:19,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:19,928 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2025-01-10 01:21:19,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:21:20,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:20,129 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 01:21:20,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:20,129 INFO L85 PathProgramCache]: Analyzing trace with hash -698695098, now seen corresponding path program 1 times [2025-01-10 01:21:20,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:20,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745067043] [2025-01-10 01:21:20,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:20,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:20,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 01:21:20,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:21:20,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:20,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:20,208 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:21:20,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:20,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745067043] [2025-01-10 01:21:20,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745067043] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:20,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017911993] [2025-01-10 01:21:20,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:20,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:20,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:20,212 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-01-10 01:21:20,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:21:20,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 01:21:20,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:21:20,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:20,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:20,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:21:20,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:20,336 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:21:20,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:21:20,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017911993] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:20,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:20,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 11 [2025-01-10 01:21:20,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935253347] [2025-01-10 01:21:20,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:20,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:21:20,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:20,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:21:20,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:21:20,400 INFO L87 Difference]: Start difference. First operand 534 states and 655 transitions. Second operand has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:20,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:20,586 INFO L93 Difference]: Finished difference Result 654 states and 815 transitions. [2025-01-10 01:21:20,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:21:20,587 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-01-10 01:21:20,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:20,589 INFO L225 Difference]: With dead ends: 654 [2025-01-10 01:21:20,590 INFO L226 Difference]: Without dead ends: 652 [2025-01-10 01:21:20,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=177, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:21:20,591 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 165 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:20,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 139 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:20,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-01-10 01:21:20,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 532. [2025-01-10 01:21:20,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 524 states have (on average 1.200381679389313) internal successors, (629), 531 states have internal predecessors, (629), 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-01-10 01:21:20,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 629 transitions. [2025-01-10 01:21:20,616 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 629 transitions. Word has length 32 [2025-01-10 01:21:20,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:20,616 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 629 transitions. [2025-01-10 01:21:20,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:20,617 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 629 transitions. [2025-01-10 01:21:20,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 01:21:20,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:20,620 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:20,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:21:20,820 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,SelfDestructingSolverStorable7 [2025-01-10 01:21:20,821 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 01:21:20,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:20,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1224899842, now seen corresponding path program 1 times [2025-01-10 01:21:20,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:20,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698498776] [2025-01-10 01:21:20,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:20,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:20,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 01:21:20,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 01:21:20,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:20,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 80 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 01:21:20,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:20,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698498776] [2025-01-10 01:21:20,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698498776] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:20,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354806716] [2025-01-10 01:21:20,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:20,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:20,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:20,984 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-01-10 01:21:20,986 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-01-10 01:21:21,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 01:21:21,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 01:21:21,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:21,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:21,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:21:21,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 80 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 01:21:21,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 80 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-10 01:21:21,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354806716] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:21,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:21,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-01-10 01:21:21,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719564944] [2025-01-10 01:21:21,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:21,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:21:21,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:21,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:21:21,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:21:21,294 INFO L87 Difference]: Start difference. First operand 532 states and 629 transitions. Second operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 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-01-10 01:21:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:21,586 INFO L93 Difference]: Finished difference Result 1721 states and 2099 transitions. [2025-01-10 01:21:21,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:21:21,587 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-01-10 01:21:21,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:21,593 INFO L225 Difference]: With dead ends: 1721 [2025-01-10 01:21:21,594 INFO L226 Difference]: Without dead ends: 1222 [2025-01-10 01:21:21,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:21:21,599 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 454 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:21,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 179 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:21:21,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2025-01-10 01:21:21,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1204. [2025-01-10 01:21:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1196 states have (on average 1.1881270903010033) internal successors, (1421), 1203 states have internal predecessors, (1421), 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-01-10 01:21:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1421 transitions. [2025-01-10 01:21:21,660 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1421 transitions. Word has length 55 [2025-01-10 01:21:21,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:21,661 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1421 transitions. [2025-01-10 01:21:21,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 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-01-10 01:21:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1421 transitions. [2025-01-10 01:21:21,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 01:21:21,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:21,665 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:21,676 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-01-10 01:21:21,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:21,872 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 01:21:21,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:21,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1273118526, now seen corresponding path program 2 times [2025-01-10 01:21:21,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:21,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794013169] [2025-01-10 01:21:21,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:21,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:21,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-01-10 01:21:21,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 97 statements. [2025-01-10 01:21:21,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:21:21,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-01-10 01:21:21,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:21,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794013169] [2025-01-10 01:21:21,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794013169] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:21,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999244646] [2025-01-10 01:21:21,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:21,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:21,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:21,941 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-01-10 01:21:21,943 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-01-10 01:21:21,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-01-10 01:21:21,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 97 statements. [2025-01-10 01:21:21,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:21:21,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:21,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:21:22,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:22,316 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 153 proven. 48 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-01-10 01:21:22,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-01-10 01:21:22,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999244646] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:22,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:22,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 01:21:22,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091680956] [2025-01-10 01:21:22,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:22,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:21:22,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:22,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:21:22,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:21:22,487 INFO L87 Difference]: Start difference. First operand 1204 states and 1421 transitions. Second operand has 11 states, 10 states have (on average 7.9) internal successors, (79), 11 states have internal predecessors, (79), 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-01-10 01:21:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:22,852 INFO L93 Difference]: Finished difference Result 1973 states and 2282 transitions. [2025-01-10 01:21:22,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:21:22,853 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.9) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-01-10 01:21:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:22,861 INFO L225 Difference]: With dead ends: 1973 [2025-01-10 01:21:22,861 INFO L226 Difference]: Without dead ends: 1967 [2025-01-10 01:21:22,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:21:22,863 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 127 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:22,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 33 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:21:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2025-01-10 01:21:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1627. [2025-01-10 01:21:22,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1619 states have (on average 1.1278567016676961) internal successors, (1826), 1626 states have internal predecessors, (1826), 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-01-10 01:21:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 1826 transitions. [2025-01-10 01:21:22,953 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 1826 transitions. Word has length 97 [2025-01-10 01:21:22,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:22,953 INFO L471 AbstractCegarLoop]: Abstraction has 1627 states and 1826 transitions. [2025-01-10 01:21:22,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.9) internal successors, (79), 11 states have internal predecessors, (79), 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-01-10 01:21:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 1826 transitions. [2025-01-10 01:21:22,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-10 01:21:22,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:22,957 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:22,964 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-01-10 01:21:23,161 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,SelfDestructingSolverStorable9 [2025-01-10 01:21:23,161 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 01:21:23,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:23,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1893030770, now seen corresponding path program 1 times [2025-01-10 01:21:23,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:23,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206024508] [2025-01-10 01:21:23,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:23,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:23,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-10 01:21:23,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-10 01:21:23,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:23,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 759 proven. 1 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2025-01-10 01:21:23,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:23,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206024508] [2025-01-10 01:21:23,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206024508] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:23,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526480968] [2025-01-10 01:21:23,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:23,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:23,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:23,429 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-01-10 01:21:23,431 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-01-10 01:21:23,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-10 01:21:23,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-10 01:21:23,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:23,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:23,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 01:21:23,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 756 proven. 325 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-01-10 01:21:23,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 756 proven. 325 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-01-10 01:21:24,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526480968] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:24,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:24,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14, 14] total 28 [2025-01-10 01:21:24,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446416083] [2025-01-10 01:21:24,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:24,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 01:21:24,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:24,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 01:21:24,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=446, Unknown=0, NotChecked=0, Total=756 [2025-01-10 01:21:24,122 INFO L87 Difference]: Start difference. First operand 1627 states and 1826 transitions. Second operand has 28 states, 28 states have (on average 6.357142857142857) internal successors, (178), 28 states have internal predecessors, (178), 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-01-10 01:21:25,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:25,927 INFO L93 Difference]: Finished difference Result 6754 states and 7834 transitions. [2025-01-10 01:21:25,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-01-10 01:21:25,928 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.357142857142857) internal successors, (178), 28 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2025-01-10 01:21:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:25,950 INFO L225 Difference]: With dead ends: 6754 [2025-01-10 01:21:25,950 INFO L226 Difference]: Without dead ends: 5133 [2025-01-10 01:21:25,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2116 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2483, Invalid=4489, Unknown=0, NotChecked=0, Total=6972 [2025-01-10 01:21:25,957 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 3622 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3622 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:25,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3622 Valid, 92 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 01:21:25,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2025-01-10 01:21:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 3816. [2025-01-10 01:21:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3816 states, 3808 states have (on average 1.1079306722689075) internal successors, (4219), 3815 states have internal predecessors, (4219), 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-01-10 01:21:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3816 states to 3816 states and 4219 transitions. [2025-01-10 01:21:26,154 INFO L78 Accepts]: Start accepts. Automaton has 3816 states and 4219 transitions. Word has length 159 [2025-01-10 01:21:26,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:26,155 INFO L471 AbstractCegarLoop]: Abstraction has 3816 states and 4219 transitions. [2025-01-10 01:21:26,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.357142857142857) internal successors, (178), 28 states have internal predecessors, (178), 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-01-10 01:21:26,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3816 states and 4219 transitions. [2025-01-10 01:21:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-01-10 01:21:26,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:26,166 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 66, 66, 66, 66, 66, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:26,175 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-01-10 01:21:26,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:26,367 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 01:21:26,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:26,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1017488186, now seen corresponding path program 2 times [2025-01-10 01:21:26,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:26,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460417868] [2025-01-10 01:21:26,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:26,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:26,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 485 statements into 2 equivalence classes. [2025-01-10 01:21:26,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 485 statements. [2025-01-10 01:21:26,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:21:26,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 15434 backedges. 0 proven. 7077 refuted. 0 times theorem prover too weak. 8357 trivial. 0 not checked. [2025-01-10 01:21:26,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:26,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460417868] [2025-01-10 01:21:26,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460417868] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:26,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155062859] [2025-01-10 01:21:26,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:26,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:26,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:26,443 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-01-10 01:21:26,446 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-01-10 01:21:26,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 485 statements into 2 equivalence classes. [2025-01-10 01:21:26,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 485 statements. [2025-01-10 01:21:26,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:21:26,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:26,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:21:26,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:27,255 INFO L134 CoverageAnalysis]: Checked inductivity of 15434 backedges. 6876 proven. 201 refuted. 0 times theorem prover too weak. 8357 trivial. 0 not checked. [2025-01-10 01:21:27,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:27,728 INFO L134 CoverageAnalysis]: Checked inductivity of 15434 backedges. 0 proven. 7077 refuted. 0 times theorem prover too weak. 8357 trivial. 0 not checked. [2025-01-10 01:21:27,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155062859] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:27,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:27,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 01:21:27,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810530885] [2025-01-10 01:21:27,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:27,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:21:27,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:27,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:21:27,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:21:27,730 INFO L87 Difference]: Start difference. First operand 3816 states and 4219 transitions. Second operand has 10 states, 9 states have (on average 9.0) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:27,868 INFO L93 Difference]: Finished difference Result 4227 states and 4722 transitions. [2025-01-10 01:21:27,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:21:27,868 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.0) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 485 [2025-01-10 01:21:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:27,878 INFO L225 Difference]: With dead ends: 4227 [2025-01-10 01:21:27,878 INFO L226 Difference]: Without dead ends: 2996 [2025-01-10 01:21:27,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 976 GetRequests, 964 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:21:27,880 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 102 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:27,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 12 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:21:27,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2025-01-10 01:21:27,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2214. [2025-01-10 01:21:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2214 states, 2212 states have (on average 1.05877034358047) internal successors, (2342), 2213 states have internal predecessors, (2342), 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-01-10 01:21:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 2342 transitions. [2025-01-10 01:21:27,977 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 2342 transitions. Word has length 485 [2025-01-10 01:21:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:27,978 INFO L471 AbstractCegarLoop]: Abstraction has 2214 states and 2342 transitions. [2025-01-10 01:21:27,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.0) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 2342 transitions. [2025-01-10 01:21:27,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-01-10 01:21:27,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:27,989 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 89, 88, 88, 88, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1] [2025-01-10 01:21:27,997 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-01-10 01:21:28,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:28,190 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 01:21:28,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:28,191 INFO L85 PathProgramCache]: Analyzing trace with hash -107642946, now seen corresponding path program 1 times [2025-01-10 01:21:28,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:28,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664241051] [2025-01-10 01:21:28,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:28,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:28,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-01-10 01:21:28,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-01-10 01:21:28,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:28,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 27636 backedges. 10418 proven. 1639 refuted. 0 times theorem prover too weak. 15579 trivial. 0 not checked. [2025-01-10 01:21:30,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:30,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664241051] [2025-01-10 01:21:30,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664241051] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:30,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515523037] [2025-01-10 01:21:30,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:30,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:30,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:30,650 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-01-10 01:21:30,653 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-01-10 01:21:30,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-01-10 01:21:30,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-01-10 01:21:30,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:30,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:30,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 01:21:30,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 27636 backedges. 10418 proven. 1639 refuted. 0 times theorem prover too weak. 15579 trivial. 0 not checked. [2025-01-10 01:21:31,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 27636 backedges. 10418 proven. 1639 refuted. 0 times theorem prover too weak. 15579 trivial. 0 not checked. [2025-01-10 01:21:32,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515523037] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:32,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:32,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 73 [2025-01-10 01:21:32,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912640568] [2025-01-10 01:21:32,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:32,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-01-10 01:21:32,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:32,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-01-10 01:21:32,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=2949, Unknown=0, NotChecked=0, Total=5256 [2025-01-10 01:21:32,688 INFO L87 Difference]: Start difference. First operand 2214 states and 2342 transitions. Second operand has 73 states, 73 states have (on average 6.698630136986301) internal successors, (489), 73 states have internal predecessors, (489), 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-01-10 01:21:34,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:34,218 INFO L93 Difference]: Finished difference Result 6573 states and 7236 transitions. [2025-01-10 01:21:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-01-10 01:21:34,219 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 6.698630136986301) internal successors, (489), 73 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 649 [2025-01-10 01:21:34,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:34,231 INFO L225 Difference]: With dead ends: 6573 [2025-01-10 01:21:34,231 INFO L226 Difference]: Without dead ends: 4518 [2025-01-10 01:21:34,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1345 GetRequests, 1251 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3480, Invalid=5640, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 01:21:34,236 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1784 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1784 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:34,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1784 Valid, 402 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 01:21:34,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2025-01-10 01:21:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 4518. [2025-01-10 01:21:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4518 states, 4516 states have (on average 1.0553587245349867) internal successors, (4766), 4517 states have internal predecessors, (4766), 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-01-10 01:21:34,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4518 states to 4518 states and 4766 transitions. [2025-01-10 01:21:34,422 INFO L78 Accepts]: Start accepts. Automaton has 4518 states and 4766 transitions. Word has length 649 [2025-01-10 01:21:34,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:34,423 INFO L471 AbstractCegarLoop]: Abstraction has 4518 states and 4766 transitions. [2025-01-10 01:21:34,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 6.698630136986301) internal successors, (489), 73 states have internal predecessors, (489), 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-01-10 01:21:34,423 INFO L276 IsEmpty]: Start isEmpty. Operand 4518 states and 4766 transitions. [2025-01-10 01:21:34,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1322 [2025-01-10 01:21:34,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:34,468 INFO L218 NwaCegarLoop]: trace histogram [185, 185, 185, 185, 184, 184, 184, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1] [2025-01-10 01:21:34,478 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-01-10 01:21:34,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:34,672 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 01:21:34,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:34,673 INFO L85 PathProgramCache]: Analyzing trace with hash -62122050, now seen corresponding path program 2 times [2025-01-10 01:21:34,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:34,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910904257] [2025-01-10 01:21:34,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:34,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:34,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1321 statements into 2 equivalence classes. [2025-01-10 01:21:34,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 1321 statements. [2025-01-10 01:21:34,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:21:34,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 119556 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 118626 trivial. 0 not checked. [2025-01-10 01:21:34,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:34,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910904257] [2025-01-10 01:21:34,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910904257] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:34,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462191546] [2025-01-10 01:21:34,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:34,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:34,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:34,800 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-01-10 01:21:34,801 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-01-10 01:21:35,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1321 statements into 2 equivalence classes. [2025-01-10 01:21:35,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 1321 statements. [2025-01-10 01:21:35,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:21:35,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:35,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:21:35,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 119556 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 118626 trivial. 0 not checked. [2025-01-10 01:21:36,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:37,450 INFO L134 CoverageAnalysis]: Checked inductivity of 119556 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 118626 trivial. 0 not checked. [2025-01-10 01:21:37,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462191546] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:37,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:37,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 01:21:37,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450623342] [2025-01-10 01:21:37,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:37,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:21:37,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:37,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:21:37,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:21:37,453 INFO L87 Difference]: Start difference. First operand 4518 states and 4766 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 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-01-10 01:21:37,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:37,691 INFO L93 Difference]: Finished difference Result 4545 states and 4793 transitions. [2025-01-10 01:21:37,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:21:37,692 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1321 [2025-01-10 01:21:37,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:37,708 INFO L225 Difference]: With dead ends: 4545 [2025-01-10 01:21:37,709 INFO L226 Difference]: Without dead ends: 4543 [2025-01-10 01:21:37,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2649 GetRequests, 2636 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:21:37,711 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 182 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:37,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 17 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:37,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4543 states. [2025-01-10 01:21:37,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4543 to 4092. [2025-01-10 01:21:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4092 states, 4090 states have (on average 1.0268948655256724) internal successors, (4200), 4091 states have internal predecessors, (4200), 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-01-10 01:21:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 4200 transitions. [2025-01-10 01:21:37,905 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 4200 transitions. Word has length 1321 [2025-01-10 01:21:37,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:37,907 INFO L471 AbstractCegarLoop]: Abstraction has 4092 states and 4200 transitions. [2025-01-10 01:21:37,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 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-01-10 01:21:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 4200 transitions. [2025-01-10 01:21:37,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1655 [2025-01-10 01:21:37,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:37,927 INFO L218 NwaCegarLoop]: trace histogram [232, 232, 232, 232, 231, 231, 231, 6, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1] [2025-01-10 01:21:37,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 01:21:38,131 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,SelfDestructingSolverStorable13 [2025-01-10 01:21:38,132 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-01-10 01:21:38,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:38,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1618607068, now seen corresponding path program 3 times [2025-01-10 01:21:38,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:38,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944263606] [2025-01-10 01:21:38,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:21:38,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:38,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1654 statements into 187 equivalence classes. [2025-01-10 01:21:38,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 1654 statements. [2025-01-10 01:21:38,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:21:38,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:38,282 INFO L134 CoverageAnalysis]: Checked inductivity of 188333 backedges. 0 proven. 62414 refuted. 0 times theorem prover too weak. 125919 trivial. 0 not checked. [2025-01-10 01:21:38,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:38,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944263606] [2025-01-10 01:21:38,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944263606] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:38,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452659899] [2025-01-10 01:21:38,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:21:38,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:38,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:38,286 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-01-10 01:21:38,288 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-01-10 01:21:38,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1654 statements into 187 equivalence classes. [2025-01-10 01:21:38,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 1654 statements. [2025-01-10 01:21:38,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:21:38,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:38,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:21:38,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 188333 backedges. 61490 proven. 924 refuted. 0 times theorem prover too weak. 125919 trivial. 0 not checked. [2025-01-10 01:21:40,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:42,146 INFO L134 CoverageAnalysis]: Checked inductivity of 188333 backedges. 0 proven. 62414 refuted. 0 times theorem prover too weak. 125919 trivial. 0 not checked. [2025-01-10 01:21:42,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452659899] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:42,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:42,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:21:42,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865091476] [2025-01-10 01:21:42,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:42,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:21:42,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:42,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:21:42,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:21:42,149 INFO L87 Difference]: Start difference. First operand 4092 states and 4200 transitions. Second operand has 13 states, 12 states have (on average 9.0) internal successors, (108), 13 states have internal predecessors, (108), 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-01-10 01:21:42,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:42,409 INFO L93 Difference]: Finished difference Result 4092 states and 4200 transitions. [2025-01-10 01:21:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:21:42,410 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.0) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1654 [2025-01-10 01:21:42,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:42,413 INFO L225 Difference]: With dead ends: 4092 [2025-01-10 01:21:42,413 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:21:42,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3317 GetRequests, 3300 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:21:42,419 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 78 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:42,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 10 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:42,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:21:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:21:42,420 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-01-10 01:21:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:21:42,421 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1654 [2025-01-10 01:21:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:42,421 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:21:42,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.0) internal successors, (108), 13 states have internal predecessors, (108), 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-01-10 01:21:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:21:42,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:21:42,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 20 remaining) [2025-01-10 01:21:42,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 20 remaining) [2025-01-10 01:21:42,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 20 remaining) [2025-01-10 01:21:42,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 20 remaining) [2025-01-10 01:21:42,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 20 remaining) [2025-01-10 01:21:42,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 20 remaining) [2025-01-10 01:21:42,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 20 remaining) [2025-01-10 01:21:42,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 20 remaining) [2025-01-10 01:21:42,426 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 20 remaining) [2025-01-10 01:21:42,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 20 remaining) [2025-01-10 01:21:42,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 20 remaining) [2025-01-10 01:21:42,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 20 remaining) [2025-01-10 01:21:42,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 20 remaining) [2025-01-10 01:21:42,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 20 remaining) [2025-01-10 01:21:42,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 20 remaining) [2025-01-10 01:21:42,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 20 remaining) [2025-01-10 01:21:42,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 20 remaining) [2025-01-10 01:21:42,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 20 remaining) [2025-01-10 01:21:42,427 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 20 remaining) [2025-01-10 01:21:42,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 20 remaining) [2025-01-10 01:21:42,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 01:21:42,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 01:21:42,631 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:42,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:21:55,542 WARN L286 SmtUtils]: Spent 12.90s on a formula simplification. DAG size of input: 956 DAG size of output: 527 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-10 01:22:10,161 WARN L286 SmtUtils]: Spent 14.59s on a formula simplification. DAG size of input: 707 DAG size of output: 433 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-10 01:22:13,973 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:22:13,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:22:13 BoogieIcfgContainer [2025-01-10 01:22:13,985 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:22:13,986 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:22:13,986 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:22:13,986 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:22:13,987 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:21:16" (3/4) ... [2025-01-10 01:22:13,990 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:22:14,000 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-10 01:22:14,001 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:22:14,001 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:22:14,001 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:22:14,084 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:22:14,084 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:22:14,084 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:22:14,085 INFO L158 Benchmark]: Toolchain (without parser) took 58514.31ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 111.7MB in the beginning and 519.3MB in the end (delta: -407.6MB). Peak memory consumption was 455.8MB. Max. memory is 16.1GB. [2025-01-10 01:22:14,085 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:22:14,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.84ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 100.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:22:14,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.12ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 99.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:22:14,086 INFO L158 Benchmark]: Boogie Preprocessor took 34.10ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 98.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:22:14,086 INFO L158 Benchmark]: RCFGBuilder took 289.37ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 83.9MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:22:14,087 INFO L158 Benchmark]: TraceAbstraction took 57881.30ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 83.5MB in the beginning and 527.3MB in the end (delta: -443.9MB). Peak memory consumption was 601.4MB. Max. memory is 16.1GB. [2025-01-10 01:22:14,087 INFO L158 Benchmark]: Witness Printer took 98.25ms. Allocated memory is still 1.0GB. Free memory was 527.3MB in the beginning and 519.3MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:22:14,088 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.24ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.84ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 100.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.12ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 99.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.10ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 98.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 289.37ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 83.9MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 57881.30ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 83.5MB in the beginning and 527.3MB in the end (delta: -443.9MB). Peak memory consumption was 601.4MB. Max. memory is 16.1GB. * Witness Printer took 98.25ms. Allocated memory is still 1.0GB. Free memory was 527.3MB in the beginning and 519.3MB in the end (delta: 8.1MB). 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: 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: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 55 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 26.5s, OverallIterations: 15, TraceHistogramMax: 232, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7515 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7515 mSDsluCounter, 1294 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1050 mSDsCounter, 695 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3062 IncrementalHoareTripleChecker+Invalid, 3757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 695 mSolverCounterUnsat, 244 mSDtfsCounter, 3062 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9201 GetRequests, 8880 SyntacticMatches, 0 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5918 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4518occurred in iteration=13, InterpolantAutomatonStates: 230, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 3076 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 9053 NumberOfCodeBlocks, 2007 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 13514 ConstructedInterpolants, 0 QuantifiedInterpolants, 47164 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2268 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 36 InterpolantComputations, 5 PerfectInterpolantSequences, 910290/1059467 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 20 specifications checked. All of them hold - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((i <= 999) && (0 <= j)) && (k == 0)) && (0 <= i)) && (j <= 999)) && (n == 1000)) || (((((((((((long long) i + j) + k) <= 2147483647) && (k <= 2147483643)) && (0 <= j)) && (0 <= i)) && (((long long) i + 1) <= n)) && (1 <= k)) && (j <= 999)) && (n == 1000))) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((0 <= j) && ((((long long) i + j) + n) <= 2147483648)) && (0 <= i)) && (((long long) i + 1) <= n)) && (n == 1000)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((long long) i + j) + k) <= 2147483647) && (k <= 2147483643)) && (i <= 999)) && (0 <= j)) && (0 <= i)) && (1 <= k)) && (j <= 999)) && (n == 1000)) || ((((((i <= 999) && (0 <= j)) && (k == 0)) && (0 <= i)) && (j <= 999)) && (n == 1000))) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((i <= 999) && (0 <= j)) && (((long long) i + j) <= 2147482648)) && (0 <= i)) && (n == 1000)) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((0 <= i) && (i <= 2147481649)) && (n == 1000)) - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (((0 <= i) && (i <= 2147481649)) && (n == 1000)) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:22:14,109 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