./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i --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/nla-digbench-scaling/divbin_unwindbound5.i -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 3d0e3bce6f4731d98bf8e5301c405fc62948194b21f76143536933e108212a93 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:56:40,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:56:40,668 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:56:40,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:56:40,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:56:40,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:56:40,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:56:40,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:56:40,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:56:40,692 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:56:40,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:56:40,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:56:40,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:56:40,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:56:40,692 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:56:40,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:56:40,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:56:40,693 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:56:40,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:56:40,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:56:40,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:56:40,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:56:40,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:56:40,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:56:40,694 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:56:40,694 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:56:40,694 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:56:40,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:56:40,694 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:56:40,694 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:56:40,694 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:56:40,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:56:40,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:56:40,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:56:40,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:56:40,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:56:40,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:56:40,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:56:40,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:56:40,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:56:40,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:56:40,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:56:40,696 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:56:40,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:56:40,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:56:40,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:56:40,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:56:40,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:56:40,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:56:40,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:56:40,696 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 -> 3d0e3bce6f4731d98bf8e5301c405fc62948194b21f76143536933e108212a93 [2025-01-10 01:56:40,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:56:40,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:56:40,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:56:40,916 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:56:40,916 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:56:40,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i [2025-01-10 01:56:42,257 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bba31ded9/5d7c63ad05274670bef3963ec08213b8/FLAG4ff9974c7 [2025-01-10 01:56:42,519 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:56:42,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i [2025-01-10 01:56:42,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bba31ded9/5d7c63ad05274670bef3963ec08213b8/FLAG4ff9974c7 [2025-01-10 01:56:42,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bba31ded9/5d7c63ad05274670bef3963ec08213b8 [2025-01-10 01:56:42,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:56:42,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:56:42,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:56:42,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:56:42,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:56:42,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b280425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42, skipping insertion in model container [2025-01-10 01:56:42,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:56:42,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:56:42,738 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:56:42,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:56:42,769 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:56:42,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42 WrapperNode [2025-01-10 01:56:42,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:56:42,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:56:42,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:56:42,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:56:42,775 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:56:42" (1/1) ... [2025-01-10 01:56:42,780 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:56:42" (1/1) ... [2025-01-10 01:56:42,789 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-01-10 01:56:42,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:56:42,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:56:42,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:56:42,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:56:42,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,801 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,808 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:56:42,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,810 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,814 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:56:42,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:56:42,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:56:42,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:56:42,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (1/1) ... [2025-01-10 01:56:42,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:56:42,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:42,848 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:56:42,850 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:56:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:56:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 01:56:42,869 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 01:56:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:56:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:56:42,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:56:42,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 01:56:42,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 01:56:42,914 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:56:42,915 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:56:43,045 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-10 01:56:43,045 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:56:43,053 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:56:43,054 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:56:43,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:56:43 BoogieIcfgContainer [2025-01-10 01:56:43,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:56:43,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:56:43,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:56:43,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:56:43,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:56:42" (1/3) ... [2025-01-10 01:56:43,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23aafece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:56:43, skipping insertion in model container [2025-01-10 01:56:43,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:56:42" (2/3) ... [2025-01-10 01:56:43,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23aafece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:56:43, skipping insertion in model container [2025-01-10 01:56:43,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:56:43" (3/3) ... [2025-01-10 01:56:43,062 INFO L128 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound5.i [2025-01-10 01:56:43,073 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:56:43,074 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG divbin_unwindbound5.i that has 3 procedures, 37 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-01-10 01:56:43,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:56:43,121 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;@5aa5fc8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:56:43,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 01:56:43,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:56:43,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:56:43,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:43,129 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:43,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:43,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:43,132 INFO L85 PathProgramCache]: Analyzing trace with hash -604571649, now seen corresponding path program 1 times [2025-01-10 01:56:43,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:43,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680092243] [2025-01-10 01:56:43,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:43,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:43,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:56:43,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:56:43,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:43,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:43,255 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:56:43,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:43,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680092243] [2025-01-10 01:56:43,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680092243] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:56:43,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253193134] [2025-01-10 01:56:43,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:43,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:43,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:43,261 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:56:43,265 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:56:43,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:56:43,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:56:43,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:43,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:43,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-10 01:56:43,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:56:43,314 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:56:43,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:56:43,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253193134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:43,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:56:43,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-10 01:56:43,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86667428] [2025-01-10 01:56:43,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:43,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 01:56:43,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:43,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 01:56:43,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:56:43,341 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:56:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:43,354 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2025-01-10 01:56:43,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 01:56:43,355 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2025-01-10 01:56:43,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:43,361 INFO L225 Difference]: With dead ends: 70 [2025-01-10 01:56:43,361 INFO L226 Difference]: Without dead ends: 29 [2025-01-10 01:56:43,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 01:56:43,372 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:56:43,373 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:56:43,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-10 01:56:43,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-01-10 01:56:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:56:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-01-10 01:56:43,415 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2025-01-10 01:56:43,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:43,415 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-01-10 01:56:43,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:56:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-01-10 01:56:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:56:43,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:43,417 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:43,426 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:56:43,618 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:56:43,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:43,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:43,620 INFO L85 PathProgramCache]: Analyzing trace with hash 153751231, now seen corresponding path program 1 times [2025-01-10 01:56:43,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:43,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421486334] [2025-01-10 01:56:43,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:43,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:43,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:56:43,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:56:43,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:43,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:43,703 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:56:43,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:43,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421486334] [2025-01-10 01:56:43,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421486334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:43,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:56:43,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:56:43,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914301698] [2025-01-10 01:56:43,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:43,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:56:43,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:43,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:56:43,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:56:43,706 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:56:43,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:43,764 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2025-01-10 01:56:43,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:56:43,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2025-01-10 01:56:43,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:43,766 INFO L225 Difference]: With dead ends: 34 [2025-01-10 01:56:43,766 INFO L226 Difference]: Without dead ends: 33 [2025-01-10 01:56:43,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:56:43,767 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:43,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 61 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-10 01:56:43,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2025-01-10 01:56:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:56:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-01-10 01:56:43,776 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2025-01-10 01:56:43,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:43,779 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-01-10 01:56:43,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:56:43,780 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-01-10 01:56:43,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:56:43,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:43,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:43,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:56:43,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:43,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:43,781 INFO L85 PathProgramCache]: Analyzing trace with hash 471320908, now seen corresponding path program 1 times [2025-01-10 01:56:43,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:43,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404999054] [2025-01-10 01:56:43,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:43,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:43,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:56:43,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:56:43,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:43,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:43,840 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:56:43,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:43,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404999054] [2025-01-10 01:56:43,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404999054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:43,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:56:43,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:56:43,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401069010] [2025-01-10 01:56:43,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:43,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:56:43,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:43,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:56:43,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:56:43,843 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:56:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:43,889 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2025-01-10 01:56:43,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:56:43,891 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), 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 16 [2025-01-10 01:56:43,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:43,892 INFO L225 Difference]: With dead ends: 46 [2025-01-10 01:56:43,892 INFO L226 Difference]: Without dead ends: 32 [2025-01-10 01:56:43,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:56:43,893 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:43,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 70 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:43,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-10 01:56:43,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-10 01:56:43,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:56:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-01-10 01:56:43,904 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2025-01-10 01:56:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:43,904 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-01-10 01:56:43,905 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), 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:56:43,905 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-01-10 01:56:43,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 01:56:43,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:43,906 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:43,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:56:43,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:43,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:43,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1297086228, now seen corresponding path program 1 times [2025-01-10 01:56:43,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:43,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137549709] [2025-01-10 01:56:43,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:43,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:43,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:56:43,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:56:43,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:43,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:44,034 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:56:44,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:44,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137549709] [2025-01-10 01:56:44,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137549709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:44,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:56:44,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:56:44,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007647296] [2025-01-10 01:56:44,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:44,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:56:44,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:44,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:56:44,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:56:44,037 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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:56:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:44,138 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2025-01-10 01:56:44,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:56:44,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 20 [2025-01-10 01:56:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:44,141 INFO L225 Difference]: With dead ends: 32 [2025-01-10 01:56:44,141 INFO L226 Difference]: Without dead ends: 31 [2025-01-10 01:56:44,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:56:44,142 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:44,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 63 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:56:44,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-10 01:56:44,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-01-10 01:56:44,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:56:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-01-10 01:56:44,153 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2025-01-10 01:56:44,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:44,154 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-01-10 01:56:44,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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:56:44,154 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-01-10 01:56:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:56:44,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:44,155 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:56:44,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:56:44,156 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:44,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:44,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1554967468, now seen corresponding path program 1 times [2025-01-10 01:56:44,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:44,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929271292] [2025-01-10 01:56:44,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:44,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:44,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:56:44,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:56:44,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:44,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:44,261 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:56:44,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:44,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929271292] [2025-01-10 01:56:44,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929271292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:44,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:56:44,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:56:44,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164606194] [2025-01-10 01:56:44,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:44,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:56:44,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:44,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:56:44,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:56:44,263 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:56:44,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:44,317 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2025-01-10 01:56:44,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:56:44,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:56:44,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:44,320 INFO L225 Difference]: With dead ends: 41 [2025-01-10 01:56:44,320 INFO L226 Difference]: Without dead ends: 40 [2025-01-10 01:56:44,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:56:44,320 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:44,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 94 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:44,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-10 01:56:44,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2025-01-10 01:56:44,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:56:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-01-10 01:56:44,327 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 21 [2025-01-10 01:56:44,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:44,327 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-01-10 01:56:44,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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:56:44,327 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-01-10 01:56:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-10 01:56:44,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:44,329 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:44,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:56:44,329 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:44,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:44,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1555006197, now seen corresponding path program 1 times [2025-01-10 01:56:44,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:44,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405215915] [2025-01-10 01:56:44,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:44,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:44,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:56:44,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:56:44,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:44,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:44,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:44,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405215915] [2025-01-10 01:56:44,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405215915] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:56:44,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041339317] [2025-01-10 01:56:44,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:44,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:44,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:44,430 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:56:44,431 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:56:44,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:56:44,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:56:44,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:44,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:44,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:56:44,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:56:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:44,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:56:44,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041339317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:44,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:56:44,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-10 01:56:44,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080794670] [2025-01-10 01:56:44,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:44,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:56:44,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:44,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:56:44,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:56:44,513 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:56:44,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:44,555 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-01-10 01:56:44,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:56:44,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:56:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:44,556 INFO L225 Difference]: With dead ends: 39 [2025-01-10 01:56:44,556 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 01:56:44,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:56:44,557 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:44,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:44,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 01:56:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2025-01-10 01:56:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:56:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-01-10 01:56:44,564 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 21 [2025-01-10 01:56:44,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:44,565 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-01-10 01:56:44,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:56:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2025-01-10 01:56:44,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 01:56:44,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:44,565 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:44,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:56:44,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:44,766 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:44,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:44,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1565410493, now seen corresponding path program 1 times [2025-01-10 01:56:44,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:44,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944220959] [2025-01-10 01:56:44,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:44,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:56:44,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:56:44,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:44,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:44,839 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:44,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:44,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944220959] [2025-01-10 01:56:44,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944220959] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:56:44,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152216449] [2025-01-10 01:56:44,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:44,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:44,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:44,842 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:56:44,844 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:56:44,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:56:44,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:56:44,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:44,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:44,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:56:44,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:56:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:44,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:56:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:44,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152216449] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:56:44,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:56:44,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-01-10 01:56:44,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208594993] [2025-01-10 01:56:44,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:56:44,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:56:44,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:44,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:56:44,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:56:44,956 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:56:45,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:45,031 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2025-01-10 01:56:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:56:45,032 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 25 [2025-01-10 01:56:45,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:45,032 INFO L225 Difference]: With dead ends: 68 [2025-01-10 01:56:45,032 INFO L226 Difference]: Without dead ends: 56 [2025-01-10 01:56:45,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:56:45,033 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:45,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 117 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-10 01:56:45,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2025-01-10 01:56:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:56:45,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2025-01-10 01:56:45,037 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 25 [2025-01-10 01:56:45,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:45,038 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2025-01-10 01:56:45,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:56:45,038 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2025-01-10 01:56:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 01:56:45,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:45,038 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:45,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:56:45,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:45,243 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:45,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:45,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1285172317, now seen corresponding path program 1 times [2025-01-10 01:56:45,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:45,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786393813] [2025-01-10 01:56:45,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:45,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:45,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:56:45,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:56:45,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:45,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:45,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:45,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786393813] [2025-01-10 01:56:45,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786393813] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:56:45,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951797143] [2025-01-10 01:56:45,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:45,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:45,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:45,301 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:56:45,303 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:56:45,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:56:45,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:56:45,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:45,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:45,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:56:45,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:56:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:45,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:56:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:45,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951797143] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:56:45,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:56:45,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-01-10 01:56:45,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047418475] [2025-01-10 01:56:45,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:56:45,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:56:45,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:45,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:56:45,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:56:45,449 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:56:45,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:45,647 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2025-01-10 01:56:45,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-10 01:56:45,648 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2025-01-10 01:56:45,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:45,648 INFO L225 Difference]: With dead ends: 77 [2025-01-10 01:56:45,648 INFO L226 Difference]: Without dead ends: 76 [2025-01-10 01:56:45,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2025-01-10 01:56:45,653 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 110 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:45,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 122 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:56:45,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-10 01:56:45,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2025-01-10 01:56:45,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:56:45,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2025-01-10 01:56:45,711 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 26 [2025-01-10 01:56:45,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:45,712 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2025-01-10 01:56:45,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:56:45,712 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2025-01-10 01:56:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-10 01:56:45,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:45,713 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:45,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:56:45,913 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:56:45,914 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:45,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:45,915 INFO L85 PathProgramCache]: Analyzing trace with hash -712969754, now seen corresponding path program 1 times [2025-01-10 01:56:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:45,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718267353] [2025-01-10 01:56:45,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:45,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:45,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 01:56:45,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 01:56:45,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:45,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 01:56:46,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:46,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718267353] [2025-01-10 01:56:46,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718267353] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:56:46,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551688776] [2025-01-10 01:56:46,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:46,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:46,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:46,066 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:56:46,068 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:56:46,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 01:56:46,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 01:56:46,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:46,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:46,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:56:46,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:56:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:56:46,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:56:46,410 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 01:56:46,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551688776] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:56:46,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:56:46,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-01-10 01:56:46,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259113249] [2025-01-10 01:56:46,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:56:46,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-10 01:56:46,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:46,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-10 01:56:46,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2025-01-10 01:56:46,412 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-01-10 01:56:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:47,122 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2025-01-10 01:56:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-10 01:56:47,123 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 54 [2025-01-10 01:56:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:47,124 INFO L225 Difference]: With dead ends: 223 [2025-01-10 01:56:47,124 INFO L226 Difference]: Without dead ends: 222 [2025-01-10 01:56:47,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=896, Invalid=2296, Unknown=0, NotChecked=0, Total=3192 [2025-01-10 01:56:47,130 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 214 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:47,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 207 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:56:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-01-10 01:56:47,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 169. [2025-01-10 01:56:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 141 states have (on average 1.127659574468085) internal successors, (159), 141 states have internal predecessors, (159), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-10 01:56:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 187 transitions. [2025-01-10 01:56:47,153 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 187 transitions. Word has length 54 [2025-01-10 01:56:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:47,153 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 187 transitions. [2025-01-10 01:56:47,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-01-10 01:56:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 187 transitions. [2025-01-10 01:56:47,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-10 01:56:47,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:47,159 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:47,168 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:56:47,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:47,359 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:47,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:47,360 INFO L85 PathProgramCache]: Analyzing trace with hash -948772198, now seen corresponding path program 1 times [2025-01-10 01:56:47,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:47,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561091802] [2025-01-10 01:56:47,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:47,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:47,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 01:56:47,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 01:56:47,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:47,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:56:47,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:47,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561091802] [2025-01-10 01:56:47,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561091802] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:56:47,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047802926] [2025-01-10 01:56:47,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:47,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:47,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:47,522 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:56:47,523 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:56:47,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 01:56:47,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 01:56:47,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:47,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:47,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:56:47,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:56:47,609 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:56:47,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:56:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:56:47,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047802926] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:56:47,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:56:47,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 12 [2025-01-10 01:56:47,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048476552] [2025-01-10 01:56:47,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:56:47,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:56:47,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:47,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:56:47,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:56:47,694 INFO L87 Difference]: Start difference. First operand 169 states and 187 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:56:47,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:47,801 INFO L93 Difference]: Finished difference Result 209 states and 231 transitions. [2025-01-10 01:56:47,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 01:56:47,801 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 62 [2025-01-10 01:56:47,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:47,802 INFO L225 Difference]: With dead ends: 209 [2025-01-10 01:56:47,802 INFO L226 Difference]: Without dead ends: 183 [2025-01-10 01:56:47,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 114 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:56:47,803 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 43 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:47,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 98 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-10 01:56:47,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 174. [2025-01-10 01:56:47,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 146 states have (on average 1.13013698630137) internal successors, (165), 146 states have internal predecessors, (165), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-10 01:56:47,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 193 transitions. [2025-01-10 01:56:47,821 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 193 transitions. Word has length 62 [2025-01-10 01:56:47,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:47,822 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 193 transitions. [2025-01-10 01:56:47,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:56:47,822 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 193 transitions. [2025-01-10 01:56:47,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-10 01:56:47,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:47,825 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:47,834 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:56:48,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 01:56:48,026 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:48,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:48,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1796349059, now seen corresponding path program 2 times [2025-01-10 01:56:48,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:48,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120214707] [2025-01-10 01:56:48,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:56:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:48,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-01-10 01:56:48,043 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 01:56:48,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:56:48,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-01-10 01:56:48,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:48,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120214707] [2025-01-10 01:56:48,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120214707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:56:48,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:56:48,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:56:48,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659263280] [2025-01-10 01:56:48,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:56:48,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:56:48,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:48,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:56:48,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:56:48,089 INFO L87 Difference]: Start difference. First operand 174 states and 193 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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:56:48,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:48,113 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2025-01-10 01:56:48,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:56:48,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 67 [2025-01-10 01:56:48,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:48,115 INFO L225 Difference]: With dead ends: 200 [2025-01-10 01:56:48,116 INFO L226 Difference]: Without dead ends: 174 [2025-01-10 01:56:48,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:56:48,116 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:48,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 94 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:56:48,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-01-10 01:56:48,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 155. [2025-01-10 01:56:48,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 127 states have (on average 1.1181102362204725) internal successors, (142), 127 states have internal predecessors, (142), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-10 01:56:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 170 transitions. [2025-01-10 01:56:48,131 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 170 transitions. Word has length 67 [2025-01-10 01:56:48,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:48,131 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 170 transitions. [2025-01-10 01:56:48,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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:56:48,131 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2025-01-10 01:56:48,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-10 01:56:48,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:56:48,132 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:48,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:56:48,132 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 01:56:48,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:56:48,132 INFO L85 PathProgramCache]: Analyzing trace with hash -699431517, now seen corresponding path program 1 times [2025-01-10 01:56:48,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:56:48,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732687927] [2025-01-10 01:56:48,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:48,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:56:48,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-10 01:56:48,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-10 01:56:48,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:48,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:48,272 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 90 proven. 7 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-01-10 01:56:48,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:56:48,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732687927] [2025-01-10 01:56:48,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732687927] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:56:48,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991936687] [2025-01-10 01:56:48,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:56:48,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:56:48,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:56:48,275 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:56:48,276 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:56:48,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-10 01:56:48,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-10 01:56:48,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:56:48,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:56:48,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 01:56:48,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:56:48,505 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 228 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-01-10 01:56:48,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:56:48,643 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 156 proven. 3 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2025-01-10 01:56:48,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991936687] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:56:48,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:56:48,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 14] total 19 [2025-01-10 01:56:48,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710442891] [2025-01-10 01:56:48,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:56:48,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:56:48,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:56:48,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:56:48,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:56:48,645 INFO L87 Difference]: Start difference. First operand 155 states and 170 transitions. Second operand has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 19 states have internal predecessors, (91), 8 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2025-01-10 01:56:48,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:56:48,927 INFO L93 Difference]: Finished difference Result 249 states and 273 transitions. [2025-01-10 01:56:48,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 01:56:48,927 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 19 states have internal predecessors, (91), 8 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) Word has length 114 [2025-01-10 01:56:48,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:56:48,928 INFO L225 Difference]: With dead ends: 249 [2025-01-10 01:56:48,928 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:56:48,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 208 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=1164, Unknown=0, NotChecked=0, Total=1482 [2025-01-10 01:56:48,929 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 74 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:56:48,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 367 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:56:48,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:56:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:56:48,930 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:56:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:56:48,930 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2025-01-10 01:56:48,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:56:48,930 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:56:48,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 19 states have internal predecessors, (91), 8 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2025-01-10 01:56:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:56:48,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:56:48,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-01-10 01:56:48,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-01-10 01:56:48,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-01-10 01:56:48,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-01-10 01:56:48,940 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:56:49,137 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:56:49,139 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:56:49,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:56:49,330 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:56:49,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:56:49 BoogieIcfgContainer [2025-01-10 01:56:49,338 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:56:49,338 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:56:49,338 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:56:49,338 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:56:49,339 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:56:43" (3/4) ... [2025-01-10 01:56:49,340 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:56:49,343 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-10 01:56:49,343 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 01:56:49,345 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 01:56:49,346 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:56:49,346 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:56:49,346 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:56:49,392 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:56:49,392 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:56:49,392 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:56:49,393 INFO L158 Benchmark]: Toolchain (without parser) took 6839.72ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 95.4MB in the end (delta: 37.6MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2025-01-10 01:56:49,393 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:56:49,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.54ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 122.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:56:49,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.44ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 120.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:56:49,394 INFO L158 Benchmark]: Boogie Preprocessor took 29.56ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 119.4MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:56:49,394 INFO L158 Benchmark]: RCFGBuilder took 233.97ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 108.0MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:56:49,394 INFO L158 Benchmark]: TraceAbstraction took 6281.49ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 101.4MB in the end (delta: 5.8MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. [2025-01-10 01:56:49,394 INFO L158 Benchmark]: Witness Printer took 54.29ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 95.4MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:56:49,395 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.26ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.54ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 122.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.44ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 120.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.56ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 119.4MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 233.97ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 108.0MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6281.49ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 101.4MB in the end (delta: 5.8MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. * Witness Printer took 54.29ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 95.4MB in the end (delta: 6.0MB). 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: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 37 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 12, TraceHistogramMax: 9, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 553 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 553 mSDsluCounter, 1413 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1084 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 878 IncrementalHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 329 mSDtfsCounter, 878 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 748 GetRequests, 538 SyntacticMatches, 21 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=10, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 109 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 773 NumberOfCodeBlocks, 773 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1030 ConstructedInterpolants, 0 QuantifiedInterpolants, 1934 SizeOfPredicates, 34 NumberOfNonLiveVariables, 791 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 24 InterpolantComputations, 7 PerfectInterpolantSequences, 1263/1542 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 4 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((counter <= 5) && (3 <= counter)) || ((6 <= counter) && (counter <= 2147483645))) || ((counter <= 3) && (1 <= counter))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((counter == 0) || (((counter == 5) || (counter < 5)) && (1 <= counter))) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:56:49,410 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