./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-multidimensional/rev-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/rev-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 fe3cf414f0e241a9a4e73e59647cf6619ea50b905df4a1c2a404b3413992b780 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:21:22,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:21:22,703 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:22,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:21:22,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:21:22,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:21:22,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:21:22,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:21:22,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:21:22,722 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:21:22,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:21:22,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:21:22,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:21:22,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:21:22,722 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:21:22,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:21:22,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:21:22,722 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:21:22,722 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:21:22,722 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:21:22,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:21:22,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:21:22,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:21:22,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:21:22,723 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:21:22,723 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:21:22,723 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:21:22,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:21:22,723 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:21:22,723 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:21:22,724 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:21:22,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:21:22,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:21:22,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:21:22,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:21:22,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:21:22,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:21:22,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:21:22,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:21:22,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:21:22,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:21:22,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:21:22,725 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:21:22,725 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:21:22,725 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:21:22,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:21:22,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:21:22,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:21:22,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:21:22,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:21:22,725 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 -> fe3cf414f0e241a9a4e73e59647cf6619ea50b905df4a1c2a404b3413992b780 [2025-01-10 01:21:22,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:21:22,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:21:22,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:21:22,962 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:21:22,963 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:21:22,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/rev-3-u.c [2025-01-10 01:21:24,164 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbdf5016d/9a0419a26e404b9783915a02e6257902/FLAG715051b70 [2025-01-10 01:21:24,389 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:21:24,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-3-u.c [2025-01-10 01:21:24,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbdf5016d/9a0419a26e404b9783915a02e6257902/FLAG715051b70 [2025-01-10 01:21:24,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbdf5016d/9a0419a26e404b9783915a02e6257902 [2025-01-10 01:21:24,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:21:24,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:21:24,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:21:24,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:21:24,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:21:24,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:21:24" (1/1) ... [2025-01-10 01:21:24,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ae5a301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:24, skipping insertion in model container [2025-01-10 01:21:24,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:21:24" (1/1) ... [2025-01-10 01:21:24,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:21:24,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:21:24,573 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:21:24,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:21:24,597 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:21:24,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:24 WrapperNode [2025-01-10 01:21:24,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:21:24,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:21:24,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:21:24,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:21:24,603 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:24" (1/1) ... [2025-01-10 01:21:24,606 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:24" (1/1) ... [2025-01-10 01:21:24,623 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 122 [2025-01-10 01:21:24,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:21:24,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:21:24,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:21:24,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:21:24,632 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:24" (1/1) ... [2025-01-10 01:21:24,632 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:24" (1/1) ... [2025-01-10 01:21:24,634 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:24" (1/1) ... [2025-01-10 01:21:24,641 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-01-10 01:21:24,641 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:24" (1/1) ... [2025-01-10 01:21:24,641 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:24" (1/1) ... [2025-01-10 01:21:24,647 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:24" (1/1) ... [2025-01-10 01:21:24,648 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:24" (1/1) ... [2025-01-10 01:21:24,653 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:24" (1/1) ... [2025-01-10 01:21:24,654 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:24" (1/1) ... [2025-01-10 01:21:24,655 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:24" (1/1) ... [2025-01-10 01:21:24,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:21:24,657 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:21:24,657 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:21:24,657 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:21:24,658 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:24" (1/1) ... [2025-01-10 01:21:24,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:21:24,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:24,688 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:24,691 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:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:21:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:21:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:21:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 01:21:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:21:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:21:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:21:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 01:21:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:21:24,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:21:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:21:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:21:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 01:21:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:21:24,767 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:21:24,769 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:21:25,025 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-01-10 01:21:25,025 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:21:25,035 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:21:25,036 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:21:25,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:21:25 BoogieIcfgContainer [2025-01-10 01:21:25,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:21:25,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:21:25,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:21:25,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:21:25,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:21:24" (1/3) ... [2025-01-10 01:21:25,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6585a1a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:21:25, skipping insertion in model container [2025-01-10 01:21:25,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:24" (2/3) ... [2025-01-10 01:21:25,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6585a1a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:21:25, skipping insertion in model container [2025-01-10 01:21:25,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:21:25" (3/3) ... [2025-01-10 01:21:25,044 INFO L128 eAbstractionObserver]: Analyzing ICFG rev-3-u.c [2025-01-10 01:21:25,056 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:21:25,057 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rev-3-u.c that has 1 procedures, 102 locations, 1 initial locations, 9 loop locations, and 42 error locations. [2025-01-10 01:21:25,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:21:25,109 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;@667cc39b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:21:25,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-01-10 01:21:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 59 states have (on average 1.88135593220339) internal successors, (111), 101 states have internal predecessors, (111), 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,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 01:21:25,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:25,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:21:25,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:21:25,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:25,118 INFO L85 PathProgramCache]: Analyzing trace with hash 28695332, now seen corresponding path program 1 times [2025-01-10 01:21:25,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:25,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606911808] [2025-01-10 01:21:25,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:25,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:25,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:21:25,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:21:25,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:25,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:25,302 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:25,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:25,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606911808] [2025-01-10 01:21:25,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606911808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:25,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:25,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:21:25,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221647983] [2025-01-10 01:21:25,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:25,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:21:25,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:25,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:21:25,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:21:25,321 INFO L87 Difference]: Start difference. First operand has 102 states, 59 states have (on average 1.88135593220339) internal successors, (111), 101 states have internal predecessors, (111), 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:25,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:25,576 INFO L93 Difference]: Finished difference Result 252 states and 307 transitions. [2025-01-10 01:21:25,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:21:25,580 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:25,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:25,586 INFO L225 Difference]: With dead ends: 252 [2025-01-10 01:21:25,587 INFO L226 Difference]: Without dead ends: 147 [2025-01-10 01:21:25,589 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:25,590 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 131 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:25,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 68 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:21:25,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-10 01:21:25,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 141. [2025-01-10 01:21:25,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 99 states have (on average 1.797979797979798) internal successors, (178), 140 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,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 178 transitions. [2025-01-10 01:21:25,618 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 178 transitions. Word has length 5 [2025-01-10 01:21:25,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:25,619 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 178 transitions. [2025-01-10 01:21:25,619 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:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 178 transitions. [2025-01-10 01:21:25,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 01:21:25,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:25,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 01:21:25,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:21:25,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:21:25,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:25,620 INFO L85 PathProgramCache]: Analyzing trace with hash 889539528, now seen corresponding path program 1 times [2025-01-10 01:21:25,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:25,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869502725] [2025-01-10 01:21:25,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:25,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:25,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:21:25,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:21:25,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:25,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:25,668 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:25,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:25,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869502725] [2025-01-10 01:21:25,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869502725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:25,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:25,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:21:25,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812994035] [2025-01-10 01:21:25,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:25,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:21:25,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:25,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:21:25,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:21:25,671 INFO L87 Difference]: Start difference. First operand 141 states and 178 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:25,770 INFO L93 Difference]: Finished difference Result 233 states and 310 transitions. [2025-01-10 01:21:25,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:21:25,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 01:21:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:25,773 INFO L225 Difference]: With dead ends: 233 [2025-01-10 01:21:25,773 INFO L226 Difference]: Without dead ends: 227 [2025-01-10 01:21:25,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:21:25,774 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 47 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:25,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 145 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:25,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-01-10 01:21:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 211. [2025-01-10 01:21:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 169 states have (on average 1.7633136094674555) internal successors, (298), 210 states have internal predecessors, (298), 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,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 298 transitions. [2025-01-10 01:21:25,784 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 298 transitions. Word has length 6 [2025-01-10 01:21:25,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:25,784 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 298 transitions. [2025-01-10 01:21:25,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:25,784 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 298 transitions. [2025-01-10 01:21:25,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:21:25,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:25,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:25,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:21:25,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:21:25,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:25,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1830733634, now seen corresponding path program 1 times [2025-01-10 01:21:25,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:25,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436608490] [2025-01-10 01:21:25,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:25,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:25,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:21:25,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:21:25,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:25,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:25,855 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:25,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:25,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436608490] [2025-01-10 01:21:25,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436608490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:25,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:25,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:21:25,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176651531] [2025-01-10 01:21:25,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:25,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:21:25,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:25,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:21:25,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:21:25,856 INFO L87 Difference]: Start difference. First operand 211 states and 298 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:25,953 INFO L93 Difference]: Finished difference Result 420 states and 594 transitions. [2025-01-10 01:21:25,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:21:25,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:21:25,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:25,955 INFO L225 Difference]: With dead ends: 420 [2025-01-10 01:21:25,955 INFO L226 Difference]: Without dead ends: 236 [2025-01-10 01:21:25,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:21:25,956 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:25,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-01-10 01:21:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232. [2025-01-10 01:21:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 190 states have (on average 1.736842105263158) internal successors, (330), 231 states have internal predecessors, (330), 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,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 330 transitions. [2025-01-10 01:21:25,975 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 330 transitions. Word has length 7 [2025-01-10 01:21:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:25,975 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 330 transitions. [2025-01-10 01:21:25,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 330 transitions. [2025-01-10 01:21:25,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:21:25,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:25,976 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:25,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:21:25,976 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:21:25,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:25,976 INFO L85 PathProgramCache]: Analyzing trace with hash 323909866, now seen corresponding path program 1 times [2025-01-10 01:21:25,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:25,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886212306] [2025-01-10 01:21:25,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:25,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:25,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:21:25,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:21:25,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:25,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:26,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:21:26,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:26,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886212306] [2025-01-10 01:21:26,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886212306] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:26,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484280686] [2025-01-10 01:21:26,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:26,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:26,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:26,051 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:26,052 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:26,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:21:26,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:21:26,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:26,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:26,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:21:26,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:21:26,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:21:26,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484280686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:26,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:21:26,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 01:21:26,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990466124] [2025-01-10 01:21:26,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:26,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:21:26,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:26,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:21:26,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:21:26,128 INFO L87 Difference]: Start difference. First operand 232 states and 330 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:26,215 INFO L93 Difference]: Finished difference Result 248 states and 330 transitions. [2025-01-10 01:21:26,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:21:26,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-01-10 01:21:26,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:26,217 INFO L225 Difference]: With dead ends: 248 [2025-01-10 01:21:26,217 INFO L226 Difference]: Without dead ends: 245 [2025-01-10 01:21:26,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:21:26,218 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 93 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:26,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 173 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:26,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-01-10 01:21:26,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 229. [2025-01-10 01:21:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 190 states have (on average 1.694736842105263) internal successors, (322), 228 states have internal predecessors, (322), 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,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 322 transitions. [2025-01-10 01:21:26,228 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 322 transitions. Word has length 9 [2025-01-10 01:21:26,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:26,228 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 322 transitions. [2025-01-10 01:21:26,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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,229 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 322 transitions. [2025-01-10 01:21:26,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:21:26,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:26,229 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:26,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:21:26,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:26,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:21:26,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:26,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1628762364, now seen corresponding path program 1 times [2025-01-10 01:21:26,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:26,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123652255] [2025-01-10 01:21:26,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:26,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:26,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:21:26,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:21:26,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:26,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:26,469 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:26,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:26,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123652255] [2025-01-10 01:21:26,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123652255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:26,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:26,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:21:26,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054581081] [2025-01-10 01:21:26,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:26,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:21:26,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:26,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:21:26,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:21:26,471 INFO L87 Difference]: Start difference. First operand 229 states and 322 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:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:26,591 INFO L93 Difference]: Finished difference Result 448 states and 631 transitions. [2025-01-10 01:21:26,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:21:26,591 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:26,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:26,592 INFO L225 Difference]: With dead ends: 448 [2025-01-10 01:21:26,592 INFO L226 Difference]: Without dead ends: 229 [2025-01-10 01:21:26,593 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:26,593 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 141 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:26,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 58 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:26,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-01-10 01:21:26,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2025-01-10 01:21:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 190 states have (on average 1.6105263157894736) internal successors, (306), 228 states have internal predecessors, (306), 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,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 306 transitions. [2025-01-10 01:21:26,613 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 306 transitions. Word has length 10 [2025-01-10 01:21:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:26,613 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 306 transitions. [2025-01-10 01:21:26,613 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:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 306 transitions. [2025-01-10 01:21:26,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 01:21:26,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:26,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:26,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:21:26,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:21:26,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:26,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1451271302, now seen corresponding path program 1 times [2025-01-10 01:21:26,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:26,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646368053] [2025-01-10 01:21:26,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:26,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:26,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:21:26,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:21:26,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:26,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:21:26,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:26,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646368053] [2025-01-10 01:21:26,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646368053] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:26,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81977405] [2025-01-10 01:21:26,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:26,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:26,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:26,675 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:26,676 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:26,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:21:26,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:21:26,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:26,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:26,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:21:26,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:21:26,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:21:26,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81977405] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:26,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:26,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 01:21:26,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253119532] [2025-01-10 01:21:26,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:26,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:21:26,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:26,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:21:26,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:21:26,768 INFO L87 Difference]: Start difference. First operand 229 states and 306 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:26,928 INFO L93 Difference]: Finished difference Result 524 states and 714 transitions. [2025-01-10 01:21:26,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:21:26,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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:26,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:26,930 INFO L225 Difference]: With dead ends: 524 [2025-01-10 01:21:26,930 INFO L226 Difference]: Without dead ends: 521 [2025-01-10 01:21:26,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:21:26,931 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 184 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:26,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 414 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:26,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-01-10 01:21:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 457. [2025-01-10 01:21:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 418 states have (on average 1.6507177033492824) internal successors, (690), 456 states have internal predecessors, (690), 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,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 690 transitions. [2025-01-10 01:21:26,953 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 690 transitions. Word has length 10 [2025-01-10 01:21:26,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:26,953 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 690 transitions. [2025-01-10 01:21:26,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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,953 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 690 transitions. [2025-01-10 01:21:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:21:26,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:26,954 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:26,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:21:27,158 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:27,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:21:27,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:27,158 INFO L85 PathProgramCache]: Analyzing trace with hash 302201172, now seen corresponding path program 1 times [2025-01-10 01:21:27,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:27,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587785001] [2025-01-10 01:21:27,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:27,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:27,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:21:27,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:21:27,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:27,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:27,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:21:27,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:27,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587785001] [2025-01-10 01:21:27,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587785001] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:27,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480623735] [2025-01-10 01:21:27,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:27,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:27,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:27,219 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:27,221 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:27,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:21:27,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:21:27,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:27,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:27,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:21:27,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:21:27,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:27,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:21:27,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480623735] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:27,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:27,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2025-01-10 01:21:27,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258918674] [2025-01-10 01:21:27,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:27,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:21:27,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:27,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:21:27,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:21:27,321 INFO L87 Difference]: Start difference. First operand 457 states and 690 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:27,890 INFO L93 Difference]: Finished difference Result 903 states and 1356 transitions. [2025-01-10 01:21:27,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:21:27,890 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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:27,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:27,892 INFO L225 Difference]: With dead ends: 903 [2025-01-10 01:21:27,892 INFO L226 Difference]: Without dead ends: 465 [2025-01-10 01:21:27,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:21:27,894 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1079 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:27,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 102 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 01:21:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-01-10 01:21:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 450. [2025-01-10 01:21:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 418 states have (on average 1.507177033492823) internal successors, (630), 449 states have internal predecessors, (630), 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,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 630 transitions. [2025-01-10 01:21:27,908 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 630 transitions. Word has length 16 [2025-01-10 01:21:27,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:27,908 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 630 transitions. [2025-01-10 01:21:27,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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,909 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 630 transitions. [2025-01-10 01:21:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 01:21:27,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:27,910 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1] [2025-01-10 01:21:27,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:21:28,112 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:28,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:21:28,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:28,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1132545000, now seen corresponding path program 2 times [2025-01-10 01:21:28,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:28,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669283523] [2025-01-10 01:21:28,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:28,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:28,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-10 01:21:28,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-01-10 01:21:28,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:21:28,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:28,149 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:21:28,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:28,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669283523] [2025-01-10 01:21:28,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669283523] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:28,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322109323] [2025-01-10 01:21:28,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:28,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:28,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:28,154 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:28,155 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:28,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-10 01:21:28,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-01-10 01:21:28,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:21:28,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:28,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:21:28,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:21:28,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:21:28,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322109323] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:28,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:28,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:21:28,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830524371] [2025-01-10 01:21:28,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:28,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:21:28,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:28,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:21:28,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:21:28,268 INFO L87 Difference]: Start difference. First operand 450 states and 630 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:28,355 INFO L93 Difference]: Finished difference Result 450 states and 630 transitions. [2025-01-10 01:21:28,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:21:28,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-10 01:21:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:28,357 INFO L225 Difference]: With dead ends: 450 [2025-01-10 01:21:28,357 INFO L226 Difference]: Without dead ends: 447 [2025-01-10 01:21:28,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:21:28,358 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 180 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:28,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 72 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:28,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-01-10 01:21:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 379. [2025-01-10 01:21:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 350 states have (on average 1.48) internal successors, (518), 378 states have internal predecessors, (518), 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:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 518 transitions. [2025-01-10 01:21:28,370 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 518 transitions. Word has length 19 [2025-01-10 01:21:28,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:28,371 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 518 transitions. [2025-01-10 01:21:28,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 518 transitions. [2025-01-10 01:21:28,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 01:21:28,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:28,371 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:28,377 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:28,576 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:28,576 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:21:28,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:28,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1234768312, now seen corresponding path program 1 times [2025-01-10 01:21:28,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:28,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538600688] [2025-01-10 01:21:28,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:28,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:28,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:21:28,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:21:28,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:28,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:21:28,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:28,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538600688] [2025-01-10 01:21:28,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538600688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:28,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:28,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:21:28,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576146111] [2025-01-10 01:21:28,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:28,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:21:28,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:28,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:21:28,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:21:28,630 INFO L87 Difference]: Start difference. First operand 379 states and 518 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:28,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:28,758 INFO L93 Difference]: Finished difference Result 824 states and 1178 transitions. [2025-01-10 01:21:28,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:21:28,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-10 01:21:28,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:28,761 INFO L225 Difference]: With dead ends: 824 [2025-01-10 01:21:28,761 INFO L226 Difference]: Without dead ends: 660 [2025-01-10 01:21:28,762 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:28,762 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 162 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:28,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 43 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-10 01:21:28,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 657. [2025-01-10 01:21:28,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 628 states have (on average 1.4585987261146496) internal successors, (916), 656 states have internal predecessors, (916), 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:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 916 transitions. [2025-01-10 01:21:28,780 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 916 transitions. Word has length 27 [2025-01-10 01:21:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:28,780 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 916 transitions. [2025-01-10 01:21:28,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:28,780 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 916 transitions. [2025-01-10 01:21:28,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 01:21:28,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:28,780 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:28,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:21:28,780 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:21:28,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:28,781 INFO L85 PathProgramCache]: Analyzing trace with hash -376887914, now seen corresponding path program 1 times [2025-01-10 01:21:28,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:28,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481664042] [2025-01-10 01:21:28,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:28,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:28,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:21:28,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:21:28,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:28,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:21:28,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:28,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481664042] [2025-01-10 01:21:28,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481664042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:28,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:28,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:21:28,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885321817] [2025-01-10 01:21:28,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:28,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:21:28,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:28,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:21:28,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:21:28,849 INFO L87 Difference]: Start difference. First operand 657 states and 916 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:28,977 INFO L93 Difference]: Finished difference Result 664 states and 916 transitions. [2025-01-10 01:21:28,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:21:28,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-10 01:21:28,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:28,979 INFO L225 Difference]: With dead ends: 664 [2025-01-10 01:21:28,979 INFO L226 Difference]: Without dead ends: 660 [2025-01-10 01:21:28,979 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:28,980 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 114 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:28,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 44 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:28,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-10 01:21:28,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 657. [2025-01-10 01:21:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 628 states have (on average 1.4076433121019107) internal successors, (884), 656 states have internal predecessors, (884), 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:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 884 transitions. [2025-01-10 01:21:28,996 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 884 transitions. Word has length 28 [2025-01-10 01:21:28,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:28,997 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 884 transitions. [2025-01-10 01:21:28,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 884 transitions. [2025-01-10 01:21:28,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 01:21:28,999 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:28,999 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:28,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:21:29,000 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:21:29,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:29,000 INFO L85 PathProgramCache]: Analyzing trace with hash 248907418, now seen corresponding path program 1 times [2025-01-10 01:21:29,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:29,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162527858] [2025-01-10 01:21:29,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:29,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:29,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 01:21:29,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 01:21:29,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:29,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:29,051 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:21:29,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:29,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162527858] [2025-01-10 01:21:29,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162527858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:29,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:29,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:21:29,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613256734] [2025-01-10 01:21:29,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:29,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:21:29,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:29,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:21:29,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:21:29,052 INFO L87 Difference]: Start difference. First operand 657 states and 884 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:29,175 INFO L93 Difference]: Finished difference Result 661 states and 884 transitions. [2025-01-10 01:21:29,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:21:29,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-01-10 01:21:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:29,178 INFO L225 Difference]: With dead ends: 661 [2025-01-10 01:21:29,178 INFO L226 Difference]: Without dead ends: 657 [2025-01-10 01:21:29,178 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:29,178 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 95 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:29,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 47 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:29,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-01-10 01:21:29,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2025-01-10 01:21:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 628 states have (on average 1.356687898089172) internal successors, (852), 656 states have internal predecessors, (852), 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:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 852 transitions. [2025-01-10 01:21:29,194 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 852 transitions. Word has length 32 [2025-01-10 01:21:29,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:29,194 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 852 transitions. [2025-01-10 01:21:29,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 852 transitions. [2025-01-10 01:21:29,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-10 01:21:29,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:29,194 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:21:29,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:21:29,195 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:21:29,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:29,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1096526266, now seen corresponding path program 1 times [2025-01-10 01:21:29,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:29,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009318785] [2025-01-10 01:21:29,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:29,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:29,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:21:29,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:21:29,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:29,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-10 01:21:29,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:29,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009318785] [2025-01-10 01:21:29,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009318785] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:29,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621865493] [2025-01-10 01:21:29,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:29,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:29,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:29,251 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:29,252 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:29,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:21:29,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:21:29,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:29,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:29,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:21:29,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:21:29,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:21:29,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621865493] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:29,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:29,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 8, 8] total 16 [2025-01-10 01:21:29,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423297034] [2025-01-10 01:21:29,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:29,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:21:29,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:29,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:21:29,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:21:29,443 INFO L87 Difference]: Start difference. First operand 657 states and 852 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 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:30,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:30,438 INFO L93 Difference]: Finished difference Result 2885 states and 3984 transitions. [2025-01-10 01:21:30,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-10 01:21:30,439 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-01-10 01:21:30,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:30,445 INFO L225 Difference]: With dead ends: 2885 [2025-01-10 01:21:30,445 INFO L226 Difference]: Without dead ends: 2245 [2025-01-10 01:21:30,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2025-01-10 01:21:30,447 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4572 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4572 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:30,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4572 Valid, 87 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 01:21:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2025-01-10 01:21:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2221. [2025-01-10 01:21:30,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2221 states, 2192 states have (on average 1.3458029197080292) internal successors, (2950), 2220 states have internal predecessors, (2950), 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:30,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 2950 transitions. [2025-01-10 01:21:30,490 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 2950 transitions. Word has length 35 [2025-01-10 01:21:30,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:30,490 INFO L471 AbstractCegarLoop]: Abstraction has 2221 states and 2950 transitions. [2025-01-10 01:21:30,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 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:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 2950 transitions. [2025-01-10 01:21:30,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-10 01:21:30,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:30,491 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:30,500 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:30,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 01:21:30,692 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:21:30,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:30,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1426949614, now seen corresponding path program 1 times [2025-01-10 01:21:30,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:30,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692383039] [2025-01-10 01:21:30,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:30,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:30,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-10 01:21:30,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-10 01:21:30,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:30,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2025-01-10 01:21:30,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:30,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692383039] [2025-01-10 01:21:30,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692383039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:30,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:30,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:21:30,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433529686] [2025-01-10 01:21:30,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:30,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:21:30,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:30,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:21:30,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:21:30,829 INFO L87 Difference]: Start difference. First operand 2221 states and 2950 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:30,954 INFO L93 Difference]: Finished difference Result 2225 states and 2950 transitions. [2025-01-10 01:21:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:21:30,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 88 [2025-01-10 01:21:30,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:30,961 INFO L225 Difference]: With dead ends: 2225 [2025-01-10 01:21:30,961 INFO L226 Difference]: Without dead ends: 2221 [2025-01-10 01:21:30,961 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:30,962 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 100 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:30,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 49 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2025-01-10 01:21:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 2221. [2025-01-10 01:21:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2221 states, 2192 states have (on average 1.3348540145985401) internal successors, (2926), 2220 states have internal predecessors, (2926), 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:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 2926 transitions. [2025-01-10 01:21:31,007 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 2926 transitions. Word has length 88 [2025-01-10 01:21:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:31,008 INFO L471 AbstractCegarLoop]: Abstraction has 2221 states and 2926 transitions. [2025-01-10 01:21:31,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 2926 transitions. [2025-01-10 01:21:31,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 01:21:31,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:31,009 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:31,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:21:31,010 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:21:31,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:31,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1359855742, now seen corresponding path program 1 times [2025-01-10 01:21:31,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:31,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406373423] [2025-01-10 01:21:31,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:31,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:31,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 01:21:31,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 01:21:31,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:31,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:31,345 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 324 proven. 145 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-01-10 01:21:31,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:31,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406373423] [2025-01-10 01:21:31,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406373423] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:31,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229845166] [2025-01-10 01:21:31,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:31,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:31,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:31,348 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:31,349 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:31,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 01:21:31,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 01:21:31,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:31,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:31,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 01:21:31,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 324 proven. 145 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-01-10 01:21:31,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 324 proven. 145 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-01-10 01:21:31,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229845166] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:31,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:31,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2025-01-10 01:21:31,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841401213] [2025-01-10 01:21:31,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:31,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-10 01:21:31,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:31,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-10 01:21:31,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2025-01-10 01:21:31,835 INFO L87 Difference]: Start difference. First operand 2221 states and 2926 transitions. Second operand has 37 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 37 states have internal predecessors, (130), 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:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:32,985 INFO L93 Difference]: Finished difference Result 6927 states and 9416 transitions. [2025-01-10 01:21:32,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-10 01:21:32,987 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 37 states have internal predecessors, (130), 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 103 [2025-01-10 01:21:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:32,999 INFO L225 Difference]: With dead ends: 6927 [2025-01-10 01:21:32,999 INFO L226 Difference]: Without dead ends: 4741 [2025-01-10 01:21:33,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=876, Invalid=1380, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 01:21:33,003 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 3336 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3336 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:33,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3336 Valid, 144 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 01:21:33,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4741 states. [2025-01-10 01:21:33,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4741 to 4741. [2025-01-10 01:21:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4741 states, 4712 states have (on average 1.3391341256366722) internal successors, (6310), 4740 states have internal predecessors, (6310), 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:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4741 states to 4741 states and 6310 transitions. [2025-01-10 01:21:33,104 INFO L78 Accepts]: Start accepts. Automaton has 4741 states and 6310 transitions. Word has length 103 [2025-01-10 01:21:33,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:33,104 INFO L471 AbstractCegarLoop]: Abstraction has 4741 states and 6310 transitions. [2025-01-10 01:21:33,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 37 states have internal predecessors, (130), 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:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 4741 states and 6310 transitions. [2025-01-10 01:21:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-10 01:21:33,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:33,106 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:33,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:21:33,306 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,SelfDestructingSolverStorable13 [2025-01-10 01:21:33,306 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:21:33,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:33,307 INFO L85 PathProgramCache]: Analyzing trace with hash -253021826, now seen corresponding path program 2 times [2025-01-10 01:21:33,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:33,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443243452] [2025-01-10 01:21:33,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:33,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:33,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 175 statements into 2 equivalence classes. [2025-01-10 01:21:33,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 175 of 175 statements. [2025-01-10 01:21:33,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:21:33,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2944 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2943 trivial. 0 not checked. [2025-01-10 01:21:33,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:33,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443243452] [2025-01-10 01:21:33,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443243452] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:33,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894732020] [2025-01-10 01:21:33,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:33,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:33,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:33,525 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:33,527 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:33,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 175 statements into 2 equivalence classes. [2025-01-10 01:21:33,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 175 of 175 statements. [2025-01-10 01:21:33,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:21:33,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:33,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 01:21:33,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2944 backedges. 1500 proven. 715 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2025-01-10 01:21:34,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2944 backedges. 1500 proven. 715 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2025-01-10 01:21:34,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894732020] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:34,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:34,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 26, 26] total 52 [2025-01-10 01:21:34,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816159336] [2025-01-10 01:21:34,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:34,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-01-10 01:21:34,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:34,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-01-10 01:21:34,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1186, Invalid=1466, Unknown=0, NotChecked=0, Total=2652 [2025-01-10 01:21:34,617 INFO L87 Difference]: Start difference. First operand 4741 states and 6310 transitions. Second operand has 52 states, 52 states have (on average 3.519230769230769) internal successors, (183), 52 states have internal predecessors, (183), 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,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:42,611 INFO L93 Difference]: Finished difference Result 19332 states and 27058 transitions. [2025-01-10 01:21:42,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2025-01-10 01:21:42,611 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.519230769230769) internal successors, (183), 52 states have internal predecessors, (183), 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 175 [2025-01-10 01:21:42,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:42,651 INFO L225 Difference]: With dead ends: 19332 [2025-01-10 01:21:42,651 INFO L226 Difference]: Without dead ends: 14662 [2025-01-10 01:21:42,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9132 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=9863, Invalid=18193, Unknown=0, NotChecked=0, Total=28056 [2025-01-10 01:21:42,663 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 20500 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 1961 mSolverCounterSat, 1269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20500 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 3230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1269 IncrementalHoareTripleChecker+Valid, 1961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:42,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20500 Valid, 178 Invalid, 3230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1269 Valid, 1961 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-10 01:21:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14662 states. [2025-01-10 01:21:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14662 to 14224. [2025-01-10 01:21:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14224 states, 14195 states have (on average 1.3508277562522015) internal successors, (19175), 14223 states have internal predecessors, (19175), 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,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14224 states to 14224 states and 19175 transitions. [2025-01-10 01:21:42,927 INFO L78 Accepts]: Start accepts. Automaton has 14224 states and 19175 transitions. Word has length 175 [2025-01-10 01:21:42,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:42,928 INFO L471 AbstractCegarLoop]: Abstraction has 14224 states and 19175 transitions. [2025-01-10 01:21:42,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.519230769230769) internal successors, (183), 52 states have internal predecessors, (183), 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,928 INFO L276 IsEmpty]: Start isEmpty. Operand 14224 states and 19175 transitions. [2025-01-10 01:21:42,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-01-10 01:21:42,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:42,931 INFO L218 NwaCegarLoop]: trace histogram [138, 138, 138, 3, 3, 3, 2, 1, 1, 1, 1] [2025-01-10 01:21:42,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:21:43,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:43,135 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:21:43,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:43,136 INFO L85 PathProgramCache]: Analyzing trace with hash 901707270, now seen corresponding path program 2 times [2025-01-10 01:21:43,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:43,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089626201] [2025-01-10 01:21:43,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:43,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:43,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 429 statements into 2 equivalence classes. [2025-01-10 01:21:43,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 429 statements. [2025-01-10 01:21:43,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:21:43,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:43,212 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2025-01-10 01:21:43,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:43,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089626201] [2025-01-10 01:21:43,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089626201] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290801954] [2025-01-10 01:21:43,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:43,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:43,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:43,216 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:43,217 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:43,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 429 statements into 2 equivalence classes. [2025-01-10 01:21:43,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 429 statements. [2025-01-10 01:21:43,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:21:43,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:43,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:21:43,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2025-01-10 01:21:43,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2025-01-10 01:21:44,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290801954] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:44,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:44,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-10 01:21:44,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179750618] [2025-01-10 01:21:44,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:44,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:21:44,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:44,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:21:44,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:21:44,034 INFO L87 Difference]: Start difference. First operand 14224 states and 19175 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:44,232 INFO L93 Difference]: Finished difference Result 14224 states and 19175 transitions. [2025-01-10 01:21:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:21:44,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 429 [2025-01-10 01:21:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:44,259 INFO L225 Difference]: With dead ends: 14224 [2025-01-10 01:21:44,259 INFO L226 Difference]: Without dead ends: 14221 [2025-01-10 01:21:44,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:21:44,264 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 111 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:44,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 52 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14221 states. [2025-01-10 01:21:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14221 to 13927. [2025-01-10 01:21:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13927 states, 13901 states have (on average 1.3575282353787497) internal successors, (18871), 13926 states have internal predecessors, (18871), 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:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13927 states to 13927 states and 18871 transitions. [2025-01-10 01:21:44,481 INFO L78 Accepts]: Start accepts. Automaton has 13927 states and 18871 transitions. Word has length 429 [2025-01-10 01:21:44,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:44,481 INFO L471 AbstractCegarLoop]: Abstraction has 13927 states and 18871 transitions. [2025-01-10 01:21:44,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:44,482 INFO L276 IsEmpty]: Start isEmpty. Operand 13927 states and 18871 transitions. [2025-01-10 01:21:44,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-01-10 01:21:44,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:44,487 INFO L218 NwaCegarLoop]: trace histogram [184, 184, 184, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 01:21:44,493 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:44,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 01:21:44,691 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:21:44,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:44,692 INFO L85 PathProgramCache]: Analyzing trace with hash 656043966, now seen corresponding path program 1 times [2025-01-10 01:21:44,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:44,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543387873] [2025-01-10 01:21:44,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:44,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:44,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-01-10 01:21:44,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-01-10 01:21:44,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:44,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 51279 backedges. 0 proven. 25783 refuted. 0 times theorem prover too weak. 25496 trivial. 0 not checked. [2025-01-10 01:21:45,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:45,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543387873] [2025-01-10 01:21:45,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543387873] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:45,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790060768] [2025-01-10 01:21:45,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:45,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:45,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:45,295 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:45,297 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:45,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-01-10 01:21:45,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-01-10 01:21:45,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:45,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:45,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 2124 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-10 01:21:45,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:46,878 INFO L134 CoverageAnalysis]: Checked inductivity of 51279 backedges. 19329 proven. 3151 refuted. 0 times theorem prover too weak. 28799 trivial. 0 not checked. [2025-01-10 01:21:46,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 51279 backedges. 19329 proven. 3151 refuted. 0 times theorem prover too weak. 28799 trivial. 0 not checked. [2025-01-10 01:21:48,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790060768] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:48,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:48,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 50, 50] total 100 [2025-01-10 01:21:48,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452084534] [2025-01-10 01:21:48,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:48,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2025-01-10 01:21:48,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:48,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2025-01-10 01:21:48,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4663, Invalid=5237, Unknown=0, NotChecked=0, Total=9900 [2025-01-10 01:21:48,667 INFO L87 Difference]: Start difference. First operand 13927 states and 18871 transitions. Second operand has 100 states, 100 states have (on average 3.19) internal successors, (319), 100 states have internal predecessors, (319), 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:22:13,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:22:13,857 INFO L93 Difference]: Finished difference Result 42120 states and 58238 transitions. [2025-01-10 01:22:13,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2025-01-10 01:22:13,858 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 100 states have (on average 3.19) internal successors, (319), 100 states have internal predecessors, (319), 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 577 [2025-01-10 01:22:13,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:22:13,903 INFO L225 Difference]: With dead ends: 42120 [2025-01-10 01:22:13,904 INFO L226 Difference]: Without dead ends: 28336 [2025-01-10 01:22:13,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1345 GetRequests, 1057 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22278 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=23473, Invalid=60337, Unknown=0, NotChecked=0, Total=83810 [2025-01-10 01:22:13,920 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 32112 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 6770 mSolverCounterSat, 1573 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32112 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 8343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1573 IncrementalHoareTripleChecker+Valid, 6770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-01-10 01:22:13,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32112 Valid, 462 Invalid, 8343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1573 Valid, 6770 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-01-10 01:22:13,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28336 states. [2025-01-10 01:22:14,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28336 to 28324. [2025-01-10 01:22:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28324 states, 28301 states have (on average 1.3586799053036995) internal successors, (38452), 28323 states have internal predecessors, (38452), 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:22:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28324 states to 28324 states and 38452 transitions. [2025-01-10 01:22:14,298 INFO L78 Accepts]: Start accepts. Automaton has 28324 states and 38452 transitions. Word has length 577 [2025-01-10 01:22:14,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:22:14,300 INFO L471 AbstractCegarLoop]: Abstraction has 28324 states and 38452 transitions. [2025-01-10 01:22:14,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 3.19) internal successors, (319), 100 states have internal predecessors, (319), 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:22:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 28324 states and 38452 transitions. [2025-01-10 01:22:14,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1155 [2025-01-10 01:22:14,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:22:14,322 INFO L218 NwaCegarLoop]: trace histogram [376, 376, 376, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 01:22:14,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:22:14,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:14,526 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-01-10 01:22:14,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:22:14,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1047607234, now seen corresponding path program 1 times [2025-01-10 01:22:14,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:22:14,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202747430] [2025-01-10 01:22:14,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:14,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:22:14,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1154 statements into 1 equivalence classes. [2025-01-10 01:22:14,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1154 of 1154 statements. [2025-01-10 01:22:14,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:14,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 213040 backedges. 0 proven. 106808 refuted. 0 times theorem prover too weak. 106232 trivial. 0 not checked. [2025-01-10 01:22:15,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:22:15,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202747430] [2025-01-10 01:22:15,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202747430] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:22:15,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986536502] [2025-01-10 01:22:15,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:22:15,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:22:15,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:22:15,940 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:22:15,943 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:22:16,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1154 statements into 1 equivalence classes. [2025-01-10 01:22:16,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1154 of 1154 statements. [2025-01-10 01:22:16,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:22:16,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:22:16,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 4237 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-01-10 01:22:16,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:22:19,957 INFO L134 CoverageAnalysis]: Checked inductivity of 213040 backedges. 80097 proven. 13207 refuted. 0 times theorem prover too weak. 119736 trivial. 0 not checked. [2025-01-10 01:22:19,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:22:25,854 INFO L134 CoverageAnalysis]: Checked inductivity of 213040 backedges. 80097 proven. 13207 refuted. 0 times theorem prover too weak. 119736 trivial. 0 not checked. [2025-01-10 01:22:25,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986536502] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:22:25,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:22:25,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 98, 98] total 196 [2025-01-10 01:22:25,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379828567] [2025-01-10 01:22:25,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:22:25,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 196 states [2025-01-10 01:22:25,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:22:25,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2025-01-10 01:22:25,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18536, Invalid=19684, Unknown=0, NotChecked=0, Total=38220 [2025-01-10 01:22:25,863 INFO L87 Difference]: Start difference. First operand 28324 states and 38452 transitions. Second operand has 196 states, 196 states have (on average 3.1020408163265305) internal successors, (608), 196 states have internal predecessors, (608), 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)