./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-multidimensional/max-3-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/max-3-n-u.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 6c8d330fcf7e017e6b51632eb7a9f8f167fb4f3e932700b6ef82da7b1572a2f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:36:54,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:36:54,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:36:54,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:36:54,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:36:54,810 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:36:54,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:36:54,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:36:54,811 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:36:54,811 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:36:54,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:36:54,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:36:54,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:36:54,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:36:54,811 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:36:54,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:36:54,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:36:54,811 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:36:54,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:36:54,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:36:54,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:36:54,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:36:54,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:36:54,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:36:54,812 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:36:54,812 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:36:54,812 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:36:54,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:36:54,812 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:36:54,812 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:36:54,812 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:36:54,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:36:54,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:36:54,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:36:54,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:36:54,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:36:54,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:36:54,812 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:36:54,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:36:54,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:36:54,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:36:54,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:36:54,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:36:54,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:36:54,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:36:54,813 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/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 -> 6c8d330fcf7e017e6b51632eb7a9f8f167fb4f3e932700b6ef82da7b1572a2f0 [2025-03-09 01:36:55,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:36:55,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:36:55,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:36:55,036 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:36:55,037 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:36:55,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/max-3-n-u.c [2025-03-09 01:36:56,190 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91becdd6/42167b658d724af4915e8b8bff4a3d68/FLAG3d2965142 [2025-03-09 01:36:56,425 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:36:56,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/max-3-n-u.c [2025-03-09 01:36:56,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91becdd6/42167b658d724af4915e8b8bff4a3d68/FLAG3d2965142 [2025-03-09 01:36:56,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91becdd6/42167b658d724af4915e8b8bff4a3d68 [2025-03-09 01:36:56,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:36:56,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:36:56,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:36:56,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:36:56,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:36:56,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:36:56" (1/1) ... [2025-03-09 01:36:56,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24bab302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:56, skipping insertion in model container [2025-03-09 01:36:56,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:36:56" (1/1) ... [2025-03-09 01:36:56,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:36:56,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:36:56,917 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:36:56,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:36:56,951 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:36:56,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:56 WrapperNode [2025-03-09 01:36:56,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:36:56,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:36:56,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:36:56,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:36:56,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:56" (1/1) ... [2025-03-09 01:36:56,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:56" (1/1) ... [2025-03-09 01:36:56,979 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2025-03-09 01:36:56,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:36:56,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:36:56,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:36:56,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:36:56,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:56" (1/1) ... [2025-03-09 01:36:56,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:56" (1/1) ... [2025-03-09 01:36:56,991 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:56" (1/1) ... [2025-03-09 01:36:57,001 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-09 01:36:57,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:56" (1/1) ... [2025-03-09 01:36:57,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:56" (1/1) ... [2025-03-09 01:36:57,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:56" (1/1) ... [2025-03-09 01:36:57,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:56" (1/1) ... [2025-03-09 01:36:57,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:56" (1/1) ... [2025-03-09 01:36:57,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:56" (1/1) ... [2025-03-09 01:36:57,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:36:57,015 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:36:57,015 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:36:57,015 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:36:57,016 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:56" (1/1) ... [2025-03-09 01:36:57,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:36:57,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:57,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:36:57,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:36:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:36:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:36:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:36:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:36:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:36:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:36:57,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:36:57,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:36:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:36:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:36:57,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:36:57,148 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:36:57,149 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:36:57,317 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset; [2025-03-09 01:36:57,329 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-09 01:36:57,329 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:36:57,336 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:36:57,336 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:36:57,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:36:57 BoogieIcfgContainer [2025-03-09 01:36:57,336 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:36:57,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:36:57,338 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:36:57,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:36:57,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:36:56" (1/3) ... [2025-03-09 01:36:57,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c794590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:36:57, skipping insertion in model container [2025-03-09 01:36:57,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:56" (2/3) ... [2025-03-09 01:36:57,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c794590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:36:57, skipping insertion in model container [2025-03-09 01:36:57,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:36:57" (3/3) ... [2025-03-09 01:36:57,343 INFO L128 eAbstractionObserver]: Analyzing ICFG max-3-n-u.c [2025-03-09 01:36:57,354 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:36:57,355 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG max-3-n-u.c that has 1 procedures, 55 locations, 1 initial locations, 9 loop locations, and 18 error locations. [2025-03-09 01:36:57,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:36:57,397 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;@6543f39a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:36:57,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-09 01:36:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 54 states have internal predecessors, (65), 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-03-09 01:36:57,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:36:57,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:57,404 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:36:57,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:36:57,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:57,407 INFO L85 PathProgramCache]: Analyzing trace with hash 91581460, now seen corresponding path program 1 times [2025-03-09 01:36:57,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:57,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261537979] [2025-03-09 01:36:57,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:57,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:57,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:36:57,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:36:57,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:57,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:57,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:57,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261537979] [2025-03-09 01:36:57,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261537979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:57,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:36:57,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:36:57,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180361130] [2025-03-09 01:36:57,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:57,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:36:57,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:57,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:36:57,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:36:57,613 INFO L87 Difference]: Start difference. First operand has 55 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 54 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:57,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:57,712 INFO L93 Difference]: Finished difference Result 135 states and 169 transitions. [2025-03-09 01:36:57,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:36:57,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 01:36:57,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:57,719 INFO L225 Difference]: With dead ends: 135 [2025-03-09 01:36:57,719 INFO L226 Difference]: Without dead ends: 77 [2025-03-09 01:36:57,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:36:57,725 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 88 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:57,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 85 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:57,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-09 01:36:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-03-09 01:36:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.6981132075471699) internal successors, (90), 70 states have internal predecessors, (90), 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-03-09 01:36:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2025-03-09 01:36:57,761 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 5 [2025-03-09 01:36:57,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:57,761 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2025-03-09 01:36:57,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2025-03-09 01:36:57,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:36:57,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:57,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:36:57,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:36:57,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:36:57,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:57,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1455942659, now seen corresponding path program 1 times [2025-03-09 01:36:57,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:57,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091494607] [2025-03-09 01:36:57,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:57,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:57,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:36:57,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:36:57,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:57,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:57,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:57,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:57,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091494607] [2025-03-09 01:36:57,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091494607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:57,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:36:57,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:36:57,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832403303] [2025-03-09 01:36:57,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:57,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:36:57,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:57,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:36:57,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:36:57,841 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:57,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:57,910 INFO L93 Difference]: Finished difference Result 101 states and 134 transitions. [2025-03-09 01:36:57,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:36:57,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 01:36:57,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:57,912 INFO L225 Difference]: With dead ends: 101 [2025-03-09 01:36:57,912 INFO L226 Difference]: Without dead ends: 95 [2025-03-09 01:36:57,912 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-03-09 01:36:57,912 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:57,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 83 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-09 01:36:57,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-09 01:36:57,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.5844155844155845) internal successors, (122), 94 states have internal predecessors, (122), 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-03-09 01:36:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2025-03-09 01:36:57,928 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 6 [2025-03-09 01:36:57,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:57,929 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2025-03-09 01:36:57,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2025-03-09 01:36:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:36:57,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:57,929 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:36:57,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:36:57,929 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:36:57,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:57,930 INFO L85 PathProgramCache]: Analyzing trace with hash 886993979, now seen corresponding path program 1 times [2025-03-09 01:36:57,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:57,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742054817] [2025-03-09 01:36:57,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:57,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:57,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:36:57,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:36:57,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:57,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:58,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:58,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:58,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742054817] [2025-03-09 01:36:58,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742054817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:58,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801836741] [2025-03-09 01:36:58,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:58,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:58,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:58,029 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:58,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:36:58,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:36:58,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:36:58,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:58,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:58,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:36:58,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:58,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:36:58,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801836741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:58,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:36:58,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 01:36:58,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028426275] [2025-03-09 01:36:58,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:58,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:36:58,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:58,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:36:58,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:36:58,121 INFO L87 Difference]: Start difference. First operand 95 states and 122 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:58,201 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2025-03-09 01:36:58,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:36:58,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 01:36:58,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:58,202 INFO L225 Difference]: With dead ends: 95 [2025-03-09 01:36:58,202 INFO L226 Difference]: Without dead ends: 92 [2025-03-09 01:36:58,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:36:58,203 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 17 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:58,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 114 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-09 01:36:58,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-09 01:36:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 91 states have internal predecessors, (116), 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-03-09 01:36:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2025-03-09 01:36:58,211 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 9 [2025-03-09 01:36:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:58,212 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2025-03-09 01:36:58,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2025-03-09 01:36:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:36:58,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:58,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:36:58,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:36:58,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:58,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:36:58,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:58,414 INFO L85 PathProgramCache]: Analyzing trace with hash 887794577, now seen corresponding path program 1 times [2025-03-09 01:36:58,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:58,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092703015] [2025-03-09 01:36:58,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:58,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:58,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:36:58,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:36:58,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:58,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:58,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:58,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092703015] [2025-03-09 01:36:58,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092703015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:58,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:36:58,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:36:58,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994206102] [2025-03-09 01:36:58,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:58,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:36:58,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:58,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:36:58,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:36:58,479 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:58,540 INFO L93 Difference]: Finished difference Result 182 states and 230 transitions. [2025-03-09 01:36:58,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:36:58,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-09 01:36:58,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:58,544 INFO L225 Difference]: With dead ends: 182 [2025-03-09 01:36:58,544 INFO L226 Difference]: Without dead ends: 92 [2025-03-09 01:36:58,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:36:58,545 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 63 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:58,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 80 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:58,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-09 01:36:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-09 01:36:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 91 states have internal predecessors, (110), 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-03-09 01:36:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2025-03-09 01:36:58,554 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 9 [2025-03-09 01:36:58,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:58,554 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2025-03-09 01:36:58,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:58,555 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2025-03-09 01:36:58,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 01:36:58,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:58,555 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:36:58,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:36:58,555 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:36:58,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:58,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1727009599, now seen corresponding path program 1 times [2025-03-09 01:36:58,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:58,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566696798] [2025-03-09 01:36:58,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:58,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:58,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:36:58,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:36:58,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:58,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:58,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:58,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566696798] [2025-03-09 01:36:58,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566696798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:58,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595033508] [2025-03-09 01:36:58,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:58,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:58,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:58,603 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:58,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:36:58,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:36:58,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:36:58,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:58,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:58,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:36:58,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:58,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:58,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595033508] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:58,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:58,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 01:36:58,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7037992] [2025-03-09 01:36:58,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:58,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:36:58,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:58,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:36:58,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:36:58,695 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:58,788 INFO L93 Difference]: Finished difference Result 167 states and 224 transitions. [2025-03-09 01:36:58,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:36:58,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-09 01:36:58,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:58,792 INFO L225 Difference]: With dead ends: 167 [2025-03-09 01:36:58,793 INFO L226 Difference]: Without dead ends: 164 [2025-03-09 01:36:58,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:36:58,793 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 40 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:58,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 160 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:58,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-09 01:36:58,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-09 01:36:58,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 149 states have (on average 1.3825503355704698) internal successors, (206), 163 states have internal predecessors, (206), 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-03-09 01:36:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 206 transitions. [2025-03-09 01:36:58,806 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 206 transitions. Word has length 10 [2025-03-09 01:36:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:58,806 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 206 transitions. [2025-03-09 01:36:58,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:58,807 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2025-03-09 01:36:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 01:36:58,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:58,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:36:58,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:36:59,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:59,010 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:36:59,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:59,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1799649939, now seen corresponding path program 1 times [2025-03-09 01:36:59,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:59,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841392807] [2025-03-09 01:36:59,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:59,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:59,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:36:59,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:36:59,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:59,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:59,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:36:59,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:59,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841392807] [2025-03-09 01:36:59,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841392807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:59,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:36:59,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:36:59,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481823044] [2025-03-09 01:36:59,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:59,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:36:59,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:59,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:36:59,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:36:59,057 INFO L87 Difference]: Start difference. First operand 164 states and 206 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-03-09 01:36:59,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:59,106 INFO L93 Difference]: Finished difference Result 326 states and 410 transitions. [2025-03-09 01:36:59,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:36:59,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2025-03-09 01:36:59,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:59,107 INFO L225 Difference]: With dead ends: 326 [2025-03-09 01:36:59,107 INFO L226 Difference]: Without dead ends: 320 [2025-03-09 01:36:59,108 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-03-09 01:36:59,108 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 34 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:59,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 75 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:36:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-09 01:36:59,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 311. [2025-03-09 01:36:59,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 296 states have (on average 1.364864864864865) internal successors, (404), 310 states have internal predecessors, (404), 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-03-09 01:36:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 404 transitions. [2025-03-09 01:36:59,131 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 404 transitions. Word has length 12 [2025-03-09 01:36:59,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:59,131 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 404 transitions. [2025-03-09 01:36:59,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-03-09 01:36:59,133 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 404 transitions. [2025-03-09 01:36:59,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:36:59,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:59,133 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:36:59,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:36:59,133 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:36:59,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:59,134 INFO L85 PathProgramCache]: Analyzing trace with hash -411817131, now seen corresponding path program 1 times [2025-03-09 01:36:59,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:59,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634481546] [2025-03-09 01:36:59,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:59,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:59,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:36:59,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:36:59,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:59,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:36:59,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:59,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634481546] [2025-03-09 01:36:59,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634481546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:59,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318022997] [2025-03-09 01:36:59,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:59,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:59,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:59,196 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:59,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:36:59,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:36:59,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:36:59,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:59,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:59,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:36:59,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:59,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:36:59,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:36:59,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318022997] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:59,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:59,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2025-03-09 01:36:59,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883442484] [2025-03-09 01:36:59,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:59,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:36:59,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:59,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:36:59,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:36:59,298 INFO L87 Difference]: Start difference. First operand 311 states and 404 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:59,654 INFO L93 Difference]: Finished difference Result 603 states and 783 transitions. [2025-03-09 01:36:59,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:36:59,655 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-09 01:36:59,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:59,656 INFO L225 Difference]: With dead ends: 603 [2025-03-09 01:36:59,656 INFO L226 Difference]: Without dead ends: 311 [2025-03-09 01:36:59,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:36:59,657 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 377 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:59,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 119 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:36:59,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-09 01:36:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 308. [2025-03-09 01:36:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 296 states have (on average 1.222972972972973) internal successors, (362), 307 states have internal predecessors, (362), 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-03-09 01:36:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 362 transitions. [2025-03-09 01:36:59,681 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 362 transitions. Word has length 16 [2025-03-09 01:36:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:59,681 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 362 transitions. [2025-03-09 01:36:59,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 362 transitions. [2025-03-09 01:36:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 01:36:59,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:59,683 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1] [2025-03-09 01:36:59,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:36:59,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:59,887 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:36:59,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:59,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1230523709, now seen corresponding path program 2 times [2025-03-09 01:36:59,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:59,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92261208] [2025-03-09 01:36:59,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:36:59,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:59,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:36:59,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-09 01:36:59,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:36:59,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:59,928 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:36:59,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:59,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92261208] [2025-03-09 01:36:59,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92261208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:59,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297524590] [2025-03-09 01:36:59,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:36:59,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:59,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:59,930 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:59,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:36:59,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-09 01:36:59,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-09 01:36:59,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:36:59,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:59,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:36:59,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:36:59,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:37:00,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297524590] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:00,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:00,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:37:00,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326896546] [2025-03-09 01:37:00,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:00,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:37:00,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:00,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:37:00,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:37:00,033 INFO L87 Difference]: Start difference. First operand 308 states and 362 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:00,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:00,075 INFO L93 Difference]: Finished difference Result 308 states and 362 transitions. [2025-03-09 01:37:00,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:37:00,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-09 01:37:00,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:00,077 INFO L225 Difference]: With dead ends: 308 [2025-03-09 01:37:00,077 INFO L226 Difference]: Without dead ends: 305 [2025-03-09 01:37:00,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:37:00,077 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 98 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:00,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 100 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:37:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-09 01:37:00,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 269. [2025-03-09 01:37:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 260 states have (on average 1.1923076923076923) internal successors, (310), 268 states have internal predecessors, (310), 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-03-09 01:37:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 310 transitions. [2025-03-09 01:37:00,090 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 310 transitions. Word has length 19 [2025-03-09 01:37:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:00,090 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 310 transitions. [2025-03-09 01:37:00,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 310 transitions. [2025-03-09 01:37:00,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 01:37:00,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:00,091 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:37:00,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:37:00,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:00,292 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:37:00,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:00,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1508971195, now seen corresponding path program 1 times [2025-03-09 01:37:00,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:00,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555181813] [2025-03-09 01:37:00,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:00,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:00,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:37:00,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:37:00,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:00,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-09 01:37:00,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:00,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555181813] [2025-03-09 01:37:00,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555181813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:00,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344251831] [2025-03-09 01:37:00,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:00,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:00,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:00,356 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:00,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:37:00,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:37:00,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:37:00,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:00,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:00,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:37:00,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:00,507 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 01:37:00,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 01:37:00,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344251831] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:00,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:00,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 8, 8] total 16 [2025-03-09 01:37:00,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867008575] [2025-03-09 01:37:00,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:00,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:37:00,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:00,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:37:00,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:37:00,587 INFO L87 Difference]: Start difference. First operand 269 states and 310 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:01,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:01,219 INFO L93 Difference]: Finished difference Result 1073 states and 1323 transitions. [2025-03-09 01:37:01,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-09 01:37:01,220 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-09 01:37:01,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:01,222 INFO L225 Difference]: With dead ends: 1073 [2025-03-09 01:37:01,222 INFO L226 Difference]: Without dead ends: 821 [2025-03-09 01:37:01,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2025-03-09 01:37:01,224 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 1250 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:01,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 154 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:37:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-03-09 01:37:01,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 821. [2025-03-09 01:37:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 812 states have (on average 1.1305418719211822) internal successors, (918), 820 states have internal predecessors, (918), 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-03-09 01:37:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 918 transitions. [2025-03-09 01:37:01,253 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 918 transitions. Word has length 35 [2025-03-09 01:37:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:01,253 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 918 transitions. [2025-03-09 01:37:01,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:01,254 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 918 transitions. [2025-03-09 01:37:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-09 01:37:01,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:01,258 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:37:01,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:37:01,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:01,458 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:37:01,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:01,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1610523535, now seen corresponding path program 1 times [2025-03-09 01:37:01,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:01,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237568196] [2025-03-09 01:37:01,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:01,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:01,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-09 01:37:01,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 01:37:01,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:01,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 0 proven. 329 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-09 01:37:01,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:01,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237568196] [2025-03-09 01:37:01,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237568196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:01,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096768988] [2025-03-09 01:37:01,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:01,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:01,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:01,599 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:01,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:37:01,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-09 01:37:01,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 01:37:01,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:01,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:01,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:37:01,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:01,905 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 325 proven. 145 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-09 01:37:01,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:02,121 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 325 proven. 145 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-09 01:37:02,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096768988] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:02,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:02,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 14, 14] total 28 [2025-03-09 01:37:02,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583092095] [2025-03-09 01:37:02,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:02,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 01:37:02,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:02,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 01:37:02,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=449, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:37:02,123 INFO L87 Difference]: Start difference. First operand 821 states and 918 transitions. Second operand has 28 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 28 states have internal predecessors, (103), 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-03-09 01:37:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:03,483 INFO L93 Difference]: Finished difference Result 2471 states and 2951 transitions. [2025-03-09 01:37:03,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-09 01:37:03,483 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 28 states have internal predecessors, (103), 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 77 [2025-03-09 01:37:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:03,488 INFO L225 Difference]: With dead ends: 2471 [2025-03-09 01:37:03,488 INFO L226 Difference]: Without dead ends: 1685 [2025-03-09 01:37:03,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1254 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1549, Invalid=3853, Unknown=0, NotChecked=0, Total=5402 [2025-03-09 01:37:03,491 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 2297 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2297 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:03,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2297 Valid, 328 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 01:37:03,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2025-03-09 01:37:03,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1682. [2025-03-09 01:37:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1676 states have (on average 1.1044152744630071) internal successors, (1851), 1681 states have internal predecessors, (1851), 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-03-09 01:37:03,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 1851 transitions. [2025-03-09 01:37:03,561 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 1851 transitions. Word has length 77 [2025-03-09 01:37:03,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:03,561 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 1851 transitions. [2025-03-09 01:37:03,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.6785714285714284) internal successors, (103), 28 states have internal predecessors, (103), 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-03-09 01:37:03,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 1851 transitions. [2025-03-09 01:37:03,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-09 01:37:03,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:03,564 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 01:37:03,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:37:03,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:03,765 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:37:03,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:03,765 INFO L85 PathProgramCache]: Analyzing trace with hash 217004225, now seen corresponding path program 1 times [2025-03-09 01:37:03,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:03,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132354140] [2025-03-09 01:37:03,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:03,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:03,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-09 01:37:03,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-09 01:37:03,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:03,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2938 backedges. 0 proven. 1506 refuted. 0 times theorem prover too weak. 1432 trivial. 0 not checked. [2025-03-09 01:37:03,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:03,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132354140] [2025-03-09 01:37:03,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132354140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:03,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007512690] [2025-03-09 01:37:03,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:03,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:03,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:03,962 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:03,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:37:04,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-09 01:37:04,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-09 01:37:04,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:04,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:04,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 01:37:04,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2938 backedges. 1501 proven. 715 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-09 01:37:04,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2938 backedges. 1501 proven. 715 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-09 01:37:05,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007512690] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:05,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:05,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 26, 26] total 52 [2025-03-09 01:37:05,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368437377] [2025-03-09 01:37:05,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:05,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-09 01:37:05,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:05,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-09 01:37:05,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1184, Invalid=1468, Unknown=0, NotChecked=0, Total=2652 [2025-03-09 01:37:05,096 INFO L87 Difference]: Start difference. First operand 1682 states and 1851 transitions. Second operand has 52 states, 52 states have (on average 3.3846153846153846) internal successors, (176), 52 states have internal predecessors, (176), 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-03-09 01:37:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:10,360 INFO L93 Difference]: Finished difference Result 6728 states and 8011 transitions. [2025-03-09 01:37:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2025-03-09 01:37:10,360 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3846153846153846) internal successors, (176), 52 states have internal predecessors, (176), 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 150 [2025-03-09 01:37:10,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:10,374 INFO L225 Difference]: With dead ends: 6728 [2025-03-09 01:37:10,374 INFO L226 Difference]: Without dead ends: 5117 [2025-03-09 01:37:10,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9180 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=9913, Invalid=18479, Unknown=0, NotChecked=0, Total=28392 [2025-03-09 01:37:10,380 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 8043 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 1150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8043 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1150 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:10,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8043 Valid, 276 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1150 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 01:37:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5117 states. [2025-03-09 01:37:10,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5117 to 5111. [2025-03-09 01:37:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5111 states, 5105 states have (on average 1.0934378060724779) internal successors, (5582), 5110 states have internal predecessors, (5582), 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-03-09 01:37:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5111 states to 5111 states and 5582 transitions. [2025-03-09 01:37:10,541 INFO L78 Accepts]: Start accepts. Automaton has 5111 states and 5582 transitions. Word has length 150 [2025-03-09 01:37:10,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:10,542 INFO L471 AbstractCegarLoop]: Abstraction has 5111 states and 5582 transitions. [2025-03-09 01:37:10,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3846153846153846) internal successors, (176), 52 states have internal predecessors, (176), 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-03-09 01:37:10,542 INFO L276 IsEmpty]: Start isEmpty. Operand 5111 states and 5582 transitions. [2025-03-09 01:37:10,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-09 01:37:10,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:10,551 INFO L218 NwaCegarLoop]: trace histogram [138, 138, 138, 3, 3, 3, 2, 1, 1, 1, 1] [2025-03-09 01:37:10,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:37:10,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:10,753 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:37:10,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:10,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1222908936, now seen corresponding path program 2 times [2025-03-09 01:37:10,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:10,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022664195] [2025-03-09 01:37:10,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:10,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:10,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 429 statements into 2 equivalence classes. [2025-03-09 01:37:10,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 429 statements. [2025-03-09 01:37:10,805 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:37:10,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:10,826 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2025-03-09 01:37:10,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:10,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022664195] [2025-03-09 01:37:10,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022664195] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:10,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377509146] [2025-03-09 01:37:10,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:10,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:10,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:10,828 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:10,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:37:10,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 429 statements into 2 equivalence classes. [2025-03-09 01:37:10,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 429 statements. [2025-03-09 01:37:10,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:37:10,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:10,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:37:10,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2025-03-09 01:37:11,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2025-03-09 01:37:11,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377509146] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:11,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:11,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:37:11,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494104227] [2025-03-09 01:37:11,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:11,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:37:11,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:11,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:37:11,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:37:11,680 INFO L87 Difference]: Start difference. First operand 5111 states and 5582 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:11,806 INFO L93 Difference]: Finished difference Result 5111 states and 5582 transitions. [2025-03-09 01:37:11,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:37:11,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 429 [2025-03-09 01:37:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:11,820 INFO L225 Difference]: With dead ends: 5111 [2025-03-09 01:37:11,820 INFO L226 Difference]: Without dead ends: 5108 [2025-03-09 01:37:11,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:37:11,822 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 70 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:11,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 43 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:37:11,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5108 states. [2025-03-09 01:37:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5108 to 1733. [2025-03-09 01:37:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1730 states have (on average 1.0953757225433527) internal successors, (1895), 1732 states have internal predecessors, (1895), 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-03-09 01:37:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 1895 transitions. [2025-03-09 01:37:11,915 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 1895 transitions. Word has length 429 [2025-03-09 01:37:11,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:11,915 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 1895 transitions. [2025-03-09 01:37:11,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:11,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 1895 transitions. [2025-03-09 01:37:11,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-03-09 01:37:11,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:11,920 INFO L218 NwaCegarLoop]: trace histogram [138, 138, 138, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2025-03-09 01:37:11,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:37:12,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 01:37:12,125 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-09 01:37:12,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:12,125 INFO L85 PathProgramCache]: Analyzing trace with hash -539099103, now seen corresponding path program 2 times [2025-03-09 01:37:12,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:12,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111950466] [2025-03-09 01:37:12,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:12,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:12,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 440 statements into 2 equivalence classes. [2025-03-09 01:37:12,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 440 statements. [2025-03-09 01:37:12,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:37:12,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 28806 backedges. 0 proven. 12898 refuted. 0 times theorem prover too weak. 15908 trivial. 0 not checked. [2025-03-09 01:37:12,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:12,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111950466] [2025-03-09 01:37:12,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111950466] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:12,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123669493] [2025-03-09 01:37:12,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:12,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:12,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:12,204 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:12,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:37:12,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 440 statements into 2 equivalence classes. [2025-03-09 01:37:12,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 440 statements. [2025-03-09 01:37:12,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:37:12,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:12,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:37:12,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 28806 backedges. 0 proven. 12898 refuted. 0 times theorem prover too weak. 15908 trivial. 0 not checked. [2025-03-09 01:37:12,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:13,076 INFO L134 CoverageAnalysis]: Checked inductivity of 28806 backedges. 0 proven. 12898 refuted. 0 times theorem prover too weak. 15908 trivial. 0 not checked. [2025-03-09 01:37:13,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123669493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:13,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:13,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:37:13,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677419311] [2025-03-09 01:37:13,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:13,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:37:13,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:13,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:37:13,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:37:13,078 INFO L87 Difference]: Start difference. First operand 1733 states and 1895 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 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-03-09 01:37:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:13,166 INFO L93 Difference]: Finished difference Result 1733 states and 1895 transitions. [2025-03-09 01:37:13,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:37:13,166 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), 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 440 [2025-03-09 01:37:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:13,167 INFO L225 Difference]: With dead ends: 1733 [2025-03-09 01:37:13,168 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:37:13,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 883 GetRequests, 877 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:37:13,170 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 114 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:13,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 28 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:37:13,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:37:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:37:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:37:13,171 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 440 [2025-03-09 01:37:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:13,172 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:37:13,172 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), 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-03-09 01:37:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:37:13,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:37:13,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-09 01:37:13,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-03-09 01:37:13,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-09 01:37:13,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-09 01:37:13,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-09 01:37:13,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-09 01:37:13,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-09 01:37:13,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-09 01:37:13,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-09 01:37:13,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-09 01:37:13,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-09 01:37:13,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-09 01:37:13,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-09 01:37:13,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-09 01:37:13,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-09 01:37:13,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-09 01:37:13,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-09 01:37:13,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-09 01:37:13,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:37:13,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-09 01:37:13,379 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:13,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:37:24,595 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:37:24,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:37:24 BoogieIcfgContainer [2025-03-09 01:37:24,619 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:37:24,623 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:37:24,623 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:37:24,623 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:37:24,624 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:36:57" (3/4) ... [2025-03-09 01:37:24,625 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:37:24,636 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 01:37:24,636 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:37:24,637 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:37:24,637 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:37:24,713 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:37:24,713 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:37:24,713 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:37:24,714 INFO L158 Benchmark]: Toolchain (without parser) took 27945.60ms. Allocated memory was 167.8MB in the beginning and 805.3MB in the end (delta: 637.5MB). Free memory was 122.9MB in the beginning and 481.0MB in the end (delta: -358.1MB). Peak memory consumption was 274.9MB. Max. memory is 16.1GB. [2025-03-09 01:37:24,714 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:37:24,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.86ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 111.5MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:37:24,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.71ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 110.5MB in the end (delta: 983.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:37:24,714 INFO L158 Benchmark]: Boogie Preprocessor took 32.62ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 109.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:37:24,715 INFO L158 Benchmark]: IcfgBuilder took 321.27ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 93.6MB in the end (delta: 15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:37:24,715 INFO L158 Benchmark]: TraceAbstraction took 27280.60ms. Allocated memory was 167.8MB in the beginning and 805.3MB in the end (delta: 637.5MB). Free memory was 93.2MB in the beginning and 489.4MB in the end (delta: -396.2MB). Peak memory consumption was 454.9MB. Max. memory is 16.1GB. [2025-03-09 01:37:24,715 INFO L158 Benchmark]: Witness Printer took 90.12ms. Allocated memory is still 805.3MB. Free memory was 489.4MB in the beginning and 481.0MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:37:24,718 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.86ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 111.5MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.71ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 110.5MB in the end (delta: 983.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.62ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 109.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 321.27ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 93.6MB in the end (delta: 15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 27280.60ms. Allocated memory was 167.8MB in the beginning and 805.3MB in the end (delta: 637.5MB). Free memory was 93.2MB in the beginning and 489.4MB in the end (delta: -396.2MB). Peak memory consumption was 454.9MB. Max. memory is 16.1GB. * Witness Printer took 90.12ms. Allocated memory is still 805.3MB. Free memory was 489.4MB in the beginning and 481.0MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 55 locations, 65 edges, 18 error locations. Started 1 CEGAR loops. OverallTime: 16.0s, OverallIterations: 13, TraceHistogramMax: 138, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12500 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12500 mSDsluCounter, 1645 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1180 mSDsCounter, 1755 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2090 IncrementalHoareTripleChecker+Invalid, 3845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1755 mSolverCounterUnsat, 465 mSDtfsCounter, 2090 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2589 GetRequests, 2259 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10960 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5111occurred in iteration=11, InterpolantAutomatonStates: 278, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 3438 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2402 NumberOfCodeBlocks, 666 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3548 ConstructedInterpolants, 0 QuantifiedInterpolants, 10648 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1414 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 102842/183898 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 66]: Location Invariant Derived location invariant: ((((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (p == 1800)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (p == 1800)) && (n == 1500))) - InvariantResult [Line: 30]: Location Invariant Derived location invariant: ((((((m <= 1000) && (i <= 999)) && ((((((1 <= i) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500)) || ((((((1 <= i) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)))) || ((m <= 1000) && (((((((i == 0) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)) || (((((i == 0) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))))) || ((m <= 1000) && ((((((((i == 0) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((i == 0) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) || (((m <= 1000) && (i <= 999)) && ((((((((1 <= i) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((1 <= i) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) - InvariantResult [Line: 25]: Location Invariant Derived location invariant: ((((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (p == 1800)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (p == 1800)) && (n == 1500))) - InvariantResult [Line: 28]: Location Invariant Derived location invariant: ((((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500)) || ((((((m <= 1000) && (i == 0)) && (1 <= j)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))) || ((((((m <= 1000) && (1 <= i)) && (i <= 999)) && (p == 1800)) && (j == 0)) && (n == 1500))) - InvariantResult [Line: 71]: Location Invariant Derived location invariant: ((((((m <= 1000) && (i <= 999)) && ((((((1 <= i) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500)) || ((((((1 <= i) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)))) || ((m <= 1000) && (((((((i == 0) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)) || (((((i == 0) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))))) || ((m <= 1000) && ((((((((i == 0) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((i == 0) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) || (((m <= 1000) && (i <= 999)) && ((((((((1 <= i) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((1 <= i) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) - InvariantResult [Line: 45]: Location Invariant Derived location invariant: ((((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (p == 1800)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (p == 1800)) && (n == 1500))) - InvariantResult [Line: 69]: Location Invariant Derived location invariant: ((((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500)) || ((((((m <= 1000) && (i == 0)) && (1 <= j)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))) || ((((((m <= 1000) && (1 <= i)) && (i <= 999)) && (p == 1800)) && (j == 0)) && (n == 1500))) - InvariantResult [Line: 50]: Location Invariant Derived location invariant: ((((((m <= 1000) && (i <= 999)) && ((((((1 <= i) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500)) || ((((((1 <= i) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)))) || ((m <= 1000) && (((((((i == 0) && (1 <= j)) && (k == 0)) && (p == 1800)) && (n == 1500)) && (j <= 1499)) || (((((i == 0) && (k == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))))) || ((m <= 1000) && ((((((((i == 0) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((i == 0) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) || (((m <= 1000) && (i <= 999)) && ((((((((1 <= i) && (1 <= j)) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (n == 1500)) && (j <= 1499)) || ((((((1 <= i) && (p == 1800)) && (k <= 2147483646)) && (1 <= k)) && (j == 0)) && (n == 1500))))) - InvariantResult [Line: 48]: Location Invariant Derived location invariant: ((((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500)) || ((((((m <= 1000) && (i == 0)) && (1 <= j)) && (p == 1800)) && (j <= 2147483646)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (p == 1800)) && (j == 0)) && (n == 1500))) || ((((((m <= 1000) && (1 <= i)) && (i <= 999)) && (p == 1800)) && (j == 0)) && (n == 1500))) RESULT: Ultimate proved your program to be correct! [2025-03-09 01:37:24,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE