./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2dec1b2e3c1461164aa09bac8cca047a14ba0fda75d53737804411255b62653a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:02:05,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:02:05,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:02:05,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:02:05,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:02:05,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:02:05,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:02:05,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:02:05,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:02:05,729 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:02:05,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:02:05,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:02:05,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:02:05,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:02:05,731 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:02:05,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:02:05,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:02:05,731 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:02:05,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:02:05,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:02:05,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:02:05,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:02:05,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:02:05,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:02:05,732 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:02:05,732 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:02:05,732 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:02:05,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:02:05,732 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:02:05,732 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:02:05,733 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:02:05,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:02:05,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:02:05,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:02:05,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:02:05,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:02:05,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:02:05,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:02:05,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:02:05,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:02:05,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:02:05,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:02:05,734 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:02:05,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:02:05,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:02:05,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:02:05,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:02:05,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:02:05,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:02:05,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:02:05,734 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 -> 2dec1b2e3c1461164aa09bac8cca047a14ba0fda75d53737804411255b62653a [2025-01-10 02:02:05,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:02:05,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:02:05,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:02:05,974 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:02:05,974 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:02:05,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c [2025-01-10 02:02:07,136 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/479e38961/1fc89d595662415ca03d560415b3decc/FLAG32ad79069 [2025-01-10 02:02:07,431 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:02:07,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c [2025-01-10 02:02:07,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/479e38961/1fc89d595662415ca03d560415b3decc/FLAG32ad79069 [2025-01-10 02:02:07,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/479e38961/1fc89d595662415ca03d560415b3decc [2025-01-10 02:02:07,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:02:07,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:02:07,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:02:07,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:02:07,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:02:07,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:02:07" (1/1) ... [2025-01-10 02:02:07,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3413566d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:07, skipping insertion in model container [2025-01-10 02:02:07,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:02:07" (1/1) ... [2025-01-10 02:02:07,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:02:07,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:02:07,900 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:02:07,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:02:07,937 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:02:07,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:07 WrapperNode [2025-01-10 02:02:07,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:02:07,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:02:07,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:02:07,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:02:07,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:07" (1/1) ... [2025-01-10 02:02:07,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:07" (1/1) ... [2025-01-10 02:02:07,961 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 169 [2025-01-10 02:02:07,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:02:07,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:02:07,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:02:07,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:02:07,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:07" (1/1) ... [2025-01-10 02:02:07,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:07" (1/1) ... [2025-01-10 02:02:07,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:07" (1/1) ... [2025-01-10 02:02:07,979 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 02:02:07,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:07" (1/1) ... [2025-01-10 02:02:07,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:07" (1/1) ... [2025-01-10 02:02:07,982 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:07" (1/1) ... [2025-01-10 02:02:07,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:07" (1/1) ... [2025-01-10 02:02:07,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:07" (1/1) ... [2025-01-10 02:02:07,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:07" (1/1) ... [2025-01-10 02:02:07,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:07" (1/1) ... [2025-01-10 02:02:07,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:02:07,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:02:07,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:02:07,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:02:07,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:07" (1/1) ... [2025-01-10 02:02:07,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:02:08,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:08,020 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 02:02:08,022 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 02:02:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:02:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 02:02:08,039 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 02:02:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:02:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:02:08,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:02:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:02:08,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:02:08,077 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:02:08,079 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:02:08,467 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2025-01-10 02:02:08,467 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:02:08,484 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:02:08,484 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-10 02:02:08,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:02:08 BoogieIcfgContainer [2025-01-10 02:02:08,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:02:08,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:02:08,490 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:02:08,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:02:08,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:02:07" (1/3) ... [2025-01-10 02:02:08,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ade2d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:02:08, skipping insertion in model container [2025-01-10 02:02:08,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:07" (2/3) ... [2025-01-10 02:02:08,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ade2d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:02:08, skipping insertion in model container [2025-01-10 02:02:08,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:02:08" (3/3) ... [2025-01-10 02:02:08,499 INFO L128 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound20.c [2025-01-10 02:02:08,521 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:02:08,523 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fermat1-ll_unwindbound20.c that has 3 procedures, 227 locations, 1 initial locations, 3 loop locations, and 98 error locations. [2025-01-10 02:02:08,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:02:08,572 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;@44bc5fa0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:02:08,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2025-01-10 02:02:08,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 218 states have internal predecessors, (229), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:02:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 02:02:08,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:08,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 02:02:08,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:08,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:08,582 INFO L85 PathProgramCache]: Analyzing trace with hash 29856, now seen corresponding path program 1 times [2025-01-10 02:02:08,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:08,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400317575] [2025-01-10 02:02:08,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:08,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:08,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 02:02:08,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 02:02:08,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:08,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:02:08,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:08,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400317575] [2025-01-10 02:02:08,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400317575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:08,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:08,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:02:08,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127609361] [2025-01-10 02:02:08,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:08,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:02:08,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:08,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:02:08,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:08,705 INFO L87 Difference]: Start difference. First operand has 227 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 218 states have internal predecessors, (229), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 02:02:08,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:08,795 INFO L93 Difference]: Finished difference Result 427 states and 471 transitions. [2025-01-10 02:02:08,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:02:08,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-01-10 02:02:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:08,803 INFO L225 Difference]: With dead ends: 427 [2025-01-10 02:02:08,803 INFO L226 Difference]: Without dead ends: 206 [2025-01-10 02:02:08,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:08,811 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 13 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:08,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 394 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:02:08,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-10 02:02:08,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-01-10 02:02:08,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 115 states have (on average 1.7739130434782608) internal successors, (204), 198 states have internal predecessors, (204), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:02:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 214 transitions. [2025-01-10 02:02:08,860 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 214 transitions. Word has length 3 [2025-01-10 02:02:08,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:08,861 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 214 transitions. [2025-01-10 02:02:08,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 02:02:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 214 transitions. [2025-01-10 02:02:08,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 02:02:08,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:08,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 02:02:08,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:02:08,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:08,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:08,863 INFO L85 PathProgramCache]: Analyzing trace with hash 925572, now seen corresponding path program 1 times [2025-01-10 02:02:08,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:08,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595866504] [2025-01-10 02:02:08,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:08,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:08,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 02:02:08,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 02:02:08,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:08,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:08,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:02:08,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:08,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595866504] [2025-01-10 02:02:08,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595866504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:08,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:08,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:02:08,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934233967] [2025-01-10 02:02:08,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:08,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:02:08,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:08,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:02:08,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:08,905 INFO L87 Difference]: Start difference. First operand 206 states and 214 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 02:02:08,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:08,945 INFO L93 Difference]: Finished difference Result 206 states and 214 transitions. [2025-01-10 02:02:08,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:02:08,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 02:02:08,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:08,946 INFO L225 Difference]: With dead ends: 206 [2025-01-10 02:02:08,946 INFO L226 Difference]: Without dead ends: 202 [2025-01-10 02:02:08,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:08,947 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 12 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:08,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 381 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:02:08,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-10 02:02:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-01-10 02:02:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 115 states have (on average 1.7391304347826086) internal successors, (200), 194 states have internal predecessors, (200), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:02:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 210 transitions. [2025-01-10 02:02:08,956 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 210 transitions. Word has length 4 [2025-01-10 02:02:08,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:08,956 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 210 transitions. [2025-01-10 02:02:08,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 02:02:08,956 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 210 transitions. [2025-01-10 02:02:08,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 02:02:08,957 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:08,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:08,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:02:08,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:08,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:08,959 INFO L85 PathProgramCache]: Analyzing trace with hash 87858952, now seen corresponding path program 1 times [2025-01-10 02:02:08,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:08,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103270786] [2025-01-10 02:02:08,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:08,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:08,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:02:08,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:02:08,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:08,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:02:08,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1473944373] [2025-01-10 02:02:08,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:08,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:08,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:08,979 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 02:02:08,981 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 02:02:09,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:02:09,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:02:09,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:09,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:09,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:02:09,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:02:09,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:02:09,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:09,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103270786] [2025-01-10 02:02:09,056 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:02:09,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473944373] [2025-01-10 02:02:09,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473944373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:09,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:09,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:02:09,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72478501] [2025-01-10 02:02:09,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:09,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:02:09,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:09,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:02:09,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:09,058 INFO L87 Difference]: Start difference. First operand 202 states and 210 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:02:09,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:09,093 INFO L93 Difference]: Finished difference Result 202 states and 210 transitions. [2025-01-10 02:02:09,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:02:09,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 02:02:09,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:09,095 INFO L225 Difference]: With dead ends: 202 [2025-01-10 02:02:09,095 INFO L226 Difference]: Without dead ends: 200 [2025-01-10 02:02:09,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:09,095 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 8 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:09,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 381 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:02:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-01-10 02:02:09,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-01-10 02:02:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 115 states have (on average 1.7217391304347827) internal successors, (198), 192 states have internal predecessors, (198), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:02:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 208 transitions. [2025-01-10 02:02:09,112 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 208 transitions. Word has length 8 [2025-01-10 02:02:09,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:09,112 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 208 transitions. [2025-01-10 02:02:09,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 02:02:09,113 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 208 transitions. [2025-01-10 02:02:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 02:02:09,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:09,113 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:09,121 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 02:02:09,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:09,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:09,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:09,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1897916790, now seen corresponding path program 1 times [2025-01-10 02:02:09,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:09,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934918652] [2025-01-10 02:02:09,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:09,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:09,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 02:02:09,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:02:09,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:09,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:02:09,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2129795812] [2025-01-10 02:02:09,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:09,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:09,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:09,361 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 02:02:09,380 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 02:02:09,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 02:02:09,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:02:09,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:09,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:09,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 02:02:09,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:09,448 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 02:02:09,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:02:09,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:09,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934918652] [2025-01-10 02:02:09,449 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:02:09,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129795812] [2025-01-10 02:02:09,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129795812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:09,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:09,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:02:09,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825994666] [2025-01-10 02:02:09,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:09,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:02:09,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:09,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:02:09,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:09,450 INFO L87 Difference]: Start difference. First operand 200 states and 208 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 02:02:09,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:09,491 INFO L93 Difference]: Finished difference Result 200 states and 208 transitions. [2025-01-10 02:02:09,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:02:09,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 25 [2025-01-10 02:02:09,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:09,493 INFO L225 Difference]: With dead ends: 200 [2025-01-10 02:02:09,495 INFO L226 Difference]: Without dead ends: 198 [2025-01-10 02:02:09,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:09,496 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 162 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:09,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 188 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:02:09,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-01-10 02:02:09,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-01-10 02:02:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 190 states have internal predecessors, (196), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:02:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 206 transitions. [2025-01-10 02:02:09,508 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 206 transitions. Word has length 25 [2025-01-10 02:02:09,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:09,509 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 206 transitions. [2025-01-10 02:02:09,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 02:02:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 206 transitions. [2025-01-10 02:02:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 02:02:09,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:09,509 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:09,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 02:02:09,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:09,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:09,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:09,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1294121716, now seen corresponding path program 1 times [2025-01-10 02:02:09,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:09,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816560405] [2025-01-10 02:02:09,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:09,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:09,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:02:09,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:02:09,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:09,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:02:09,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:09,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816560405] [2025-01-10 02:02:09,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816560405] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:02:09,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529632476] [2025-01-10 02:02:09,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:09,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:09,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:09,860 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 02:02:09,861 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 02:02:09,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:02:09,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:02:09,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:09,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:09,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 02:02:09,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:02:09,968 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:02:09,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529632476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:09,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:02:09,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 02:02:09,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507893761] [2025-01-10 02:02:09,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:09,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:02:09,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:09,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:02:09,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:02:09,970 INFO L87 Difference]: Start difference. First operand 198 states and 206 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:02:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:10,076 INFO L93 Difference]: Finished difference Result 198 states and 206 transitions. [2025-01-10 02:02:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:02:10,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-01-10 02:02:10,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:10,078 INFO L225 Difference]: With dead ends: 198 [2025-01-10 02:02:10,078 INFO L226 Difference]: Without dead ends: 196 [2025-01-10 02:02:10,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:02:10,079 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 161 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:10,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 675 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:02:10,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-01-10 02:02:10,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-01-10 02:02:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 115 states have (on average 1.6869565217391305) internal successors, (194), 188 states have internal predecessors, (194), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:02:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 204 transitions. [2025-01-10 02:02:10,085 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 204 transitions. Word has length 26 [2025-01-10 02:02:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:10,085 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 204 transitions. [2025-01-10 02:02:10,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:02:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 204 transitions. [2025-01-10 02:02:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 02:02:10,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:10,086 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:10,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 02:02:10,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:10,290 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:10,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:10,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1889544650, now seen corresponding path program 1 times [2025-01-10 02:02:10,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:10,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51233870] [2025-01-10 02:02:10,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:10,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:10,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 02:02:10,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 02:02:10,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:10,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:10,338 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 02:02:10,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:10,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51233870] [2025-01-10 02:02:10,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51233870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:10,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:10,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:02:10,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663011221] [2025-01-10 02:02:10,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:10,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:02:10,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:10,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:02:10,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:02:10,339 INFO L87 Difference]: Start difference. First operand 196 states and 204 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 02:02:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:10,367 INFO L93 Difference]: Finished difference Result 275 states and 284 transitions. [2025-01-10 02:02:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:02:10,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 28 [2025-01-10 02:02:10,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:10,369 INFO L225 Difference]: With dead ends: 275 [2025-01-10 02:02:10,369 INFO L226 Difference]: Without dead ends: 274 [2025-01-10 02:02:10,369 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 02:02:10,370 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 84 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:10,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 567 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:02:10,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-01-10 02:02:10,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 223. [2025-01-10 02:02:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 140 states have (on average 1.6928571428571428) internal successors, (237), 214 states have internal predecessors, (237), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:02:10,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2025-01-10 02:02:10,377 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 28 [2025-01-10 02:02:10,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:10,378 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2025-01-10 02:02:10,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 02:02:10,378 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2025-01-10 02:02:10,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 02:02:10,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:10,378 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:10,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 02:02:10,379 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:10,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:10,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1553658064, now seen corresponding path program 1 times [2025-01-10 02:02:10,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:10,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080526556] [2025-01-10 02:02:10,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:10,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:10,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 02:02:10,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 02:02:10,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:10,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:10,425 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 02:02:10,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:10,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080526556] [2025-01-10 02:02:10,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080526556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:10,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:10,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:02:10,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072342087] [2025-01-10 02:02:10,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:10,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:02:10,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:10,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:02:10,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:02:10,427 INFO L87 Difference]: Start difference. First operand 223 states and 249 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 02:02:10,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:10,472 INFO L93 Difference]: Finished difference Result 252 states and 276 transitions. [2025-01-10 02:02:10,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:02:10,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 29 [2025-01-10 02:02:10,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:10,474 INFO L225 Difference]: With dead ends: 252 [2025-01-10 02:02:10,474 INFO L226 Difference]: Without dead ends: 223 [2025-01-10 02:02:10,475 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 02:02:10,475 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 8 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:10,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 570 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:02:10,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-01-10 02:02:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-01-10 02:02:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 140 states have (on average 1.6785714285714286) internal successors, (235), 214 states have internal predecessors, (235), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:02:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 247 transitions. [2025-01-10 02:02:10,488 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 247 transitions. Word has length 29 [2025-01-10 02:02:10,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:10,488 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 247 transitions. [2025-01-10 02:02:10,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 02:02:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 247 transitions. [2025-01-10 02:02:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 02:02:10,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:10,489 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:10,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:02:10,489 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:10,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:10,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1583217163, now seen corresponding path program 1 times [2025-01-10 02:02:10,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:10,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416716221] [2025-01-10 02:02:10,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:10,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:10,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 02:02:10,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 02:02:10,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:10,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:10,541 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 02:02:10,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:10,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416716221] [2025-01-10 02:02:10,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416716221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:10,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:10,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:02:10,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596139068] [2025-01-10 02:02:10,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:10,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:02:10,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:10,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:02:10,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:10,542 INFO L87 Difference]: Start difference. First operand 223 states and 247 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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 02:02:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:10,610 INFO L93 Difference]: Finished difference Result 275 states and 301 transitions. [2025-01-10 02:02:10,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:02:10,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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 31 [2025-01-10 02:02:10,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:10,611 INFO L225 Difference]: With dead ends: 275 [2025-01-10 02:02:10,611 INFO L226 Difference]: Without dead ends: 272 [2025-01-10 02:02:10,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:10,612 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 141 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:10,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 274 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:02:10,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-01-10 02:02:10,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 238. [2025-01-10 02:02:10,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 155 states have (on average 1.664516129032258) internal successors, (258), 229 states have internal predecessors, (258), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:02:10,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 270 transitions. [2025-01-10 02:02:10,622 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 270 transitions. Word has length 31 [2025-01-10 02:02:10,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:10,622 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 270 transitions. [2025-01-10 02:02:10,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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 02:02:10,623 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 270 transitions. [2025-01-10 02:02:10,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 02:02:10,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:10,623 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:10,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:02:10,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:10,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:10,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1835091717, now seen corresponding path program 1 times [2025-01-10 02:02:10,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:10,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102532528] [2025-01-10 02:02:10,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:10,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:10,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 02:02:10,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 02:02:10,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:10,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:10,683 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 02:02:10,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:10,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102532528] [2025-01-10 02:02:10,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102532528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:10,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:10,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:02:10,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115542332] [2025-01-10 02:02:10,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:10,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:02:10,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:10,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:02:10,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:02:10,684 INFO L87 Difference]: Start difference. First operand 238 states and 270 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 02:02:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:10,782 INFO L93 Difference]: Finished difference Result 278 states and 303 transitions. [2025-01-10 02:02:10,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:02:10,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 32 [2025-01-10 02:02:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:10,783 INFO L225 Difference]: With dead ends: 278 [2025-01-10 02:02:10,783 INFO L226 Difference]: Without dead ends: 275 [2025-01-10 02:02:10,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:02:10,784 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 151 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:10,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 431 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:02:10,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-01-10 02:02:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 241. [2025-01-10 02:02:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 232 states have internal predecessors, (260), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:02:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2025-01-10 02:02:10,791 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 32 [2025-01-10 02:02:10,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:10,791 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2025-01-10 02:02:10,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 02:02:10,791 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2025-01-10 02:02:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-10 02:02:10,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:10,792 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:10,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 02:02:10,792 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:10,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:10,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1053268297, now seen corresponding path program 1 times [2025-01-10 02:02:10,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:10,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882891440] [2025-01-10 02:02:10,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:10,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:10,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 02:02:10,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 02:02:10,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:10,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:02:10,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1595736508] [2025-01-10 02:02:10,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:10,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:10,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:10,808 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 02:02:10,809 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 02:02:10,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 02:02:10,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 02:02:10,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:10,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:10,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 02:02:10,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:10,870 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 02:02:10,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:02:10,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:10,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882891440] [2025-01-10 02:02:10,871 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:02:10,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595736508] [2025-01-10 02:02:10,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595736508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:10,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:10,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:02:10,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188575603] [2025-01-10 02:02:10,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:10,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:02:10,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:10,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:02:10,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:10,871 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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 02:02:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:10,959 INFO L93 Difference]: Finished difference Result 390 states and 436 transitions. [2025-01-10 02:02:10,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:02:10,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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 33 [2025-01-10 02:02:10,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:10,964 INFO L225 Difference]: With dead ends: 390 [2025-01-10 02:02:10,964 INFO L226 Difference]: Without dead ends: 387 [2025-01-10 02:02:10,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:10,965 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 139 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:10,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 368 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:02:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-10 02:02:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 313. [2025-01-10 02:02:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 227 states have (on average 1.669603524229075) internal successors, (379), 301 states have internal predecessors, (379), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:02:10,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 397 transitions. [2025-01-10 02:02:10,976 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 397 transitions. Word has length 33 [2025-01-10 02:02:10,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:10,976 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 397 transitions. [2025-01-10 02:02:10,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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 02:02:10,976 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 397 transitions. [2025-01-10 02:02:10,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 02:02:10,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:10,977 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:10,984 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 02:02:11,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 02:02:11,178 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:11,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:11,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1708421245, now seen corresponding path program 1 times [2025-01-10 02:02:11,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:11,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861023613] [2025-01-10 02:02:11,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:11,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:11,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 02:02:11,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 02:02:11,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:11,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:02:11,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:11,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861023613] [2025-01-10 02:02:11,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861023613] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:02:11,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303330219] [2025-01-10 02:02:11,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:11,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:11,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:11,290 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 02:02:11,291 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 02:02:11,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 02:02:11,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 02:02:11,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:11,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:11,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:02:11,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:02:11,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:02:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:02:11,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303330219] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:02:11,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:02:11,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 02:02:11,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82685728] [2025-01-10 02:02:11,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:02:11,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 02:02:11,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:11,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 02:02:11,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:02:11,659 INFO L87 Difference]: Start difference. First operand 313 states and 397 transitions. Second operand has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:02:11,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:11,973 INFO L93 Difference]: Finished difference Result 430 states and 471 transitions. [2025-01-10 02:02:11,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:02:11,974 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2025-01-10 02:02:11,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:11,975 INFO L225 Difference]: With dead ends: 430 [2025-01-10 02:02:11,975 INFO L226 Difference]: Without dead ends: 427 [2025-01-10 02:02:11,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-01-10 02:02:11,976 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 689 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:11,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1091 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:02:11,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-01-10 02:02:11,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 319. [2025-01-10 02:02:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 233 states have (on average 1.648068669527897) internal successors, (384), 307 states have internal predecessors, (384), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:02:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 402 transitions. [2025-01-10 02:02:11,993 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 402 transitions. Word has length 34 [2025-01-10 02:02:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:11,993 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 402 transitions. [2025-01-10 02:02:11,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:02:11,994 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 402 transitions. [2025-01-10 02:02:11,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 02:02:11,994 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:11,994 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:12,002 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 02:02:12,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 02:02:12,195 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:12,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1115312127, now seen corresponding path program 1 times [2025-01-10 02:02:12,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:12,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322416105] [2025-01-10 02:02:12,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:12,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:12,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 02:02:12,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:02:12,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:12,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:02:12,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1111901353] [2025-01-10 02:02:12,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:12,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:12,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:12,214 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 02:02:12,221 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 02:02:12,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 02:02:12,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:02:12,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:12,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:12,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:02:12,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:02:12,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:02:12,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:12,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322416105] [2025-01-10 02:02:12,540 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:02:12,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111901353] [2025-01-10 02:02:12,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111901353] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:02:12,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:02:12,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-01-10 02:02:12,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42670737] [2025-01-10 02:02:12,541 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:02:12,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:02:12,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:12,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:02:12,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:02:12,542 INFO L87 Difference]: Start difference. First operand 319 states and 402 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:02:15,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:15,247 INFO L93 Difference]: Finished difference Result 499 states and 616 transitions. [2025-01-10 02:02:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:02:15,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2025-01-10 02:02:15,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:15,250 INFO L225 Difference]: With dead ends: 499 [2025-01-10 02:02:15,250 INFO L226 Difference]: Without dead ends: 472 [2025-01-10 02:02:15,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:02:15,251 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 428 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:15,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 520 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-10 02:02:15,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-01-10 02:02:15,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 438. [2025-01-10 02:02:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 349 states have (on average 1.5501432664756447) internal successors, (541), 423 states have internal predecessors, (541), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 02:02:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 565 transitions. [2025-01-10 02:02:15,282 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 565 transitions. Word has length 36 [2025-01-10 02:02:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:15,283 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 565 transitions. [2025-01-10 02:02:15,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:02:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 565 transitions. [2025-01-10 02:02:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-10 02:02:15,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:15,283 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:15,290 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 02:02:15,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 02:02:15,484 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:15,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:15,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1926867071, now seen corresponding path program 1 times [2025-01-10 02:02:15,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:15,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540163234] [2025-01-10 02:02:15,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:15,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:15,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 02:02:15,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 02:02:15,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:15,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:02:15,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [64312747] [2025-01-10 02:02:15,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:15,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:15,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:15,511 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 02:02:15,513 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 02:02:15,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 02:02:15,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 02:02:15,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:15,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:15,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:02:15,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:15,577 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 02:02:15,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:02:15,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:15,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540163234] [2025-01-10 02:02:15,577 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:02:15,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64312747] [2025-01-10 02:02:15,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64312747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:15,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:15,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:02:15,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190341818] [2025-01-10 02:02:15,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:15,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:02:15,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:15,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:02:15,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:15,578 INFO L87 Difference]: Start difference. First operand 438 states and 565 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 02:02:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:15,773 INFO L93 Difference]: Finished difference Result 630 states and 798 transitions. [2025-01-10 02:02:15,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:02:15,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 38 [2025-01-10 02:02:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:15,776 INFO L225 Difference]: With dead ends: 630 [2025-01-10 02:02:15,776 INFO L226 Difference]: Without dead ends: 589 [2025-01-10 02:02:15,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:15,776 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 117 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:15,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 277 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:02:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-01-10 02:02:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 557. [2025-01-10 02:02:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 465 states have (on average 1.4903225806451612) internal successors, (693), 539 states have internal predecessors, (693), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-10 02:02:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 723 transitions. [2025-01-10 02:02:15,799 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 723 transitions. Word has length 38 [2025-01-10 02:02:15,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:15,800 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 723 transitions. [2025-01-10 02:02:15,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 02:02:15,800 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 723 transitions. [2025-01-10 02:02:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 02:02:15,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:15,802 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:15,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 02:02:16,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:16,003 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:16,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:16,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1281840888, now seen corresponding path program 1 times [2025-01-10 02:02:16,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:16,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710539702] [2025-01-10 02:02:16,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:16,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:16,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 02:02:16,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 02:02:16,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:16,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:16,102 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 02:02:16,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:16,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710539702] [2025-01-10 02:02:16,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710539702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:16,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:16,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:02:16,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786241287] [2025-01-10 02:02:16,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:16,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:02:16,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:16,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:02:16,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:02:16,104 INFO L87 Difference]: Start difference. First operand 557 states and 723 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 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 02:02:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:16,186 INFO L93 Difference]: Finished difference Result 645 states and 824 transitions. [2025-01-10 02:02:16,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:02:16,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 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 56 [2025-01-10 02:02:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:16,189 INFO L225 Difference]: With dead ends: 645 [2025-01-10 02:02:16,189 INFO L226 Difference]: Without dead ends: 644 [2025-01-10 02:02:16,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:02:16,190 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 63 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:16,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 940 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:02:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-01-10 02:02:16,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 618. [2025-01-10 02:02:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 523 states have (on average 1.4780114722753346) internal successors, (773), 596 states have internal predecessors, (773), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 02:02:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 807 transitions. [2025-01-10 02:02:16,221 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 807 transitions. Word has length 56 [2025-01-10 02:02:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:16,221 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 807 transitions. [2025-01-10 02:02:16,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 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 02:02:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 807 transitions. [2025-01-10 02:02:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-10 02:02:16,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:16,223 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:16,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 02:02:16,223 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:16,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:16,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1082361990, now seen corresponding path program 1 times [2025-01-10 02:02:16,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:16,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174647431] [2025-01-10 02:02:16,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:16,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:16,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-10 02:02:16,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 02:02:16,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:16,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:16,370 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 02:02:16,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:16,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174647431] [2025-01-10 02:02:16,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174647431] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:16,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:16,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:02:16,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735389331] [2025-01-10 02:02:16,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:16,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:02:16,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:16,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:02:16,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:02:16,371 INFO L87 Difference]: Start difference. First operand 618 states and 807 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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 02:02:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:16,576 INFO L93 Difference]: Finished difference Result 1126 states and 1480 transitions. [2025-01-10 02:02:16,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:02:16,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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 57 [2025-01-10 02:02:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:16,579 INFO L225 Difference]: With dead ends: 1126 [2025-01-10 02:02:16,579 INFO L226 Difference]: Without dead ends: 618 [2025-01-10 02:02:16,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:02:16,580 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 20 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:16,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 776 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:02:16,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-01-10 02:02:16,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2025-01-10 02:02:16,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 523 states have (on average 1.474187380497132) internal successors, (771), 596 states have internal predecessors, (771), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 02:02:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 805 transitions. [2025-01-10 02:02:16,641 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 805 transitions. Word has length 57 [2025-01-10 02:02:16,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:16,642 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 805 transitions. [2025-01-10 02:02:16,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 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 02:02:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 805 transitions. [2025-01-10 02:02:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-10 02:02:16,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:16,642 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:16,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 02:02:16,643 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:16,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:16,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1653751556, now seen corresponding path program 1 times [2025-01-10 02:02:16,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:16,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866475526] [2025-01-10 02:02:16,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:16,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:16,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-10 02:02:16,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-10 02:02:16,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:16,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:16,742 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:02:16,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:16,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866475526] [2025-01-10 02:02:16,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866475526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:16,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:16,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:02:16,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078915014] [2025-01-10 02:02:16,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:16,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:02:16,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:16,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:02:16,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:02:16,744 INFO L87 Difference]: Start difference. First operand 618 states and 805 transitions. Second operand has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 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 02:02:16,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:16,992 INFO L93 Difference]: Finished difference Result 651 states and 806 transitions. [2025-01-10 02:02:16,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:02:16,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 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 83 [2025-01-10 02:02:16,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:16,995 INFO L225 Difference]: With dead ends: 651 [2025-01-10 02:02:16,995 INFO L226 Difference]: Without dead ends: 650 [2025-01-10 02:02:16,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:02:16,995 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 82 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:16,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 379 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:02:16,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-01-10 02:02:17,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 618. [2025-01-10 02:02:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 523 states have (on average 1.468451242829828) internal successors, (768), 596 states have internal predecessors, (768), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 02:02:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 802 transitions. [2025-01-10 02:02:17,023 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 802 transitions. Word has length 83 [2025-01-10 02:02:17,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:17,023 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 802 transitions. [2025-01-10 02:02:17,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 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 02:02:17,023 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 802 transitions. [2025-01-10 02:02:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 02:02:17,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:17,024 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:17,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 02:02:17,024 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:17,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:17,025 INFO L85 PathProgramCache]: Analyzing trace with hash -273309138, now seen corresponding path program 1 times [2025-01-10 02:02:17,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:17,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343910032] [2025-01-10 02:02:17,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:17,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:17,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 02:02:17,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 02:02:17,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:17,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:02:17,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:17,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343910032] [2025-01-10 02:02:17,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343910032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:17,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:17,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:02:17,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258563320] [2025-01-10 02:02:17,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:17,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:02:17,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:17,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:02:17,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:02:17,110 INFO L87 Difference]: Start difference. First operand 618 states and 802 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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 02:02:17,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:17,465 INFO L93 Difference]: Finished difference Result 665 states and 824 transitions. [2025-01-10 02:02:17,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:02:17,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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 84 [2025-01-10 02:02:17,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:17,468 INFO L225 Difference]: With dead ends: 665 [2025-01-10 02:02:17,468 INFO L226 Difference]: Without dead ends: 664 [2025-01-10 02:02:17,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:02:17,468 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 462 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:17,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 318 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:02:17,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-01-10 02:02:17,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 618. [2025-01-10 02:02:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 523 states have (on average 1.462715105162524) internal successors, (765), 596 states have internal predecessors, (765), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 02:02:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 799 transitions. [2025-01-10 02:02:17,507 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 799 transitions. Word has length 84 [2025-01-10 02:02:17,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:17,508 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 799 transitions. [2025-01-10 02:02:17,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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 02:02:17,508 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 799 transitions. [2025-01-10 02:02:17,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-10 02:02:17,508 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:17,509 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:17,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 02:02:17,509 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:17,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:17,509 INFO L85 PathProgramCache]: Analyzing trace with hash -273310676, now seen corresponding path program 1 times [2025-01-10 02:02:17,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:17,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290070069] [2025-01-10 02:02:17,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:17,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-10 02:02:17,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-10 02:02:17,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:17,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:02:17,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:17,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290070069] [2025-01-10 02:02:17,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290070069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:17,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:17,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 02:02:17,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170978472] [2025-01-10 02:02:17,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:17,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:02:17,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:17,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:02:17,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:02:17,611 INFO L87 Difference]: Start difference. First operand 618 states and 799 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:02:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:17,710 INFO L93 Difference]: Finished difference Result 623 states and 802 transitions. [2025-01-10 02:02:17,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 02:02:17,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 84 [2025-01-10 02:02:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:17,713 INFO L225 Difference]: With dead ends: 623 [2025-01-10 02:02:17,713 INFO L226 Difference]: Without dead ends: 620 [2025-01-10 02:02:17,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:02:17,713 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 150 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:17,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 843 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:02:17,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-01-10 02:02:17,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 619. [2025-01-10 02:02:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 526 states have (on average 1.4220532319391634) internal successors, (748), 596 states have internal predecessors, (748), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 02:02:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 782 transitions. [2025-01-10 02:02:17,733 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 782 transitions. Word has length 84 [2025-01-10 02:02:17,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:17,734 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 782 transitions. [2025-01-10 02:02:17,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:02:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 782 transitions. [2025-01-10 02:02:17,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 02:02:17,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:17,735 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:17,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 02:02:17,735 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:17,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:17,735 INFO L85 PathProgramCache]: Analyzing trace with hash 117303828, now seen corresponding path program 1 times [2025-01-10 02:02:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:17,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565160735] [2025-01-10 02:02:17,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:17,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:17,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 02:02:17,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 02:02:17,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:17,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:02:17,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:17,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565160735] [2025-01-10 02:02:17,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565160735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:17,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:17,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 02:02:17,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394441744] [2025-01-10 02:02:17,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:17,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:02:17,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:17,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:02:17,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:02:17,809 INFO L87 Difference]: Start difference. First operand 619 states and 782 transitions. Second operand has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:02:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:17,897 INFO L93 Difference]: Finished difference Result 1140 states and 1447 transitions. [2025-01-10 02:02:17,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 02:02:17,898 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 85 [2025-01-10 02:02:17,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:17,900 INFO L225 Difference]: With dead ends: 1140 [2025-01-10 02:02:17,900 INFO L226 Difference]: Without dead ends: 631 [2025-01-10 02:02:17,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:02:17,901 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 40 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:17,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 994 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:02:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-01-10 02:02:17,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 627. [2025-01-10 02:02:17,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 533 states have (on average 1.4165103189493433) internal successors, (755), 603 states have internal predecessors, (755), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-10 02:02:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 789 transitions. [2025-01-10 02:02:17,921 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 789 transitions. Word has length 85 [2025-01-10 02:02:17,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:17,921 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 789 transitions. [2025-01-10 02:02:17,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:02:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 789 transitions. [2025-01-10 02:02:17,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-10 02:02:17,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:17,922 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:17,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 02:02:17,922 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:17,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:17,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1664853580, now seen corresponding path program 1 times [2025-01-10 02:02:17,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:17,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639169974] [2025-01-10 02:02:17,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:17,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:17,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-10 02:02:17,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-10 02:02:17,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:17,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:02:18,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:18,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639169974] [2025-01-10 02:02:18,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639169974] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:02:18,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648288566] [2025-01-10 02:02:18,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:18,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:18,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:18,011 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:02:18,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 02:02:18,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-10 02:02:18,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-10 02:02:18,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:18,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:18,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 02:02:18,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:02:18,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:02:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:02:18,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648288566] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:02:18,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:02:18,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2025-01-10 02:02:18,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423030919] [2025-01-10 02:02:18,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:02:18,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 02:02:18,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:18,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 02:02:18,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:02:18,269 INFO L87 Difference]: Start difference. First operand 627 states and 789 transitions. Second operand has 14 states, 13 states have (on average 11.76923076923077) internal successors, (153), 14 states have internal predecessors, (153), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-10 02:02:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:18,450 INFO L93 Difference]: Finished difference Result 1051 states and 1298 transitions. [2025-01-10 02:02:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 02:02:18,451 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 11.76923076923077) internal successors, (153), 14 states have internal predecessors, (153), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 89 [2025-01-10 02:02:18,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:18,453 INFO L225 Difference]: With dead ends: 1051 [2025-01-10 02:02:18,453 INFO L226 Difference]: Without dead ends: 733 [2025-01-10 02:02:18,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2025-01-10 02:02:18,454 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 140 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:18,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1851 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:02:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-01-10 02:02:18,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 694. [2025-01-10 02:02:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 596 states have (on average 1.424496644295302) internal successors, (849), 666 states have internal predecessors, (849), 19 states have call successors, (19), 8 states have call predecessors, (19), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-10 02:02:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 887 transitions. [2025-01-10 02:02:18,477 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 887 transitions. Word has length 89 [2025-01-10 02:02:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:18,477 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 887 transitions. [2025-01-10 02:02:18,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 11.76923076923077) internal successors, (153), 14 states have internal predecessors, (153), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-10 02:02:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 887 transitions. [2025-01-10 02:02:18,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-10 02:02:18,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:18,478 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:18,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 02:02:18,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:18,682 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:18,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:18,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2098506895, now seen corresponding path program 1 times [2025-01-10 02:02:18,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:18,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714549459] [2025-01-10 02:02:18,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:18,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:18,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 02:02:18,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 02:02:18,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:18,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:02:18,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:18,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714549459] [2025-01-10 02:02:18,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714549459] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:02:18,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400794853] [2025-01-10 02:02:18,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:18,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:18,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:18,821 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:02:18,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 02:02:18,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 02:02:18,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 02:02:18,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:18,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:18,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:02:18,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:02:19,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:02:19,269 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:02:19,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400794853] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:02:19,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:02:19,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-01-10 02:02:19,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008954168] [2025-01-10 02:02:19,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:02:19,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 02:02:19,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:19,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 02:02:19,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:02:19,271 INFO L87 Difference]: Start difference. First operand 694 states and 887 transitions. Second operand has 14 states, 13 states have (on average 15.923076923076923) internal successors, (207), 14 states have internal predecessors, (207), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-10 02:02:20,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:20,548 INFO L93 Difference]: Finished difference Result 1855 states and 2321 transitions. [2025-01-10 02:02:20,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 02:02:20,548 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 15.923076923076923) internal successors, (207), 14 states have internal predecessors, (207), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 91 [2025-01-10 02:02:20,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:20,554 INFO L225 Difference]: With dead ends: 1855 [2025-01-10 02:02:20,554 INFO L226 Difference]: Without dead ends: 1346 [2025-01-10 02:02:20,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=391, Unknown=0, NotChecked=0, Total=600 [2025-01-10 02:02:20,557 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1990 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1990 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:20,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1990 Valid, 1003 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 02:02:20,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2025-01-10 02:02:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1011. [2025-01-10 02:02:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 903 states have (on average 1.415282392026578) internal successors, (1278), 972 states have internal predecessors, (1278), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-10 02:02:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1338 transitions. [2025-01-10 02:02:20,631 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1338 transitions. Word has length 91 [2025-01-10 02:02:20,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:20,631 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1338 transitions. [2025-01-10 02:02:20,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 15.923076923076923) internal successors, (207), 14 states have internal predecessors, (207), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-10 02:02:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1338 transitions. [2025-01-10 02:02:20,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-10 02:02:20,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:20,634 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:20,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 02:02:20,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:20,835 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-01-10 02:02:20,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:20,836 INFO L85 PathProgramCache]: Analyzing trace with hash -629204169, now seen corresponding path program 1 times [2025-01-10 02:02:20,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:20,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321144283] [2025-01-10 02:02:20,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:20,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:20,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 02:02:20,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 02:02:20,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:20,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:20,918 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:02:20,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:20,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321144283] [2025-01-10 02:02:20,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321144283] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:02:20,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609155964] [2025-01-10 02:02:20,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:20,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:20,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:20,920 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:02:20,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 02:02:20,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 02:02:20,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 02:02:20,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:20,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:20,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:02:20,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:31,208 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~R~0#1_44| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~R~0#1_44| |v_ULTIMATE.start_main_~R~0#1_44|))) (and (<= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse0) (<= .cse0 9223372036854775807)))) is different from true [2025-01-10 02:02:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 6 not checked. [2025-01-10 02:02:31,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:02:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:02:32,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609155964] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:02:32,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:02:32,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-01-10 02:02:32,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492052955] [2025-01-10 02:02:32,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:02:32,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 02:02:32,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:32,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 02:02:32,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=105, Unknown=5, NotChecked=22, Total=182 [2025-01-10 02:02:32,324 INFO L87 Difference]: Start difference. First operand 1011 states and 1338 transitions. Second operand has 14 states, 13 states have (on average 15.384615384615385) internal successors, (200), 14 states have internal predecessors, (200), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 02:02:46,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:02:53,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:02:54,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:02:58,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:04,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:05,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:06,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:10,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:14,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:18,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:22,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:26,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:30,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:31,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:32,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:36,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:40,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:44,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:48,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:49,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]