./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-cav19/array_init_nondet_vars.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-cav19/array_init_nondet_vars.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 b36a429fc2ac304c1da00c90b438bd7c9bbfb7e9d7c6704fc9e7805ab1ca424f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:21:28,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:21:28,634 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:28,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:21:28,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:21:28,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:21:28,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:21:28,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:21:28,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:21:28,664 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:21:28,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:21:28,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:21:28,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:21:28,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:21:28,666 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:21:28,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:21:28,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:21:28,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:21:28,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:21:28,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:21:28,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:21:28,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:21:28,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:21:28,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:21:28,666 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:21:28,666 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:21:28,666 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:21:28,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:21:28,666 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:21:28,666 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:21:28,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:21:28,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:21:28,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:21:28,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:21:28,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:21:28,667 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:21:28,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:21:28,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:21:28,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:21:28,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:21:28,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:21:28,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:21:28,667 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:21:28,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:21:28,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:21:28,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:21:28,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:21:28,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:21:28,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:21:28,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:21:28,668 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 -> b36a429fc2ac304c1da00c90b438bd7c9bbfb7e9d7c6704fc9e7805ab1ca424f [2025-01-10 01:21:28,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:21:28,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:21:28,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:21:28,934 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:21:28,934 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:21:28,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_init_nondet_vars.c [2025-01-10 01:21:30,115 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07403ce66/561f056e94cc436b82b8b1fce4afbc0e/FLAG719448785 [2025-01-10 01:21:30,318 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:21:30,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_nondet_vars.c [2025-01-10 01:21:30,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07403ce66/561f056e94cc436b82b8b1fce4afbc0e/FLAG719448785 [2025-01-10 01:21:30,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07403ce66/561f056e94cc436b82b8b1fce4afbc0e [2025-01-10 01:21:30,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:21:30,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:21:30,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:21:30,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:21:30,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:21:30,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:21:30" (1/1) ... [2025-01-10 01:21:30,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61dec634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:30, skipping insertion in model container [2025-01-10 01:21:30,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:21:30" (1/1) ... [2025-01-10 01:21:30,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:21:30,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:21:30,485 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:21:30,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:21:30,515 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:21:30,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:30 WrapperNode [2025-01-10 01:21:30,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:21:30,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:21:30,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:21:30,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:21:30,523 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:30" (1/1) ... [2025-01-10 01:21:30,527 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:30" (1/1) ... [2025-01-10 01:21:30,540 INFO L138 Inliner]: procedures = 15, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-01-10 01:21:30,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:21:30,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:21:30,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:21:30,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:21:30,549 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:30" (1/1) ... [2025-01-10 01:21:30,549 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:30" (1/1) ... [2025-01-10 01:21:30,551 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:30" (1/1) ... [2025-01-10 01:21:30,566 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 01:21:30,567 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:30" (1/1) ... [2025-01-10 01:21:30,567 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:30" (1/1) ... [2025-01-10 01:21:30,571 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:30" (1/1) ... [2025-01-10 01:21:30,575 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:30" (1/1) ... [2025-01-10 01:21:30,578 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:30" (1/1) ... [2025-01-10 01:21:30,580 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:30" (1/1) ... [2025-01-10 01:21:30,580 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:30" (1/1) ... [2025-01-10 01:21:30,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:21:30,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:21:30,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:21:30,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:21:30,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:30" (1/1) ... [2025-01-10 01:21:30,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:21:30,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:30,615 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:30,618 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:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:21:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 01:21:30,638 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 01:21:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:21:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:21:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:21:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:21:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:21:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:21:30,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:21:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:21:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:21:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:21:30,701 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:21:30,703 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:21:30,798 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-01-10 01:21:30,798 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:21:30,805 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:21:30,805 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:21:30,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:21:30 BoogieIcfgContainer [2025-01-10 01:21:30,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:21:30,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:21:30,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:21:30,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:21:30,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:21:30" (1/3) ... [2025-01-10 01:21:30,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a6b704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:21:30, skipping insertion in model container [2025-01-10 01:21:30,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:21:30" (2/3) ... [2025-01-10 01:21:30,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a6b704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:21:30, skipping insertion in model container [2025-01-10 01:21:30,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:21:30" (3/3) ... [2025-01-10 01:21:30,815 INFO L128 eAbstractionObserver]: Analyzing ICFG array_init_nondet_vars.c [2025-01-10 01:21:30,826 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:21:30,828 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array_init_nondet_vars.c that has 2 procedures, 40 locations, 1 initial locations, 2 loop locations, and 10 error locations. [2025-01-10 01:21:30,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:21:30,881 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;@27e9ca29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:21:30,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 01:21:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.56) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:21:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 01:21:30,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:30,890 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:30,891 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:30,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:30,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2095212649, now seen corresponding path program 1 times [2025-01-10 01:21:30,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:30,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495664350] [2025-01-10 01:21:30,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:30,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:30,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:21:30,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:21:30,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:30,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:21:31,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:31,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495664350] [2025-01-10 01:21:31,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495664350] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:31,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452997299] [2025-01-10 01:21:31,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:31,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:31,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:31,021 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:31,023 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:31,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:21:31,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:21:31,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:31,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:31,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-10 01:21:31,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:21:31,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:21:31,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452997299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:31,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:21:31,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-10 01:21:31,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009758968] [2025-01-10 01:21:31,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:31,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 01:21:31,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:31,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 01:21:31,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:21:31,130 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.56) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:21:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:31,142 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2025-01-10 01:21:31,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 01:21:31,144 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2025-01-10 01:21:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:31,148 INFO L225 Difference]: With dead ends: 76 [2025-01-10 01:21:31,148 INFO L226 Difference]: Without dead ends: 35 [2025-01-10 01:21:31,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:21:31,151 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:31,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:21:31,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-10 01:21:31,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-10 01:21:31,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:21:31,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-01-10 01:21:31,176 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 17 [2025-01-10 01:21:31,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:31,177 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-01-10 01:21:31,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:21:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-01-10 01:21:31,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-10 01:21:31,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:31,178 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:31,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:21:31,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-10 01:21:31,382 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:31,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:31,383 INFO L85 PathProgramCache]: Analyzing trace with hash -907011301, now seen corresponding path program 1 times [2025-01-10 01:21:31,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:31,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199134578] [2025-01-10 01:21:31,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:31,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:31,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:21:31,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:21:31,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:31,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:31,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:21:31,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:31,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199134578] [2025-01-10 01:21:31,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199134578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:31,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:31,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:21:31,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574913577] [2025-01-10 01:21:31,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:31,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:21:31,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:31,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:21:31,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:21:31,482 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:21:31,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:31,537 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2025-01-10 01:21:31,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:21:31,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2025-01-10 01:21:31,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:31,538 INFO L225 Difference]: With dead ends: 48 [2025-01-10 01:21:31,538 INFO L226 Difference]: Without dead ends: 46 [2025-01-10 01:21:31,538 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:31,538 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:31,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 42 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:21:31,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-10 01:21:31,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2025-01-10 01:21:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 33 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:21:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2025-01-10 01:21:31,547 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 17 [2025-01-10 01:21:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:31,547 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2025-01-10 01:21:31,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:21:31,548 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2025-01-10 01:21:31,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:21:31,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:31,548 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:31,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:21:31,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:31,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:31,549 INFO L85 PathProgramCache]: Analyzing trace with hash -151331094, now seen corresponding path program 1 times [2025-01-10 01:21:31,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:31,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167423395] [2025-01-10 01:21:31,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:31,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:31,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:21:31,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:21:31,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:31,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:31,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:21:31,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:31,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167423395] [2025-01-10 01:21:31,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167423395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:31,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:31,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:21:31,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903893670] [2025-01-10 01:21:31,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:31,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:21:31,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:31,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:21:31,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:21:31,649 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 01:21:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:31,708 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2025-01-10 01:21:31,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:21:31,708 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2025-01-10 01:21:31,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:31,709 INFO L225 Difference]: With dead ends: 47 [2025-01-10 01:21:31,709 INFO L226 Difference]: Without dead ends: 46 [2025-01-10 01:21:31,709 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:31,710 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 29 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:31,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 46 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:31,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-10 01:21:31,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2025-01-10 01:21:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 35 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:21:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-01-10 01:21:31,715 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 21 [2025-01-10 01:21:31,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:31,715 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-01-10 01:21:31,715 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 01:21:31,715 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-01-10 01:21:31,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:21:31,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:31,716 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:31,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:21:31,716 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:31,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:31,716 INFO L85 PathProgramCache]: Analyzing trace with hash -804990842, now seen corresponding path program 1 times [2025-01-10 01:21:31,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:31,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170139380] [2025-01-10 01:21:31,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:31,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:31,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:21:31,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:21:31,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:31,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:31,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:21:31,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:31,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170139380] [2025-01-10 01:21:31,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170139380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:31,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:31,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:21:31,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001293053] [2025-01-10 01:21:31,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:31,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:21:31,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:31,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:21:31,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:21:31,804 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:21:31,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:31,869 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2025-01-10 01:21:31,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:21:31,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-01-10 01:21:31,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:31,870 INFO L225 Difference]: With dead ends: 50 [2025-01-10 01:21:31,870 INFO L226 Difference]: Without dead ends: 48 [2025-01-10 01:21:31,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:21:31,872 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:31,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 60 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:31,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-10 01:21:31,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2025-01-10 01:21:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.4) internal successors, (42), 39 states have internal predecessors, (42), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:21:31,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-01-10 01:21:31,879 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 21 [2025-01-10 01:21:31,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:31,880 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-01-10 01:21:31,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:21:31,880 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-01-10 01:21:31,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 01:21:31,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:31,882 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:31,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:21:31,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:31,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash -396296573, now seen corresponding path program 1 times [2025-01-10 01:21:31,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:31,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853168476] [2025-01-10 01:21:31,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:31,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:31,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:21:31,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:21:31,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:31,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:21:31,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:31,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853168476] [2025-01-10 01:21:31,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853168476] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:31,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474719628] [2025-01-10 01:21:31,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:31,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:31,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:31,994 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:31,996 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:32,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:21:32,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:21:32,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:32,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:32,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:21:32,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:21:32,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:21:32,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474719628] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:32,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:32,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 01:21:32,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134059074] [2025-01-10 01:21:32,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:32,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:21:32,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:32,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:21:32,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:21:32,190 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-10 01:21:32,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:32,321 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-01-10 01:21:32,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:21:32,321 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 22 [2025-01-10 01:21:32,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:32,322 INFO L225 Difference]: With dead ends: 49 [2025-01-10 01:21:32,322 INFO L226 Difference]: Without dead ends: 48 [2025-01-10 01:21:32,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:21:32,323 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:32,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 115 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-10 01:21:32,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-01-10 01:21:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 40 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:21:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2025-01-10 01:21:32,328 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 22 [2025-01-10 01:21:32,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:32,328 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2025-01-10 01:21:32,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-10 01:21:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2025-01-10 01:21:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:21:32,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:32,329 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:32,334 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:32,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:32,529 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:32,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:32,530 INFO L85 PathProgramCache]: Analyzing trace with hash 599708172, now seen corresponding path program 1 times [2025-01-10 01:21:32,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:32,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580496453] [2025-01-10 01:21:32,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:32,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:32,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:21:32,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:21:32,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:32,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:32,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:21:32,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:32,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580496453] [2025-01-10 01:21:32,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580496453] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:32,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41472719] [2025-01-10 01:21:32,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:32,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:32,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:32,649 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:32,651 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:32,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:21:32,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:21:32,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:32,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:32,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:21:32,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:32,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:21:32,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:21:32,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41472719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:32,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:21:32,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-01-10 01:21:32,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603179898] [2025-01-10 01:21:32,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:32,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:21:32,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:32,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:21:32,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:21:32,773 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 01:21:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:32,852 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2025-01-10 01:21:32,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:21:32,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2025-01-10 01:21:32,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:32,853 INFO L225 Difference]: With dead ends: 49 [2025-01-10 01:21:32,853 INFO L226 Difference]: Without dead ends: 48 [2025-01-10 01:21:32,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:21:32,853 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:32,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 85 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-10 01:21:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2025-01-10 01:21:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.375) internal successors, (44), 41 states have internal predecessors, (44), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:21:32,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-01-10 01:21:32,861 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 23 [2025-01-10 01:21:32,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:32,862 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-01-10 01:21:32,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 01:21:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-01-10 01:21:32,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 01:21:32,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:32,862 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:32,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:21:33,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:33,065 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:33,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:33,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1411084197, now seen corresponding path program 1 times [2025-01-10 01:21:33,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:33,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857069258] [2025-01-10 01:21:33,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:33,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:33,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:21:33,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:21:33,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:33,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:21:33,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:33,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857069258] [2025-01-10 01:21:33,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857069258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:33,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:33,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:21:33,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777325747] [2025-01-10 01:21:33,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:33,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:21:33,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:33,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:21:33,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:21:33,172 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 01:21:33,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:33,243 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-01-10 01:21:33,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:21:33,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2025-01-10 01:21:33,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:33,244 INFO L225 Difference]: With dead ends: 49 [2025-01-10 01:21:33,244 INFO L226 Difference]: Without dead ends: 48 [2025-01-10 01:21:33,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:21:33,245 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:33,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 79 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:33,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-10 01:21:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-10 01:21:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 42 states have internal predecessors, (45), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:21:33,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-01-10 01:21:33,249 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 24 [2025-01-10 01:21:33,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:33,249 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-01-10 01:21:33,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 01:21:33,249 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-01-10 01:21:33,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 01:21:33,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:33,250 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:33,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:21:33,250 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:33,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:33,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1615283690, now seen corresponding path program 1 times [2025-01-10 01:21:33,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:33,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399905972] [2025-01-10 01:21:33,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:33,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:33,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:21:33,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:21:33,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:33,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:21:33,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:33,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399905972] [2025-01-10 01:21:33,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399905972] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:33,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238040140] [2025-01-10 01:21:33,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:33,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:33,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:33,296 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:33,298 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:33,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:21:33,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:21:33,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:33,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:33,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:21:33,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:33,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:21:33,354 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:21:33,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238040140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:33,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:21:33,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-01-10 01:21:33,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493122808] [2025-01-10 01:21:33,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:33,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:21:33,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:33,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:21:33,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:21:33,355 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:21:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:33,406 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2025-01-10 01:21:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:21:33,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-01-10 01:21:33,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:33,407 INFO L225 Difference]: With dead ends: 66 [2025-01-10 01:21:33,407 INFO L226 Difference]: Without dead ends: 48 [2025-01-10 01:21:33,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:21:33,407 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:33,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:21:33,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-10 01:21:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-10 01:21:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 42 states have internal predecessors, (44), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:21:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-01-10 01:21:33,411 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 24 [2025-01-10 01:21:33,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:33,411 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-01-10 01:21:33,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:21:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-01-10 01:21:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 01:21:33,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:33,411 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:33,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:21:33,613 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:33,613 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:33,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:33,614 INFO L85 PathProgramCache]: Analyzing trace with hash 793937198, now seen corresponding path program 1 times [2025-01-10 01:21:33,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:33,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355699007] [2025-01-10 01:21:33,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:33,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:33,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:21:33,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:21:33,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:33,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:21:33,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:33,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355699007] [2025-01-10 01:21:33,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355699007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:33,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:33,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:21:33,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800080223] [2025-01-10 01:21:33,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:33,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:21:33,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:33,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:21:33,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:21:33,667 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 01:21:33,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:33,708 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2025-01-10 01:21:33,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:21:33,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-01-10 01:21:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:33,709 INFO L225 Difference]: With dead ends: 52 [2025-01-10 01:21:33,709 INFO L226 Difference]: Without dead ends: 50 [2025-01-10 01:21:33,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:21:33,710 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:33,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 68 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:21:33,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-10 01:21:33,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-10 01:21:33,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 44 states have internal predecessors, (46), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:21:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2025-01-10 01:21:33,719 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2025-01-10 01:21:33,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:33,719 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-01-10 01:21:33,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 01:21:33,719 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2025-01-10 01:21:33,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-10 01:21:33,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:33,720 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:33,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:21:33,720 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:33,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:33,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1568394241, now seen corresponding path program 1 times [2025-01-10 01:21:33,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:33,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861131337] [2025-01-10 01:21:33,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:33,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:33,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:21:33,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:21:33,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:33,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:21:33,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:33,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861131337] [2025-01-10 01:21:33,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861131337] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:33,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331872965] [2025-01-10 01:21:33,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:33,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:33,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:33,800 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:33,801 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:33,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:21:33,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:21:33,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:33,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:33,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:21:33,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:21:33,902 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:21:33,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331872965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:33,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:21:33,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-10 01:21:33,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987692813] [2025-01-10 01:21:33,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:33,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:21:33,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:33,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:21:33,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:21:33,905 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 01:21:33,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:33,963 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2025-01-10 01:21:33,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:21:33,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2025-01-10 01:21:33,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:33,964 INFO L225 Difference]: With dead ends: 50 [2025-01-10 01:21:33,964 INFO L226 Difference]: Without dead ends: 48 [2025-01-10 01:21:33,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:21:33,964 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:33,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 65 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-10 01:21:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-10 01:21:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 42 states have internal predecessors, (44), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:21:33,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-01-10 01:21:33,971 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 33 [2025-01-10 01:21:33,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:33,972 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-01-10 01:21:33,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 01:21:33,972 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-01-10 01:21:33,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 01:21:33,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:33,973 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:33,983 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:34,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 01:21:34,174 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:34,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:34,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1375581260, now seen corresponding path program 1 times [2025-01-10 01:21:34,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:34,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419602919] [2025-01-10 01:21:34,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:34,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:34,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:21:34,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:21:34,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:34,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:21:34,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:34,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419602919] [2025-01-10 01:21:34,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419602919] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:34,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688009140] [2025-01-10 01:21:34,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:34,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:34,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:34,319 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:34,321 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:34,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:21:34,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:21:34,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:34,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:34,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:21:34,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:21:34,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:21:34,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688009140] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:34,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:34,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-01-10 01:21:34,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676960778] [2025-01-10 01:21:34,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:34,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:21:34,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:34,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:21:34,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:21:34,482 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 01:21:34,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:34,632 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2025-01-10 01:21:34,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:21:34,633 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) Word has length 34 [2025-01-10 01:21:34,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:34,633 INFO L225 Difference]: With dead ends: 55 [2025-01-10 01:21:34,634 INFO L226 Difference]: Without dead ends: 52 [2025-01-10 01:21:34,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:21:34,635 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:34,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 113 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-10 01:21:34,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-10 01:21:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.225) internal successors, (49), 45 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:21:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2025-01-10 01:21:34,642 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 34 [2025-01-10 01:21:34,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:34,643 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2025-01-10 01:21:34,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 01:21:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2025-01-10 01:21:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-10 01:21:34,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:34,644 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:34,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:21:34,845 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,SelfDestructingSolverStorable10 [2025-01-10 01:21:34,845 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:34,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:34,846 INFO L85 PathProgramCache]: Analyzing trace with hash -306653853, now seen corresponding path program 1 times [2025-01-10 01:21:34,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:34,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341454976] [2025-01-10 01:21:34,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:34,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:34,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:21:34,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:21:34,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:34,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:21:34,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:34,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341454976] [2025-01-10 01:21:34,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341454976] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:34,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998936253] [2025-01-10 01:21:34,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:34,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:34,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:34,977 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:34,979 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:35,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:21:35,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:21:35,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:35,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:35,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:21:35,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:21:35,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:21:35,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998936253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:35,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:21:35,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2025-01-10 01:21:35,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429705544] [2025-01-10 01:21:35,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:35,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:21:35,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:35,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:21:35,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:21:35,118 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 01:21:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:35,204 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2025-01-10 01:21:35,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:21:35,204 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2025-01-10 01:21:35,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:35,205 INFO L225 Difference]: With dead ends: 52 [2025-01-10 01:21:35,205 INFO L226 Difference]: Without dead ends: 51 [2025-01-10 01:21:35,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:21:35,206 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:35,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 66 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:35,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-10 01:21:35,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-10 01:21:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.175) internal successors, (47), 44 states have internal predecessors, (47), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:21:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2025-01-10 01:21:35,211 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 35 [2025-01-10 01:21:35,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:35,211 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2025-01-10 01:21:35,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 01:21:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2025-01-10 01:21:35,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 01:21:35,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:35,212 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:35,218 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:35,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:35,417 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:35,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:35,418 INFO L85 PathProgramCache]: Analyzing trace with hash -712135309, now seen corresponding path program 1 times [2025-01-10 01:21:35,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:35,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530942152] [2025-01-10 01:21:35,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:35,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:35,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 01:21:35,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:21:35,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:35,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 01:21:35,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:35,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530942152] [2025-01-10 01:21:35,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530942152] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:35,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349572349] [2025-01-10 01:21:35,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:35,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:35,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:35,460 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:35,461 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:35,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 01:21:35,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:21:35,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:35,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:35,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:21:35,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:35,520 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 01:21:35,520 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:21:35,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349572349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:35,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:21:35,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 01:21:35,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111260372] [2025-01-10 01:21:35,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:35,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:21:35,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:35,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:21:35,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:21:35,522 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:21:35,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:35,563 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2025-01-10 01:21:35,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:21:35,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-01-10 01:21:35,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:35,564 INFO L225 Difference]: With dead ends: 51 [2025-01-10 01:21:35,564 INFO L226 Difference]: Without dead ends: 49 [2025-01-10 01:21:35,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:21:35,564 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:35,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 61 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:21:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-10 01:21:35,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-10 01:21:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:21:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2025-01-10 01:21:35,572 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 36 [2025-01-10 01:21:35,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:35,572 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2025-01-10 01:21:35,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:21:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2025-01-10 01:21:35,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 01:21:35,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:35,572 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:35,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:21:35,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:35,777 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:35,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:35,777 INFO L85 PathProgramCache]: Analyzing trace with hash -601358036, now seen corresponding path program 1 times [2025-01-10 01:21:35,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:35,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363298866] [2025-01-10 01:21:35,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:35,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:35,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 01:21:35,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:21:35,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:35,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 01:21:35,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:35,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363298866] [2025-01-10 01:21:35,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363298866] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:35,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444126539] [2025-01-10 01:21:35,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:35,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:35,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:35,828 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:35,834 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:35,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 01:21:35,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:21:35,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:35,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:35,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:21:35,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 01:21:35,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:35,926 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 01:21:35,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444126539] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:35,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:35,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 01:21:35,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040308076] [2025-01-10 01:21:35,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:35,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:21:35,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:35,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:21:35,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:21:35,927 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:21:35,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:35,981 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2025-01-10 01:21:35,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:21:35,981 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2025-01-10 01:21:35,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:35,982 INFO L225 Difference]: With dead ends: 61 [2025-01-10 01:21:35,982 INFO L226 Difference]: Without dead ends: 59 [2025-01-10 01:21:35,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:21:35,983 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:35,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 99 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:21:35,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-10 01:21:35,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-10 01:21:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.1) internal successors, (55), 52 states have internal predecessors, (55), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:21:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2025-01-10 01:21:35,987 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 37 [2025-01-10 01:21:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:35,987 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2025-01-10 01:21:35,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:21:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2025-01-10 01:21:35,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 01:21:35,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:35,988 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:35,994 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:21:36,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:36,189 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:36,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:36,189 INFO L85 PathProgramCache]: Analyzing trace with hash -513525449, now seen corresponding path program 1 times [2025-01-10 01:21:36,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:36,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593702016] [2025-01-10 01:21:36,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:36,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:36,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:21:36,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:21:36,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:36,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:36,366 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:21:36,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:36,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593702016] [2025-01-10 01:21:36,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593702016] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:36,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715160787] [2025-01-10 01:21:36,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:36,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:36,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:36,369 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:21:36,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:21:36,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:21:36,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:21:36,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:36,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:36,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:21:36,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:36,620 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:21:36,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:21:36,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715160787] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:36,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:36,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-01-10 01:21:36,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715579578] [2025-01-10 01:21:36,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:36,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 01:21:36,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:36,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 01:21:36,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2025-01-10 01:21:36,769 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 26 states, 25 states have (on average 2.84) internal successors, (71), 23 states have internal predecessors, (71), 10 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (13), 13 states have call predecessors, (13), 10 states have call successors, (13) [2025-01-10 01:21:37,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:37,028 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2025-01-10 01:21:37,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 01:21:37,028 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.84) internal successors, (71), 23 states have internal predecessors, (71), 10 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (13), 13 states have call predecessors, (13), 10 states have call successors, (13) Word has length 48 [2025-01-10 01:21:37,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:37,029 INFO L225 Difference]: With dead ends: 84 [2025-01-10 01:21:37,029 INFO L226 Difference]: Without dead ends: 83 [2025-01-10 01:21:37,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=999, Unknown=0, NotChecked=0, Total=1260 [2025-01-10 01:21:37,030 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 64 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:37,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 108 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-10 01:21:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-01-10 01:21:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 73 states have internal predecessors, (79), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:21:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2025-01-10 01:21:37,036 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 48 [2025-01-10 01:21:37,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:37,036 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2025-01-10 01:21:37,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.84) internal successors, (71), 23 states have internal predecessors, (71), 10 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (13), 13 states have call predecessors, (13), 10 states have call successors, (13) [2025-01-10 01:21:37,036 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2025-01-10 01:21:37,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 01:21:37,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:37,037 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:37,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 01:21:37,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 01:21:37,237 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:37,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:37,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1145064817, now seen corresponding path program 1 times [2025-01-10 01:21:37,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:37,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457674380] [2025-01-10 01:21:37,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:21:37,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:37,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:21:37,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:21:37,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:21:37,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 01:21:37,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:37,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457674380] [2025-01-10 01:21:37,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457674380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:21:37,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:21:37,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:21:37,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761549220] [2025-01-10 01:21:37,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:21:37,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:21:37,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:37,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:21:37,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:21:37,276 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:21:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:37,306 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2025-01-10 01:21:37,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:21:37,307 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-01-10 01:21:37,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:37,308 INFO L225 Difference]: With dead ends: 83 [2025-01-10 01:21:37,308 INFO L226 Difference]: Without dead ends: 82 [2025-01-10 01:21:37,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:21:37,308 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:37,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 49 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:21:37,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-10 01:21:37,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-10 01:21:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 72 states have internal predecessors, (78), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:21:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2025-01-10 01:21:37,315 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 48 [2025-01-10 01:21:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:37,315 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2025-01-10 01:21:37,315 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:21:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2025-01-10 01:21:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-10 01:21:37,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:37,316 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:37,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:21:37,316 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:37,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:37,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1995757068, now seen corresponding path program 2 times [2025-01-10 01:21:37,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:37,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196169387] [2025-01-10 01:21:37,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:37,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:37,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-01-10 01:21:37,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 01:21:37,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:21:37,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-10 01:21:37,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:37,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196169387] [2025-01-10 01:21:37,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196169387] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:37,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883245776] [2025-01-10 01:21:37,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:37,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:37,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:37,398 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:21:37,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:21:37,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-01-10 01:21:37,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 01:21:37,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:21:37,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:37,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:21:37,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 01:21:37,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:37,577 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 01:21:37,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883245776] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:37,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:37,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-01-10 01:21:37,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248569363] [2025-01-10 01:21:37,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:37,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:21:37,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:37,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:21:37,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:21:37,578 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-10 01:21:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:37,705 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2025-01-10 01:21:37,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:21:37,705 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 51 [2025-01-10 01:21:37,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:37,706 INFO L225 Difference]: With dead ends: 106 [2025-01-10 01:21:37,706 INFO L226 Difference]: Without dead ends: 57 [2025-01-10 01:21:37,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:21:37,707 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:37,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 60 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:21:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-10 01:21:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-10 01:21:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 01:21:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2025-01-10 01:21:37,710 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 51 [2025-01-10 01:21:37,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:37,710 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2025-01-10 01:21:37,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-10 01:21:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2025-01-10 01:21:37,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 01:21:37,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:37,711 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:37,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:21:37,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:21:37,912 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:37,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:37,912 INFO L85 PathProgramCache]: Analyzing trace with hash 361610834, now seen corresponding path program 2 times [2025-01-10 01:21:37,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:37,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046656168] [2025-01-10 01:21:37,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:37,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:37,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-01-10 01:21:37,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 01:21:37,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:21:37,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 21 proven. 125 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-10 01:21:38,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:38,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046656168] [2025-01-10 01:21:38,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046656168] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:38,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600826758] [2025-01-10 01:21:38,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:21:38,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:38,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:38,239 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:21:38,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:21:38,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-01-10 01:21:38,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 01:21:38,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:21:38,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:38,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 01:21:38,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 21 proven. 125 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-10 01:21:38,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 21 proven. 125 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-10 01:21:38,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600826758] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:38,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:38,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 43 [2025-01-10 01:21:38,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752482777] [2025-01-10 01:21:38,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:38,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-10 01:21:38,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:38,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-10 01:21:38,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=1520, Unknown=0, NotChecked=0, Total=1892 [2025-01-10 01:21:38,978 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 44 states, 43 states have (on average 3.116279069767442) internal successors, (134), 41 states have internal predecessors, (134), 19 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (22), 22 states have call predecessors, (22), 19 states have call successors, (22) [2025-01-10 01:21:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:39,475 INFO L93 Difference]: Finished difference Result 106 states and 124 transitions. [2025-01-10 01:21:39,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-10 01:21:39,475 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 3.116279069767442) internal successors, (134), 41 states have internal predecessors, (134), 19 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (22), 22 states have call predecessors, (22), 19 states have call successors, (22) Word has length 84 [2025-01-10 01:21:39,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:39,476 INFO L225 Difference]: With dead ends: 106 [2025-01-10 01:21:39,476 INFO L226 Difference]: Without dead ends: 105 [2025-01-10 01:21:39,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=831, Invalid=3459, Unknown=0, NotChecked=0, Total=4290 [2025-01-10 01:21:39,478 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:39,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 112 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:21:39,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-10 01:21:39,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-01-10 01:21:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-10 01:21:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2025-01-10 01:21:39,483 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 84 [2025-01-10 01:21:39,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:39,484 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2025-01-10 01:21:39,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 3.116279069767442) internal successors, (134), 41 states have internal predecessors, (134), 19 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (22), 22 states have call predecessors, (22), 19 states have call successors, (22) [2025-01-10 01:21:39,484 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2025-01-10 01:21:39,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-10 01:21:39,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:21:39,485 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 12, 12, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:39,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 01:21:39,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:21:39,689 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 01:21:39,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:21:39,690 INFO L85 PathProgramCache]: Analyzing trace with hash -851839992, now seen corresponding path program 3 times [2025-01-10 01:21:39,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:21:39,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076959770] [2025-01-10 01:21:39,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:21:39,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:21:39,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 156 statements into 14 equivalence classes. [2025-01-10 01:21:39,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 77 of 156 statements. [2025-01-10 01:21:39,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-10 01:21:39,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 33 proven. 121 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2025-01-10 01:21:39,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:21:39,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076959770] [2025-01-10 01:21:39,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076959770] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:21:39,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205741941] [2025-01-10 01:21:39,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:21:39,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:39,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:21:39,952 INFO L229 MonitoredProcess]: Starting monitored process 14 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:39,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:21:39,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 156 statements into 14 equivalence classes. [2025-01-10 01:21:40,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 77 of 156 statements. [2025-01-10 01:21:40,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-10 01:21:40,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:21:40,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:21:40,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:21:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 33 proven. 121 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2025-01-10 01:21:40,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:21:40,654 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 33 proven. 121 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2025-01-10 01:21:40,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205741941] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:21:40,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:21:40,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-01-10 01:21:40,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837029737] [2025-01-10 01:21:40,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:21:40,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:21:40,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:21:40,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:21:40,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:21:40,655 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 17 states, 13 states have (on average 4.0) internal successors, (52), 17 states have internal predecessors, (52), 10 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (12), 9 states have call predecessors, (12), 10 states have call successors, (12) [2025-01-10 01:21:40,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:21:40,714 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2025-01-10 01:21:40,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:21:40,715 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 4.0) internal successors, (52), 17 states have internal predecessors, (52), 10 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (12), 9 states have call predecessors, (12), 10 states have call successors, (12) Word has length 156 [2025-01-10 01:21:40,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:21:40,715 INFO L225 Difference]: With dead ends: 105 [2025-01-10 01:21:40,715 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:21:40,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:21:40,716 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:21:40,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:21:40,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:21:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:21:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:21:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:21:40,717 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 156 [2025-01-10 01:21:40,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:21:40,717 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:21:40,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 4.0) internal successors, (52), 17 states have internal predecessors, (52), 10 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (12), 9 states have call predecessors, (12), 10 states have call successors, (12) [2025-01-10 01:21:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:21:40,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:21:40,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-01-10 01:21:40,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-01-10 01:21:40,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-01-10 01:21:40,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-01-10 01:21:40,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-01-10 01:21:40,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-01-10 01:21:40,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-01-10 01:21:40,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-01-10 01:21:40,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-01-10 01:21:40,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-01-10 01:21:40,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-10 01:21:40,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:21:40,924 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:21:40,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:21:41,092 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:21:41,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:21:41 BoogieIcfgContainer [2025-01-10 01:21:41,102 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:21:41,102 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:21:41,102 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:21:41,103 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:21:41,103 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:21:30" (3/4) ... [2025-01-10 01:21:41,104 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:21:41,111 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-10 01:21:41,114 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-10 01:21:41,114 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:21:41,114 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:21:41,114 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:21:41,172 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:21:41,173 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:21:41,173 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:21:41,174 INFO L158 Benchmark]: Toolchain (without parser) took 10831.96ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 113.6MB in the beginning and 75.5MB in the end (delta: 38.1MB). Peak memory consumption was 112.8MB. Max. memory is 16.1GB. [2025-01-10 01:21:41,174 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:21:41,174 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.85ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 102.4MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:21:41,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.70ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.4MB in the end (delta: 987.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:21:41,174 INFO L158 Benchmark]: Boogie Preprocessor took 43.18ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 100.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:21:41,174 INFO L158 Benchmark]: RCFGBuilder took 219.71ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 88.0MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:21:41,177 INFO L158 Benchmark]: TraceAbstraction took 10295.53ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 87.5MB in the beginning and 80.1MB in the end (delta: 7.4MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. [2025-01-10 01:21:41,177 INFO L158 Benchmark]: Witness Printer took 70.31ms. Allocated memory is still 218.1MB. Free memory was 80.1MB in the beginning and 75.5MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:21:41,178 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.85ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 102.4MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.70ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 101.4MB in the end (delta: 987.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.18ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 100.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 219.71ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 88.0MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10295.53ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 87.5MB in the beginning and 80.1MB in the end (delta: 7.4MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. * Witness Printer took 70.31ms. Allocated memory is still 218.1MB. Free memory was 80.1MB in the beginning and 75.5MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 19, TraceHistogramMax: 14, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 416 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 403 mSDsluCounter, 1387 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1002 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1809 IncrementalHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 385 mSDtfsCounter, 1809 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1176 GetRequests, 952 SyntacticMatches, 2 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=18, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1356 NumberOfCodeBlocks, 1198 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1749 ConstructedInterpolants, 0 QuantifiedInterpolants, 7041 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1447 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 39 InterpolantComputations, 12 PerfectInterpolantSequences, 3114/4017 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((n <= 99999) && (j <= 9999)) && (1 <= j)) && (i == 1)) || (((((n <= 99999) && (j <= 9999)) && (1 <= j)) && (((long long) i + j) <= 2147483647)) && (2 <= i))) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((n <= 99999) && (j <= 9999)) && (1 <= j)) && (2 <= i)) || ((((n <= 99999) && (j <= 9999)) && (1 <= j)) && (i == 1))) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:21:41,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE