./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-multidimensional/init-non-constant-3-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/init-non-constant-3-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 df76811034b688387cfe28dd1eb6de91c21580662ac8ddb8163b41c1d6179172 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:36:54,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:36:54,477 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,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:36:54,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:36:54,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:36:54,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:36:54,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:36:54,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:36:54,510 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:36:54,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:36:54,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:36:54,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:36:54,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:36:54,511 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:36:54,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:36:54,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:36:54,512 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:36:54,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:36:54,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:36:54,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:36:54,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:36:54,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:36:54,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:36:54,513 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:36:54,513 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:36:54,513 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:36:54,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:36:54,513 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:36:54,513 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:36:54,513 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:36:54,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:36:54,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:36:54,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:36:54,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:36:54,514 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:36:54,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:36:54,514 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:36:54,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:36:54,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:36:54,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:36:54,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:36:54,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:36:54,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:36:54,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:36:54,515 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 -> df76811034b688387cfe28dd1eb6de91c21580662ac8ddb8163b41c1d6179172 [2025-03-09 01:36:54,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:36:54,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:36:54,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:36:54,756 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:36:54,757 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:36:54,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c [2025-03-09 01:36:55,971 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ddffd0d4/391714276a6647548f2ed6ea8364dc38/FLAG4f17f84f2 [2025-03-09 01:36:56,193 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:36:56,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c [2025-03-09 01:36:56,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ddffd0d4/391714276a6647548f2ed6ea8364dc38/FLAG4f17f84f2 [2025-03-09 01:36:56,541 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ddffd0d4/391714276a6647548f2ed6ea8364dc38 [2025-03-09 01:36:56,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:36:56,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:36:56,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:36:56,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:36:56,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:36:56,548 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,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ef33c 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,549 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,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:36:56,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:36:56,660 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:36:56,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:36:56,687 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:36:56,688 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,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:36:56,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:36:56,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:36:56,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:36:56,695 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,699 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,709 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2025-03-09 01:36:56,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:36:56,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:36:56,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:36:56,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:36:56,716 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,716 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,717 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:56,725 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-09 01:36:56,725 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:56,725 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:56,728 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:56,730 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:56,731 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:56,732 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:56,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:36:56,734 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:36:56,734 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:36:56,734 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:36:56,735 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:56,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:36:56,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:56,760 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:56,762 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:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:36:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:36:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:36:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:36:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:36:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:36:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:36:56,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:36:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:36:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:36:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:36:56,821 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:36:56,822 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:36:56,963 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:56,971 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2025-03-09 01:36:56,971 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:36:56,982 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:36:56,982 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:36:56,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:36:56 BoogieIcfgContainer [2025-03-09 01:36:56,983 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:36:56,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:36:56,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:36:56,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:36:56,989 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:56,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be7ed93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:36:56, skipping insertion in model container [2025-03-09 01:36:56,991 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:56,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be7ed93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:36:56, skipping insertion in model container [2025-03-09 01:36:56,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:36:56" (3/3) ... [2025-03-09 01:36:56,993 INFO L128 eAbstractionObserver]: Analyzing ICFG init-non-constant-3-u.c [2025-03-09 01:36:57,006 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:36:57,008 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG init-non-constant-3-u.c that has 1 procedures, 55 locations, 1 initial locations, 6 loop locations, and 20 error locations. [2025-03-09 01:36:57,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:36:57,065 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;@2aeabd13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:36:57,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-09 01:36:57,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 states have internal predecessors, (61), 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,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:36:57,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:57,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:36:57,086 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:36:57,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:57,089 INFO L85 PathProgramCache]: Analyzing trace with hash 87764232, now seen corresponding path program 1 times [2025-03-09 01:36:57,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:57,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393086044] [2025-03-09 01:36:57,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:57,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:57,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:36:57,154 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,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:57,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:57,264 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,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:57,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393086044] [2025-03-09 01:36:57,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393086044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:57,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:36:57,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:36:57,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342926778] [2025-03-09 01:36:57,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:57,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:36:57,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:57,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:36:57,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:36:57,287 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 states have internal predecessors, (61), 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,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:57,411 INFO L93 Difference]: Finished difference Result 134 states and 163 transitions. [2025-03-09 01:36:57,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:36:57,413 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,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:57,418 INFO L225 Difference]: With dead ends: 134 [2025-03-09 01:36:57,418 INFO L226 Difference]: Without dead ends: 76 [2025-03-09 01:36:57,422 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,424 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 89 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:57,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 50 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-09 01:36:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2025-03-09 01:36:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.75) internal successors, (91), 71 states have internal predecessors, (91), 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,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2025-03-09 01:36:57,460 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 5 [2025-03-09 01:36:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:57,460 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2025-03-09 01:36:57,461 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,461 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2025-03-09 01:36:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:36:57,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:57,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:36:57,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:36:57,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:36:57,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:57,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1574276483, now seen corresponding path program 1 times [2025-03-09 01:36:57,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:57,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650191716] [2025-03-09 01:36:57,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:57,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:57,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:36:57,479 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,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:57,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:57,556 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,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:57,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650191716] [2025-03-09 01:36:57,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650191716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:57,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:36:57,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:36:57,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931207480] [2025-03-09 01:36:57,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:57,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:36:57,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:57,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:36:57,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:36:57,559 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:57,687 INFO L93 Difference]: Finished difference Result 142 states and 180 transitions. [2025-03-09 01:36:57,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:36:57,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:57,690 INFO L225 Difference]: With dead ends: 142 [2025-03-09 01:36:57,690 INFO L226 Difference]: Without dead ends: 134 [2025-03-09 01:36:57,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:36:57,690 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 87 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:57,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 64 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-09 01:36:57,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 122. [2025-03-09 01:36:57,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 102 states have (on average 1.6862745098039216) internal successors, (172), 121 states have internal predecessors, (172), 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,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2025-03-09 01:36:57,707 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 6 [2025-03-09 01:36:57,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:57,707 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2025-03-09 01:36:57,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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,707 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2025-03-09 01:36:57,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:36:57,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:57,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:36:57,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:36:57,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:36:57,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:57,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1051211269, now seen corresponding path program 1 times [2025-03-09 01:36:57,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:57,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508592741] [2025-03-09 01:36:57,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:57,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:57,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:36:57,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:36:57,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:57,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:57,807 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,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:57,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508592741] [2025-03-09 01:36:57,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508592741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:57,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:36:57,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:36:57,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280460335] [2025-03-09 01:36:57,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:57,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:36:57,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:57,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:36:57,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:36:57,809 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:57,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:57,953 INFO L93 Difference]: Finished difference Result 158 states and 198 transitions. [2025-03-09 01:36:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:36:57,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 01:36:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:57,954 INFO L225 Difference]: With dead ends: 158 [2025-03-09 01:36:57,954 INFO L226 Difference]: Without dead ends: 150 [2025-03-09 01:36:57,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:36:57,955 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 84 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:57,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 66 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-09 01:36:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2025-03-09 01:36:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 118 states have (on average 1.6101694915254237) internal successors, (190), 137 states have internal predecessors, (190), 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,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 190 transitions. [2025-03-09 01:36:57,963 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 190 transitions. Word has length 8 [2025-03-09 01:36:57,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:57,963 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 190 transitions. [2025-03-09 01:36:57,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 190 transitions. [2025-03-09 01:36:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 01:36:57,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:57,963 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:36:57,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:36:57,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:36:57,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:57,964 INFO L85 PathProgramCache]: Analyzing trace with hash -879517024, now seen corresponding path program 1 times [2025-03-09 01:36:57,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:57,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653274472] [2025-03-09 01:36:57,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:57,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:57,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:36:57,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:36:57,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:57,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:58,024 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,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:58,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653274472] [2025-03-09 01:36:58,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653274472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:58,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:36:58,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:36:58,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568634995] [2025-03-09 01:36:58,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:58,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:36:58,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:58,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:36:58,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:36:58,026 INFO L87 Difference]: Start difference. First operand 138 states and 190 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:58,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:58,090 INFO L93 Difference]: Finished difference Result 310 states and 445 transitions. [2025-03-09 01:36:58,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:36:58,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-09 01:36:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:58,091 INFO L225 Difference]: With dead ends: 310 [2025-03-09 01:36:58,091 INFO L226 Difference]: Without dead ends: 190 [2025-03-09 01:36:58,093 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,094 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 89 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:58,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 63 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-09 01:36:58,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 186. [2025-03-09 01:36:58,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 166 states have (on average 1.5662650602409638) internal successors, (260), 185 states have internal predecessors, (260), 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,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 260 transitions. [2025-03-09 01:36:58,112 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 260 transitions. Word has length 10 [2025-03-09 01:36:58,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:58,113 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 260 transitions. [2025-03-09 01:36:58,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 260 transitions. [2025-03-09 01:36:58,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:36:58,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:58,113 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:36:58,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:36:58,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:36:58,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:58,114 INFO L85 PathProgramCache]: Analyzing trace with hash -652590671, now seen corresponding path program 1 times [2025-03-09 01:36:58,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:58,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934081289] [2025-03-09 01:36:58,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:58,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:58,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:36:58,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:36:58,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:58,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:58,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:58,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934081289] [2025-03-09 01:36:58,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934081289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:58,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713384439] [2025-03-09 01:36:58,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:58,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:58,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:58,222 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,223 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,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:36:58,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:36:58,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:58,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:58,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:36:58,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:58,389 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:36:58,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713384439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:58,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:36:58,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-09 01:36:58,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816893619] [2025-03-09 01:36:58,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:58,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:36:58,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:58,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:36:58,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:36:58,391 INFO L87 Difference]: Start difference. First operand 186 states and 260 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:58,473 INFO L93 Difference]: Finished difference Result 186 states and 260 transitions. [2025-03-09 01:36:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:36:58,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2025-03-09 01:36:58,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:58,475 INFO L225 Difference]: With dead ends: 186 [2025-03-09 01:36:58,475 INFO L226 Difference]: Without dead ends: 176 [2025-03-09 01:36:58,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:36:58,475 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 41 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:58,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 10 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:58,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-09 01:36:58,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-03-09 01:36:58,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 166 states have (on average 1.3253012048192772) internal successors, (220), 175 states have internal predecessors, (220), 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,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 220 transitions. [2025-03-09 01:36:58,483 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 220 transitions. Word has length 15 [2025-03-09 01:36:58,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:58,483 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 220 transitions. [2025-03-09 01:36:58,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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,483 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 220 transitions. [2025-03-09 01:36:58,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:36:58,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:58,483 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:36:58,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:36:58,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:58,684 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:36:58,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:58,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1244525697, now seen corresponding path program 1 times [2025-03-09 01:36:58,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:58,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032667315] [2025-03-09 01:36:58,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:58,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:58,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:36:58,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:36:58,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:58,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:58,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:58,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032667315] [2025-03-09 01:36:58,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032667315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:58,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782931574] [2025-03-09 01:36:58,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:58,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:58,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:58,796 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,797 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,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:36:58,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:36:58,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:58,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:58,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:36:58,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:58,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:58,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782931574] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:58,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:58,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-09 01:36:58,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36897853] [2025-03-09 01:36:58,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:58,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:36:58,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:58,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:36:58,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:36:58,984 INFO L87 Difference]: Start difference. First operand 176 states and 220 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 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,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:59,427 INFO L93 Difference]: Finished difference Result 368 states and 463 transitions. [2025-03-09 01:36:59,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 01:36:59,427 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 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,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:59,428 INFO L225 Difference]: With dead ends: 368 [2025-03-09 01:36:59,429 INFO L226 Difference]: Without dead ends: 358 [2025-03-09 01:36:59,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=214, Invalid=386, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:36:59,430 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 475 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:59,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 62 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:36:59,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-09 01:36:59,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 348. [2025-03-09 01:36:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 338 states have (on average 1.2692307692307692) internal successors, (429), 347 states have internal predecessors, (429), 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,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 429 transitions. [2025-03-09 01:36:59,461 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 429 transitions. Word has length 16 [2025-03-09 01:36:59,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:59,461 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 429 transitions. [2025-03-09 01:36:59,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 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,462 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 429 transitions. [2025-03-09 01:36:59,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 01:36:59,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:59,462 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:36:59,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:36:59,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 01:36:59,663 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:36:59,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:59,664 INFO L85 PathProgramCache]: Analyzing trace with hash 875671320, now seen corresponding path program 1 times [2025-03-09 01:36:59,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:59,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796566921] [2025-03-09 01:36:59,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:59,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:59,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:36:59,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:36:59,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:59,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:59,715 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:36:59,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:59,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796566921] [2025-03-09 01:36:59,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796566921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:59,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706693227] [2025-03-09 01:36:59,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:59,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:59,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:59,718 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,719 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,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:36:59,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:36:59,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:59,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:59,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:36:59,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:59,796 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 01:36:59,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 01:36:59,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706693227] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:59,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:59,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2025-03-09 01:36:59,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596293198] [2025-03-09 01:36:59,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:59,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:36:59,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:59,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:36:59,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:36:59,829 INFO L87 Difference]: Start difference. First operand 348 states and 429 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:59,967 INFO L93 Difference]: Finished difference Result 856 states and 1101 transitions. [2025-03-09 01:36:59,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:36:59,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 29 [2025-03-09 01:36:59,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:59,969 INFO L225 Difference]: With dead ends: 856 [2025-03-09 01:36:59,969 INFO L226 Difference]: Without dead ends: 540 [2025-03-09 01:36:59,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:36:59,970 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 136 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:59,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 131 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:59,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-09 01:36:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 534. [2025-03-09 01:36:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 524 states have (on average 1.25) internal successors, (655), 533 states have internal predecessors, (655), 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,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 655 transitions. [2025-03-09 01:36:59,991 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 655 transitions. Word has length 29 [2025-03-09 01:36:59,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:59,991 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 655 transitions. [2025-03-09 01:36:59,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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,991 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 655 transitions. [2025-03-09 01:36:59,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 01:36:59,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:59,991 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2025-03-09 01:36:59,997 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:37:00,192 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:37:00,192 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:37:00,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:00,192 INFO L85 PathProgramCache]: Analyzing trace with hash 566546815, now seen corresponding path program 1 times [2025-03-09 01:37:00,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:00,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392149741] [2025-03-09 01:37:00,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:00,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:00,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 01:37:00,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:37:00,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:00,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 01:37:00,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:00,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392149741] [2025-03-09 01:37:00,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392149741] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:00,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740181529] [2025-03-09 01:37:00,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:00,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:00,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:00,254 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:37:00,255 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:37:00,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 01:37:00,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:37:00,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:00,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:00,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:37:00,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:37:00,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:37:00,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740181529] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:00,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:00,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 11 [2025-03-09 01:37:00,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951009042] [2025-03-09 01:37:00,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:00,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:37:00,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:00,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:37:00,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:37:00,403 INFO L87 Difference]: Start difference. First operand 534 states and 655 transitions. Second operand has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 12 states have internal predecessors, (78), 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,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:00,548 INFO L93 Difference]: Finished difference Result 654 states and 815 transitions. [2025-03-09 01:37:00,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:37:00,548 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-09 01:37:00,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:00,550 INFO L225 Difference]: With dead ends: 654 [2025-03-09 01:37:00,551 INFO L226 Difference]: Without dead ends: 652 [2025-03-09 01:37:00,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=177, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:37:00,551 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 254 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:00,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 111 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:00,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-03-09 01:37:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 532. [2025-03-09 01:37:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 524 states have (on average 1.200381679389313) internal successors, (629), 531 states have internal predecessors, (629), 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,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 629 transitions. [2025-03-09 01:37:00,568 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 629 transitions. Word has length 32 [2025-03-09 01:37:00,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:00,568 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 629 transitions. [2025-03-09 01:37:00,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 12 states have internal predecessors, (78), 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,569 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 629 transitions. [2025-03-09 01:37:00,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 01:37:00,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:00,570 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:00,576 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,770 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,770 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:37:00,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:00,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1048894988, now seen corresponding path program 1 times [2025-03-09 01:37:00,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:00,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962075730] [2025-03-09 01:37:00,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:00,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:00,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 01:37:00,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 01:37:00,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:00,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 80 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:37:00,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:00,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962075730] [2025-03-09 01:37:00,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962075730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:00,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426903054] [2025-03-09 01:37:00,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:00,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:00,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:00,903 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,904 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,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 01:37:00,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 01:37:00,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:00,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:00,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:37:00,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 80 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:37:01,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 80 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:37:01,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426903054] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:01,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:01,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-09 01:37:01,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291222779] [2025-03-09 01:37:01,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:01,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:37:01,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:01,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:37:01,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:37:01,169 INFO L87 Difference]: Start difference. First operand 532 states and 629 transitions. Second operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 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,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:01,388 INFO L93 Difference]: Finished difference Result 1721 states and 2099 transitions. [2025-03-09 01:37:01,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:37:01,388 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 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 55 [2025-03-09 01:37:01,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:01,392 INFO L225 Difference]: With dead ends: 1721 [2025-03-09 01:37:01,392 INFO L226 Difference]: Without dead ends: 1222 [2025-03-09 01:37:01,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:37:01,396 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 400 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:01,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 154 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:01,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2025-03-09 01:37:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1204. [2025-03-09 01:37:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1196 states have (on average 1.1881270903010033) internal successors, (1421), 1203 states have internal predecessors, (1421), 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,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1421 transitions. [2025-03-09 01:37:01,442 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1421 transitions. Word has length 55 [2025-03-09 01:37:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:01,444 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1421 transitions. [2025-03-09 01:37:01,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 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,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1421 transitions. [2025-03-09 01:37:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-09 01:37:01,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:01,446 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:01,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:37:01,646 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,647 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:37:01,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:01,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1947409356, now seen corresponding path program 2 times [2025-03-09 01:37:01,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:01,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126971568] [2025-03-09 01:37:01,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:01,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:01,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-03-09 01:37:01,665 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 97 statements. [2025-03-09 01:37:01,665 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:37:01,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-03-09 01:37:01,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:01,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126971568] [2025-03-09 01:37:01,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126971568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:01,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401503829] [2025-03-09 01:37:01,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:01,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:01,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:01,709 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,711 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,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-03-09 01:37:01,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 97 statements. [2025-03-09 01:37:01,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:37:01,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:01,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:37:01,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:02,001 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 153 proven. 48 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-03-09 01:37:02,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:02,144 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2025-03-09 01:37:02,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401503829] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:02,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:02,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-09 01:37:02,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61032020] [2025-03-09 01:37:02,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:02,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:37:02,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:02,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:37:02,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:37:02,146 INFO L87 Difference]: Start difference. First operand 1204 states and 1421 transitions. Second operand has 11 states, 10 states have (on average 7.9) internal successors, (79), 11 states have internal predecessors, (79), 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:02,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:02,421 INFO L93 Difference]: Finished difference Result 1973 states and 2282 transitions. [2025-03-09 01:37:02,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:37:02,421 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.9) internal successors, (79), 11 states have internal predecessors, (79), 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 97 [2025-03-09 01:37:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:02,427 INFO L225 Difference]: With dead ends: 1973 [2025-03-09 01:37:02,427 INFO L226 Difference]: Without dead ends: 1967 [2025-03-09 01:37:02,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:37:02,428 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 99 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:02,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 33 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:37:02,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2025-03-09 01:37:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1627. [2025-03-09 01:37:02,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1619 states have (on average 1.1278567016676961) internal successors, (1826), 1626 states have internal predecessors, (1826), 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:02,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 1826 transitions. [2025-03-09 01:37:02,473 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 1826 transitions. Word has length 97 [2025-03-09 01:37:02,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:02,474 INFO L471 AbstractCegarLoop]: Abstraction has 1627 states and 1826 transitions. [2025-03-09 01:37:02,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.9) internal successors, (79), 11 states have internal predecessors, (79), 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:02,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 1826 transitions. [2025-03-09 01:37:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-09 01:37:02,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:02,478 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:02,493 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:02,693 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:02,693 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:37:02,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:02,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1150755754, now seen corresponding path program 1 times [2025-03-09 01:37:02,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:02,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574313744] [2025-03-09 01:37:02,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:02,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:02,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-09 01:37:02,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-09 01:37:02,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:02,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 759 proven. 1 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2025-03-09 01:37:02,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:02,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574313744] [2025-03-09 01:37:02,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574313744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:02,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579563370] [2025-03-09 01:37:02,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:02,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:02,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:02,859 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:02,860 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:02,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-09 01:37:02,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-09 01:37:02,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:02,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:02,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:37:02,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:03,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 756 proven. 325 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-09 01:37:03,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 756 proven. 325 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-09 01:37:03,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579563370] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:03,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:03,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14, 14] total 28 [2025-03-09 01:37:03,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684732339] [2025-03-09 01:37:03,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:03,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 01:37:03,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:03,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 01:37:03,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=446, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:37:03,400 INFO L87 Difference]: Start difference. First operand 1627 states and 1826 transitions. Second operand has 28 states, 28 states have (on average 6.357142857142857) internal successors, (178), 28 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:04,967 INFO L93 Difference]: Finished difference Result 6754 states and 7834 transitions. [2025-03-09 01:37:04,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-09 01:37:04,968 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.357142857142857) internal successors, (178), 28 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2025-03-09 01:37:04,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:04,981 INFO L225 Difference]: With dead ends: 6754 [2025-03-09 01:37:04,981 INFO L226 Difference]: Without dead ends: 5133 [2025-03-09 01:37:04,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2116 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2483, Invalid=4489, Unknown=0, NotChecked=0, Total=6972 [2025-03-09 01:37:04,985 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 3396 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3396 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:04,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3396 Valid, 99 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:37:04,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2025-03-09 01:37:05,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 3816. [2025-03-09 01:37:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3816 states, 3808 states have (on average 1.1079306722689075) internal successors, (4219), 3815 states have internal predecessors, (4219), 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:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3816 states to 3816 states and 4219 transitions. [2025-03-09 01:37:05,106 INFO L78 Accepts]: Start accepts. Automaton has 3816 states and 4219 transitions. Word has length 159 [2025-03-09 01:37:05,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:05,107 INFO L471 AbstractCegarLoop]: Abstraction has 3816 states and 4219 transitions. [2025-03-09 01:37:05,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.357142857142857) internal successors, (178), 28 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:37:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3816 states and 4219 transitions. [2025-03-09 01:37:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-03-09 01:37:05,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:05,113 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 66, 66, 66, 66, 66, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:05,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:37:05,313 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:05,313 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:37:05,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:05,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1590839763, now seen corresponding path program 2 times [2025-03-09 01:37:05,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:05,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869755395] [2025-03-09 01:37:05,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:05,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:05,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 485 statements into 2 equivalence classes. [2025-03-09 01:37:05,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 485 statements. [2025-03-09 01:37:05,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:37:05,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:05,375 INFO L134 CoverageAnalysis]: Checked inductivity of 15434 backedges. 0 proven. 7077 refuted. 0 times theorem prover too weak. 8357 trivial. 0 not checked. [2025-03-09 01:37:05,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:05,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869755395] [2025-03-09 01:37:05,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869755395] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:05,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430434898] [2025-03-09 01:37:05,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:05,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:05,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:05,377 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:05,379 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:05,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 485 statements into 2 equivalence classes. [2025-03-09 01:37:05,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 485 statements. [2025-03-09 01:37:05,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:37:05,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:05,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:37:05,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15434 backedges. 6876 proven. 201 refuted. 0 times theorem prover too weak. 8357 trivial. 0 not checked. [2025-03-09 01:37:06,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 15434 backedges. 0 proven. 7077 refuted. 0 times theorem prover too weak. 8357 trivial. 0 not checked. [2025-03-09 01:37:06,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430434898] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:06,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:06,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 01:37:06,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962756769] [2025-03-09 01:37:06,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:06,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:37:06,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:06,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:37:06,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:37:06,403 INFO L87 Difference]: Start difference. First operand 3816 states and 4219 transitions. Second operand has 10 states, 9 states have (on average 9.0) internal successors, (81), 10 states have internal predecessors, (81), 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:06,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:06,559 INFO L93 Difference]: Finished difference Result 4227 states and 4722 transitions. [2025-03-09 01:37:06,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:37:06,560 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.0) internal successors, (81), 10 states have internal predecessors, (81), 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 485 [2025-03-09 01:37:06,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:06,568 INFO L225 Difference]: With dead ends: 4227 [2025-03-09 01:37:06,568 INFO L226 Difference]: Without dead ends: 2996 [2025-03-09 01:37:06,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 976 GetRequests, 964 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:37:06,571 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 97 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:06,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 14 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:37:06,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2025-03-09 01:37:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2214. [2025-03-09 01:37:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2214 states, 2212 states have (on average 1.05877034358047) internal successors, (2342), 2213 states have internal predecessors, (2342), 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:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 2342 transitions. [2025-03-09 01:37:06,643 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 2342 transitions. Word has length 485 [2025-03-09 01:37:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:06,644 INFO L471 AbstractCegarLoop]: Abstraction has 2214 states and 2342 transitions. [2025-03-09 01:37:06,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.0) internal successors, (81), 10 states have internal predecessors, (81), 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:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 2342 transitions. [2025-03-09 01:37:06,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-03-09 01:37:06,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:06,651 INFO L218 NwaCegarLoop]: trace histogram [89, 89, 89, 89, 88, 88, 88, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1] [2025-03-09 01:37:06,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 01:37:06,852 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:06,852 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:37:06,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:06,853 INFO L85 PathProgramCache]: Analyzing trace with hash 935536817, now seen corresponding path program 1 times [2025-03-09 01:37:06,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:06,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304132180] [2025-03-09 01:37:06,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:06,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:06,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-03-09 01:37:06,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-03-09 01:37:06,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:06,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:08,485 INFO L134 CoverageAnalysis]: Checked inductivity of 27636 backedges. 10418 proven. 1639 refuted. 0 times theorem prover too weak. 15579 trivial. 0 not checked. [2025-03-09 01:37:08,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:08,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304132180] [2025-03-09 01:37:08,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304132180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:08,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770015542] [2025-03-09 01:37:08,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:08,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:08,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:08,491 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:08,492 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:08,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-03-09 01:37:08,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-03-09 01:37:08,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:08,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:08,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 01:37:08,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 27636 backedges. 10418 proven. 1639 refuted. 0 times theorem prover too weak. 15579 trivial. 0 not checked. [2025-03-09 01:37:09,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 27636 backedges. 10418 proven. 1639 refuted. 0 times theorem prover too weak. 15579 trivial. 0 not checked. [2025-03-09 01:37:09,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770015542] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:09,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:09,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 73 [2025-03-09 01:37:09,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640601586] [2025-03-09 01:37:09,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:09,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-09 01:37:09,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:09,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-09 01:37:09,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=2949, Unknown=0, NotChecked=0, Total=5256 [2025-03-09 01:37:09,942 INFO L87 Difference]: Start difference. First operand 2214 states and 2342 transitions. Second operand has 73 states, 73 states have (on average 6.698630136986301) internal successors, (489), 73 states have internal predecessors, (489), 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,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:11,279 INFO L93 Difference]: Finished difference Result 6573 states and 7236 transitions. [2025-03-09 01:37:11,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-09 01:37:11,280 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 6.698630136986301) internal successors, (489), 73 states have internal predecessors, (489), 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 649 [2025-03-09 01:37:11,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:11,288 INFO L225 Difference]: With dead ends: 6573 [2025-03-09 01:37:11,289 INFO L226 Difference]: Without dead ends: 4518 [2025-03-09 01:37:11,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1345 GetRequests, 1251 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3480, Invalid=5640, Unknown=0, NotChecked=0, Total=9120 [2025-03-09 01:37:11,292 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1973 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1973 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:11,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1973 Valid, 423 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:37:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2025-03-09 01:37:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 4518. [2025-03-09 01:37:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4518 states, 4516 states have (on average 1.0553587245349867) internal successors, (4766), 4517 states have internal predecessors, (4766), 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,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4518 states to 4518 states and 4766 transitions. [2025-03-09 01:37:11,413 INFO L78 Accepts]: Start accepts. Automaton has 4518 states and 4766 transitions. Word has length 649 [2025-03-09 01:37:11,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:11,414 INFO L471 AbstractCegarLoop]: Abstraction has 4518 states and 4766 transitions. [2025-03-09 01:37:11,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 6.698630136986301) internal successors, (489), 73 states have internal predecessors, (489), 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,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4518 states and 4766 transitions. [2025-03-09 01:37:11,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1322 [2025-03-09 01:37:11,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:11,440 INFO L218 NwaCegarLoop]: trace histogram [185, 185, 185, 185, 184, 184, 184, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1] [2025-03-09 01:37:11,448 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:11,641 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:11,641 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:37:11,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:11,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1757792433, now seen corresponding path program 2 times [2025-03-09 01:37:11,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:11,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442135927] [2025-03-09 01:37:11,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:11,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:11,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1321 statements into 2 equivalence classes. [2025-03-09 01:37:11,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 1321 statements. [2025-03-09 01:37:11,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:37:11,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 119556 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 118626 trivial. 0 not checked. [2025-03-09 01:37:11,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:11,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442135927] [2025-03-09 01:37:11,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442135927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:11,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225430540] [2025-03-09 01:37:11,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:11,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:11,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:11,766 INFO L229 MonitoredProcess]: Starting monitored process 11 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:11,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:37:11,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1321 statements into 2 equivalence classes. [2025-03-09 01:37:11,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 1321 statements. [2025-03-09 01:37:11,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:37:11,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:11,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:37:11,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:12,888 INFO L134 CoverageAnalysis]: Checked inductivity of 119556 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 118626 trivial. 0 not checked. [2025-03-09 01:37:12,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 119556 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 118626 trivial. 0 not checked. [2025-03-09 01:37:13,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225430540] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:13,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:13,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 01:37:13,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714990774] [2025-03-09 01:37:13,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:13,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:37:13,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:13,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:37:13,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:37:13,840 INFO L87 Difference]: Start difference. First operand 4518 states and 4766 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 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:14,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:14,047 INFO L93 Difference]: Finished difference Result 4545 states and 4793 transitions. [2025-03-09 01:37:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:37:14,047 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 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 1321 [2025-03-09 01:37:14,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:14,058 INFO L225 Difference]: With dead ends: 4545 [2025-03-09 01:37:14,058 INFO L226 Difference]: Without dead ends: 4543 [2025-03-09 01:37:14,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2649 GetRequests, 2636 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:37:14,060 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 162 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:14,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 20 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:14,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4543 states. [2025-03-09 01:37:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4543 to 4092. [2025-03-09 01:37:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4092 states, 4090 states have (on average 1.0268948655256724) internal successors, (4200), 4091 states have internal predecessors, (4200), 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:14,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4092 states to 4092 states and 4200 transitions. [2025-03-09 01:37:14,181 INFO L78 Accepts]: Start accepts. Automaton has 4092 states and 4200 transitions. Word has length 1321 [2025-03-09 01:37:14,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:14,182 INFO L471 AbstractCegarLoop]: Abstraction has 4092 states and 4200 transitions. [2025-03-09 01:37:14,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 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:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4092 states and 4200 transitions. [2025-03-09 01:37:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1655 [2025-03-09 01:37:14,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:14,222 INFO L218 NwaCegarLoop]: trace histogram [232, 232, 232, 232, 231, 231, 231, 6, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1] [2025-03-09 01:37:14,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 01:37:14,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 01:37:14,426 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2025-03-09 01:37:14,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:14,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2131134806, now seen corresponding path program 3 times [2025-03-09 01:37:14,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:14,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478144002] [2025-03-09 01:37:14,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:37:14,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:14,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1654 statements into 187 equivalence classes. [2025-03-09 01:37:14,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 1654 statements. [2025-03-09 01:37:14,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:37:14,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 188333 backedges. 0 proven. 62414 refuted. 0 times theorem prover too weak. 125919 trivial. 0 not checked. [2025-03-09 01:37:14,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:14,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478144002] [2025-03-09 01:37:14,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478144002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:14,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322279860] [2025-03-09 01:37:14,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:37:14,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:14,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:14,554 INFO L229 MonitoredProcess]: Starting monitored process 12 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:14,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:37:14,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1654 statements into 187 equivalence classes. [2025-03-09 01:37:14,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 1654 statements. [2025-03-09 01:37:14,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:37:14,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:14,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:37:14,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:16,460 INFO L134 CoverageAnalysis]: Checked inductivity of 188333 backedges. 61490 proven. 924 refuted. 0 times theorem prover too weak. 125919 trivial. 0 not checked. [2025-03-09 01:37:16,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 188333 backedges. 0 proven. 62414 refuted. 0 times theorem prover too weak. 125919 trivial. 0 not checked. [2025-03-09 01:37:17,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322279860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:17,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:17,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-09 01:37:17,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764529141] [2025-03-09 01:37:17,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:17,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:37:17,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:17,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:37:17,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:37:17,829 INFO L87 Difference]: Start difference. First operand 4092 states and 4200 transitions. Second operand has 13 states, 12 states have (on average 9.0) internal successors, (108), 13 states have internal predecessors, (108), 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:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:18,006 INFO L93 Difference]: Finished difference Result 4092 states and 4200 transitions. [2025-03-09 01:37:18,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:37:18,007 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.0) internal successors, (108), 13 states have internal predecessors, (108), 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 1654 [2025-03-09 01:37:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:18,009 INFO L225 Difference]: With dead ends: 4092 [2025-03-09 01:37:18,009 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:37:18,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3317 GetRequests, 3300 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:37:18,017 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 97 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:18,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 10 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:18,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:37:18,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:37:18,017 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:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:37:18,018 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1654 [2025-03-09 01:37:18,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:18,018 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:37:18,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.0) internal successors, (108), 13 states have internal predecessors, (108), 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:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:37:18,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:37:18,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 20 remaining) [2025-03-09 01:37:18,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 20 remaining) [2025-03-09 01:37:18,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 20 remaining) [2025-03-09 01:37:18,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 20 remaining) [2025-03-09 01:37:18,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 20 remaining) [2025-03-09 01:37:18,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 20 remaining) [2025-03-09 01:37:18,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 20 remaining) [2025-03-09 01:37:18,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 20 remaining) [2025-03-09 01:37:18,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 20 remaining) [2025-03-09 01:37:18,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 20 remaining) [2025-03-09 01:37:18,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 20 remaining) [2025-03-09 01:37:18,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 20 remaining) [2025-03-09 01:37:18,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 20 remaining) [2025-03-09 01:37:18,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 20 remaining) [2025-03-09 01:37:18,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 20 remaining) [2025-03-09 01:37:18,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 20 remaining) [2025-03-09 01:37:18,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 20 remaining) [2025-03-09 01:37:18,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 20 remaining) [2025-03-09 01:37:18,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 20 remaining) [2025-03-09 01:37:18,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 20 remaining) [2025-03-09 01:37:18,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 01:37:18,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 01:37:18,226 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:18,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:37:30,093 WARN L286 SmtUtils]: Spent 11.85s on a formula simplification. DAG size of input: 956 DAG size of output: 527 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-09 01:37:44,330 WARN L286 SmtUtils]: Spent 14.23s on a formula simplification. DAG size of input: 707 DAG size of output: 433 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-09 01:37:47,507 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:37:47,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:37:47 BoogieIcfgContainer [2025-03-09 01:37:47,518 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:37:47,519 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:37:47,519 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:37:47,519 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:37:47,522 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:56" (3/4) ... [2025-03-09 01:37:47,523 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:37:47,535 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 01:37:47,535 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:37:47,535 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:37:47,536 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:37:47,598 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:37:47,598 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:37:47,598 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:37:47,598 INFO L158 Benchmark]: Toolchain (without parser) took 51055.12ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 112.2MB in the beginning and 354.5MB in the end (delta: -242.3MB). Peak memory consumption was 389.9MB. Max. memory is 16.1GB. [2025-03-09 01:37:47,598 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:37:47,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.68ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 101.2MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:37:47,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.24ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 100.3MB in the end (delta: 904.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:37:47,599 INFO L158 Benchmark]: Boogie Preprocessor took 22.70ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 99.0MB in the end (delta: 904.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:37:47,599 INFO L158 Benchmark]: IcfgBuilder took 249.16ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 83.6MB in the end (delta: 15.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:37:47,600 INFO L158 Benchmark]: TraceAbstraction took 50533.30ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 83.2MB in the beginning and 358.4MB in the end (delta: -275.2MB). Peak memory consumption was 465.0MB. Max. memory is 16.1GB. [2025-03-09 01:37:47,600 INFO L158 Benchmark]: Witness Printer took 79.15ms. Allocated memory is still 780.1MB. Free memory was 358.4MB in the beginning and 354.5MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:37:47,602 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.21ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 144.68ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 101.2MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.24ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 100.3MB in the end (delta: 904.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.70ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 99.0MB in the end (delta: 904.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 249.16ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 83.6MB in the end (delta: 15.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 50533.30ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 83.2MB in the beginning and 358.4MB in the end (delta: -275.2MB). Peak memory consumption was 465.0MB. Max. memory is 16.1GB. * Witness Printer took 79.15ms. Allocated memory is still 780.1MB. Free memory was 358.4MB in the beginning and 354.5MB in the end (delta: 3.9MB). 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: 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: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: 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, 61 edges, 20 error locations. Started 1 CEGAR loops. OverallTime: 21.2s, OverallIterations: 15, TraceHistogramMax: 232, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7479 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7479 mSDsluCounter, 1310 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1066 mSDsCounter, 708 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3132 IncrementalHoareTripleChecker+Invalid, 3840 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 708 mSolverCounterUnsat, 244 mSDtfsCounter, 3132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9203 GetRequests, 8881 SyntacticMatches, 0 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5919 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4518occurred in iteration=13, InterpolantAutomatonStates: 230, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 3076 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 9053 NumberOfCodeBlocks, 2007 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 13514 ConstructedInterpolants, 0 QuantifiedInterpolants, 47142 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2268 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 36 InterpolantComputations, 5 PerfectInterpolantSequences, 910283/1059466 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 20 specifications checked. All of them hold - InvariantResult [Line: 47]: Location Invariant Derived location invariant: (((((0 <= j) && ((((long long) i + j) + n) <= 2147483648)) && (0 <= i)) && (((long long) i + 1) <= n)) && (n == 1000)) - InvariantResult [Line: 44]: Location Invariant Derived location invariant: (((0 <= i) && (i <= 2147481649)) && (n == 1000)) - InvariantResult [Line: 27]: Location Invariant Derived location invariant: (((((i <= 999) && (0 <= j)) && (((long long) i + j) <= 2147482648)) && (0 <= i)) && (n == 1000)) - InvariantResult [Line: 49]: Location Invariant Derived location invariant: (((((((i <= 999) && (0 <= j)) && (k == 0)) && (0 <= i)) && (j <= 999)) && (n == 1000)) || (((((((((((long long) i + j) + k) <= 2147483647) && (k <= 2147483643)) && (0 <= j)) && (0 <= i)) && (((long long) i + 1) <= n)) && (1 <= k)) && (j <= 999)) && (n == 1000))) - InvariantResult [Line: 29]: Location Invariant Derived location invariant: ((((((((((((long long) i + j) + k) <= 2147483647) && (k <= 2147483643)) && (i <= 999)) && (0 <= j)) && (0 <= i)) && (1 <= k)) && (j <= 999)) && (n == 1000)) || ((((((i <= 999) && (0 <= j)) && (k == 0)) && (0 <= i)) && (j <= 999)) && (n == 1000))) - InvariantResult [Line: 24]: Location Invariant Derived location invariant: (((0 <= i) && (i <= 2147481649)) && (n == 1000)) RESULT: Ultimate proved your program to be correct! [2025-03-09 01:37:47,625 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