./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/mbpr5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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-tiling/mbpr5.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 5503daab190ef8b57bdc3b49ed300bfd661cba05f76774439c2c92cf1668f08b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:38:26,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:38:26,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:38:26,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:38:26,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:38:26,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:38:26,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:38:26,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:38:26,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:38:26,988 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:38:26,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:38:26,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:38:26,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:38:26,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:38:26,990 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:38:26,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:38:26,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:38:26,990 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:38:26,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:38:26,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:38:26,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:38:26,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:38:26,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:38:26,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:38:26,991 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:38:26,991 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:38:26,991 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:38:26,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:38:26,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:38:26,991 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:38:26,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:38:26,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:38:26,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:38:26,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:38:26,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:38:26,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:38:26,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:38:26,992 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:38:26,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:38:26,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:38:26,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:38:26,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:38:26,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:38:26,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:38:26,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:38:26,993 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 -> 5503daab190ef8b57bdc3b49ed300bfd661cba05f76774439c2c92cf1668f08b [2025-03-17 14:38:27,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:38:27,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:38:27,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:38:27,242 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:38:27,243 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:38:27,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mbpr5.c [2025-03-17 14:38:28,362 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f55e1ba7e/2f784ed74d414b2d9d1700d247d160bb/FLAG7103643c4 [2025-03-17 14:38:28,570 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:38:28,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr5.c [2025-03-17 14:38:28,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f55e1ba7e/2f784ed74d414b2d9d1700d247d160bb/FLAG7103643c4 [2025-03-17 14:38:28,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f55e1ba7e/2f784ed74d414b2d9d1700d247d160bb [2025-03-17 14:38:28,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:38:28,933 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:38:28,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:38:28,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:38:28,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:38:28,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:38:28" (1/1) ... [2025-03-17 14:38:28,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42509dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:28, skipping insertion in model container [2025-03-17 14:38:28,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:38:28" (1/1) ... [2025-03-17 14:38:28,952 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:38:29,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:38:29,110 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:38:29,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:38:29,172 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:38:29,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:29 WrapperNode [2025-03-17 14:38:29,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:38:29,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:38:29,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:38:29,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:38:29,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:29" (1/1) ... [2025-03-17 14:38:29,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:29" (1/1) ... [2025-03-17 14:38:29,216 INFO L138 Inliner]: procedures = 15, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 397 [2025-03-17 14:38:29,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:38:29,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:38:29,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:38:29,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:38:29,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:29" (1/1) ... [2025-03-17 14:38:29,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:29" (1/1) ... [2025-03-17 14:38:29,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:29" (1/1) ... [2025-03-17 14:38:29,246 INFO L175 MemorySlicer]: Split 62 memory accesses to 3 slices as follows [2, 8, 52]. 84 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 30 writes are split as follows [0, 0, 30]. [2025-03-17 14:38:29,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:29" (1/1) ... [2025-03-17 14:38:29,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:29" (1/1) ... [2025-03-17 14:38:29,260 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:29" (1/1) ... [2025-03-17 14:38:29,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:29" (1/1) ... [2025-03-17 14:38:29,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:29" (1/1) ... [2025-03-17 14:38:29,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:29" (1/1) ... [2025-03-17 14:38:29,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:38:29,272 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:38:29,272 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:38:29,273 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:38:29,274 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:29" (1/1) ... [2025-03-17 14:38:29,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:38:29,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:29,297 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-17 14:38:29,301 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-17 14:38:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:38:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:38:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:38:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:38:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 14:38:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:38:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:38:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:38:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:38:29,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:38:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:38:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:38:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:38:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 14:38:29,378 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:38:29,379 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:38:29,910 INFO L? ?]: Removed 232 outVars from TransFormulas that were not future-live. [2025-03-17 14:38:29,911 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:38:29,930 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:38:29,930 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:38:29,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:38:29 BoogieIcfgContainer [2025-03-17 14:38:29,931 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:38:29,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:38:29,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:38:29,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:38:29,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:38:28" (1/3) ... [2025-03-17 14:38:29,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b6d871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:38:29, skipping insertion in model container [2025-03-17 14:38:29,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:29" (2/3) ... [2025-03-17 14:38:29,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b6d871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:38:29, skipping insertion in model container [2025-03-17 14:38:29,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:38:29" (3/3) ... [2025-03-17 14:38:29,940 INFO L128 eAbstractionObserver]: Analyzing ICFG mbpr5.c [2025-03-17 14:38:29,949 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:38:29,951 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mbpr5.c that has 1 procedures, 473 locations, 1 initial locations, 6 loop locations, and 222 error locations. [2025-03-17 14:38:30,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:38:30,023 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;@28d1f6f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:38:30,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 222 error locations. [2025-03-17 14:38:30,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 473 states, 250 states have (on average 1.972) internal successors, (493), 472 states have internal predecessors, (493), 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-17 14:38:30,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:38:30,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:30,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:38:30,033 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr221ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:30,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:30,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1650500169, now seen corresponding path program 1 times [2025-03-17 14:38:30,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:30,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278633308] [2025-03-17 14:38:30,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:30,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:30,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:38:30,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:38:30,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:30,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:30,162 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-17 14:38:30,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:30,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278633308] [2025-03-17 14:38:30,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278633308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:30,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:30,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:38:30,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421915709] [2025-03-17 14:38:30,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:30,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:38:30,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:30,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:38:30,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:38:30,183 INFO L87 Difference]: Start difference. First operand has 473 states, 250 states have (on average 1.972) internal successors, (493), 472 states have internal predecessors, (493), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-17 14:38:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:30,223 INFO L93 Difference]: Finished difference Result 942 states and 979 transitions. [2025-03-17 14:38:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:38:30,224 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-17 14:38:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:30,231 INFO L225 Difference]: With dead ends: 942 [2025-03-17 14:38:30,231 INFO L226 Difference]: Without dead ends: 469 [2025-03-17 14:38:30,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:38:30,235 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:30,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:30,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-17 14:38:30,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2025-03-17 14:38:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 247 states have (on average 1.94331983805668) internal successors, (480), 468 states have internal predecessors, (480), 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-17 14:38:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 480 transitions. [2025-03-17 14:38:30,288 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 480 transitions. Word has length 6 [2025-03-17 14:38:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:30,288 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 480 transitions. [2025-03-17 14:38:30,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-17 14:38:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 480 transitions. [2025-03-17 14:38:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:38:30,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:30,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:38:30,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:38:30,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr221ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:30,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:30,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1650499208, now seen corresponding path program 1 times [2025-03-17 14:38:30,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:30,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229971407] [2025-03-17 14:38:30,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:30,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:30,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:38:30,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:38:30,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:30,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:30,462 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-17 14:38:30,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:30,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229971407] [2025-03-17 14:38:30,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229971407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:30,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:30,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:30,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438675501] [2025-03-17 14:38:30,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:30,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:30,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:30,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:30,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:30,464 INFO L87 Difference]: Start difference. First operand 469 states and 480 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-17 14:38:30,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:30,532 INFO L93 Difference]: Finished difference Result 469 states and 480 transitions. [2025-03-17 14:38:30,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:30,533 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-17 14:38:30,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:30,534 INFO L225 Difference]: With dead ends: 469 [2025-03-17 14:38:30,534 INFO L226 Difference]: Without dead ends: 464 [2025-03-17 14:38:30,535 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-17 14:38:30,535 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 470 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:30,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 448 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-03-17 14:38:30,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2025-03-17 14:38:30,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 247 states have (on average 1.9230769230769231) internal successors, (475), 463 states have internal predecessors, (475), 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-17 14:38:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 475 transitions. [2025-03-17 14:38:30,553 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 475 transitions. Word has length 6 [2025-03-17 14:38:30,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:30,553 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 475 transitions. [2025-03-17 14:38:30,553 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-17 14:38:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 475 transitions. [2025-03-17 14:38:30,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:38:30,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:30,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:30,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:38:30,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr220ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:30,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:30,554 INFO L85 PathProgramCache]: Analyzing trace with hash 374132554, now seen corresponding path program 1 times [2025-03-17 14:38:30,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:30,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136841636] [2025-03-17 14:38:30,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:30,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:30,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:38:30,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:38:30,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:30,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:30,719 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-17 14:38:30,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:30,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136841636] [2025-03-17 14:38:30,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136841636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:30,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:30,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:30,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424388776] [2025-03-17 14:38:30,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:30,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:38:30,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:30,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:38:30,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:38:30,720 INFO L87 Difference]: Start difference. First operand 464 states and 475 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-17 14:38:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:30,800 INFO L93 Difference]: Finished difference Result 464 states and 475 transitions. [2025-03-17 14:38:30,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:38:30,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-03-17 14:38:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:30,802 INFO L225 Difference]: With dead ends: 464 [2025-03-17 14:38:30,802 INFO L226 Difference]: Without dead ends: 459 [2025-03-17 14:38:30,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:38:30,803 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 932 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:30,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 447 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:30,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-17 14:38:30,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2025-03-17 14:38:30,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 247 states have (on average 1.902834008097166) internal successors, (470), 458 states have internal predecessors, (470), 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-17 14:38:30,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 470 transitions. [2025-03-17 14:38:30,820 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 470 transitions. Word has length 7 [2025-03-17 14:38:30,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:30,821 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 470 transitions. [2025-03-17 14:38:30,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-17 14:38:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 470 transitions. [2025-03-17 14:38:30,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 14:38:30,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:30,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:30,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:38:30,821 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr215ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:30,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:30,822 INFO L85 PathProgramCache]: Analyzing trace with hash 343227884, now seen corresponding path program 1 times [2025-03-17 14:38:30,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:30,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538955879] [2025-03-17 14:38:30,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:30,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:30,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:38:30,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:38:30,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:30,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:30,863 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-17 14:38:30,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:30,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538955879] [2025-03-17 14:38:30,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538955879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:30,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:30,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:38:30,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333522302] [2025-03-17 14:38:30,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:30,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:38:30,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:30,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:38:30,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:38:30,865 INFO L87 Difference]: Start difference. First operand 459 states and 470 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-17 14:38:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:31,543 INFO L93 Difference]: Finished difference Result 879 states and 900 transitions. [2025-03-17 14:38:31,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:38:31,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-17 14:38:31,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:31,546 INFO L225 Difference]: With dead ends: 879 [2025-03-17 14:38:31,546 INFO L226 Difference]: Without dead ends: 679 [2025-03-17 14:38:31,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:38:31,547 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 216 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:31,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 303 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 14:38:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-17 14:38:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2025-03-17 14:38:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 467 states have (on average 1.4989293361884368) internal successors, (700), 678 states have internal predecessors, (700), 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-17 14:38:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 700 transitions. [2025-03-17 14:38:31,563 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 700 transitions. Word has length 10 [2025-03-17 14:38:31,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:31,564 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 700 transitions. [2025-03-17 14:38:31,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-17 14:38:31,564 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 700 transitions. [2025-03-17 14:38:31,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 14:38:31,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:31,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:31,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:38:31,566 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:31,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:31,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1812452677, now seen corresponding path program 1 times [2025-03-17 14:38:31,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:31,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625547562] [2025-03-17 14:38:31,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:31,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:31,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 14:38:31,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 14:38:31,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:31,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:31,669 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-17 14:38:31,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:31,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625547562] [2025-03-17 14:38:31,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625547562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:31,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:31,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:31,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471523409] [2025-03-17 14:38:31,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:31,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:31,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:31,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:31,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:31,670 INFO L87 Difference]: Start difference. First operand 679 states and 700 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-17 14:38:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:31,994 INFO L93 Difference]: Finished difference Result 688 states and 710 transitions. [2025-03-17 14:38:31,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:31,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2025-03-17 14:38:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:31,997 INFO L225 Difference]: With dead ends: 688 [2025-03-17 14:38:31,997 INFO L226 Difference]: Without dead ends: 686 [2025-03-17 14:38:31,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:31,998 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 2 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:31,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 969 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:38:31,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-17 14:38:32,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2025-03-17 14:38:32,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 474 states have (on average 1.4936708860759493) internal successors, (708), 685 states have internal predecessors, (708), 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-17 14:38:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 708 transitions. [2025-03-17 14:38:32,010 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 708 transitions. Word has length 31 [2025-03-17 14:38:32,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:32,010 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 708 transitions. [2025-03-17 14:38:32,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-17 14:38:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 708 transitions. [2025-03-17 14:38:32,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 14:38:32,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:32,015 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:32,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:38:32,015 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:32,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:32,015 INFO L85 PathProgramCache]: Analyzing trace with hash 745110684, now seen corresponding path program 1 times [2025-03-17 14:38:32,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:32,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826788000] [2025-03-17 14:38:32,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:32,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:32,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 14:38:32,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 14:38:32,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:32,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:32,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:38:32,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:32,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826788000] [2025-03-17 14:38:32,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826788000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:32,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:32,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:38:32,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031087635] [2025-03-17 14:38:32,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:32,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:38:32,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:32,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:38:32,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:38:32,246 INFO L87 Difference]: Start difference. First operand 686 states and 708 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:32,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:32,814 INFO L93 Difference]: Finished difference Result 1235 states and 1275 transitions. [2025-03-17 14:38:32,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:38:32,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-17 14:38:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:32,817 INFO L225 Difference]: With dead ends: 1235 [2025-03-17 14:38:32,817 INFO L226 Difference]: Without dead ends: 686 [2025-03-17 14:38:32,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-17 14:38:32,819 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 1594 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:32,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 280 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 14:38:32,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-17 14:38:32,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2025-03-17 14:38:32,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 474 states have (on average 1.4831223628691983) internal successors, (703), 685 states have internal predecessors, (703), 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-17 14:38:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 703 transitions. [2025-03-17 14:38:32,833 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 703 transitions. Word has length 38 [2025-03-17 14:38:32,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:32,833 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 703 transitions. [2025-03-17 14:38:32,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:32,833 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 703 transitions. [2025-03-17 14:38:32,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 14:38:32,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:32,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:32,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:38:32,834 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr179ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:32,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:32,834 INFO L85 PathProgramCache]: Analyzing trace with hash -590958520, now seen corresponding path program 1 times [2025-03-17 14:38:32,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:32,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275220898] [2025-03-17 14:38:32,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:32,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:32,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 14:38:32,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 14:38:32,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:32,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:32,905 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-17 14:38:32,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:32,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275220898] [2025-03-17 14:38:32,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275220898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:32,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:32,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:32,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275907713] [2025-03-17 14:38:32,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:32,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:32,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:32,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:32,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:32,907 INFO L87 Difference]: Start difference. First operand 686 states and 703 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 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-17 14:38:33,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:33,394 INFO L93 Difference]: Finished difference Result 690 states and 707 transitions. [2025-03-17 14:38:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:33,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 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 46 [2025-03-17 14:38:33,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:33,396 INFO L225 Difference]: With dead ends: 690 [2025-03-17 14:38:33,396 INFO L226 Difference]: Without dead ends: 688 [2025-03-17 14:38:33,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:33,398 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 182 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:33,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 565 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 14:38:33,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-17 14:38:33,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-03-17 14:38:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 476 states have (on average 1.48109243697479) internal successors, (705), 687 states have internal predecessors, (705), 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-17 14:38:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 705 transitions. [2025-03-17 14:38:33,409 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 705 transitions. Word has length 46 [2025-03-17 14:38:33,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:33,411 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 705 transitions. [2025-03-17 14:38:33,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 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-17 14:38:33,411 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 705 transitions. [2025-03-17 14:38:33,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 14:38:33,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:33,412 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:33,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:38:33,413 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr215ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:33,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:33,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1563591510, now seen corresponding path program 1 times [2025-03-17 14:38:33,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:33,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305866527] [2025-03-17 14:38:33,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:33,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:33,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 14:38:33,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 14:38:33,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:33,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:33,494 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-17 14:38:33,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:33,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305866527] [2025-03-17 14:38:33,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305866527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:33,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695566661] [2025-03-17 14:38:33,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:33,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:33,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:33,497 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-17 14:38:33,499 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-17 14:38:33,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 14:38:33,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 14:38:33,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:33,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:33,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:33,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:33,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:38:33,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695566661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:33,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:38:33,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 14:38:33,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777578674] [2025-03-17 14:38:33,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:33,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:38:33,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:33,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:38:33,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:33,666 INFO L87 Difference]: Start difference. First operand 688 states and 705 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 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-17 14:38:34,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:34,279 INFO L93 Difference]: Finished difference Result 688 states and 705 transitions. [2025-03-17 14:38:34,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:38:34,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 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 52 [2025-03-17 14:38:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:34,284 INFO L225 Difference]: With dead ends: 688 [2025-03-17 14:38:34,284 INFO L226 Difference]: Without dead ends: 667 [2025-03-17 14:38:34,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:34,285 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 221 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:34,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 503 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 14:38:34,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-17 14:38:34,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2025-03-17 14:38:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 476 states have (on average 1.4369747899159664) internal successors, (684), 666 states have internal predecessors, (684), 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-17 14:38:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 684 transitions. [2025-03-17 14:38:34,299 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 684 transitions. Word has length 52 [2025-03-17 14:38:34,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:34,300 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 684 transitions. [2025-03-17 14:38:34,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 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-17 14:38:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 684 transitions. [2025-03-17 14:38:34,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 14:38:34,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:34,303 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:34,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:38:34,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:34,504 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr214ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:34,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:34,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1226696988, now seen corresponding path program 1 times [2025-03-17 14:38:34,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:34,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106681984] [2025-03-17 14:38:34,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:34,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:34,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 14:38:34,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 14:38:34,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:34,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:34,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:34,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106681984] [2025-03-17 14:38:34,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106681984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:34,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763050142] [2025-03-17 14:38:34,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:34,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:34,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:34,595 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-17 14:38:34,596 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-17 14:38:34,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 14:38:34,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 14:38:34,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:34,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:34,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:34,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:34,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:34,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763050142] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:34,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:34,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 14:38:34,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662004557] [2025-03-17 14:38:34,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:34,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:38:34,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:34,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:38:34,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:38:34,780 INFO L87 Difference]: Start difference. First operand 667 states and 684 transitions. Second operand has 10 states, 9 states have (on average 16.11111111111111) internal successors, (145), 10 states have internal predecessors, (145), 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-17 14:38:35,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:35,540 INFO L93 Difference]: Finished difference Result 724 states and 765 transitions. [2025-03-17 14:38:35,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:38:35,540 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 16.11111111111111) internal successors, (145), 10 states have internal predecessors, (145), 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 53 [2025-03-17 14:38:35,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:35,543 INFO L225 Difference]: With dead ends: 724 [2025-03-17 14:38:35,544 INFO L226 Difference]: Without dead ends: 631 [2025-03-17 14:38:35,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:38:35,545 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 781 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:35,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 276 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1363 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 14:38:35,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-03-17 14:38:35,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 627. [2025-03-17 14:38:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 526 states have (on average 1.231939163498099) internal successors, (648), 626 states have internal predecessors, (648), 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-17 14:38:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 648 transitions. [2025-03-17 14:38:35,559 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 648 transitions. Word has length 53 [2025-03-17 14:38:35,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:35,559 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 648 transitions. [2025-03-17 14:38:35,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 16.11111111111111) internal successors, (145), 10 states have internal predecessors, (145), 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-17 14:38:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 648 transitions. [2025-03-17 14:38:35,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 14:38:35,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:35,562 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:35,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:38:35,766 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,SelfDestructingSolverStorable8 [2025-03-17 14:38:35,766 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:35,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:35,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2134965682, now seen corresponding path program 1 times [2025-03-17 14:38:35,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:35,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52561808] [2025-03-17 14:38:35,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:35,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:35,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 14:38:35,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 14:38:35,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:35,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:35,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:38:35,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:35,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52561808] [2025-03-17 14:38:35,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52561808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:35,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:35,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:35,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994504998] [2025-03-17 14:38:35,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:35,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:35,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:35,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:35,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:35,859 INFO L87 Difference]: Start difference. First operand 627 states and 648 transitions. Second operand has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:36,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:36,242 INFO L93 Difference]: Finished difference Result 635 states and 656 transitions. [2025-03-17 14:38:36,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:36,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-17 14:38:36,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:36,244 INFO L225 Difference]: With dead ends: 635 [2025-03-17 14:38:36,245 INFO L226 Difference]: Without dead ends: 633 [2025-03-17 14:38:36,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:36,245 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 182 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:36,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 342 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 14:38:36,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-17 14:38:36,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2025-03-17 14:38:36,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 529 states have (on average 1.2306238185255198) internal successors, (651), 629 states have internal predecessors, (651), 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-17 14:38:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 651 transitions. [2025-03-17 14:38:36,254 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 651 transitions. Word has length 92 [2025-03-17 14:38:36,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:36,254 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 651 transitions. [2025-03-17 14:38:36,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 651 transitions. [2025-03-17 14:38:36,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 14:38:36,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:36,255 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:36,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:38:36,255 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr171ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:36,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:36,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2110416284, now seen corresponding path program 1 times [2025-03-17 14:38:36,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:36,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661305875] [2025-03-17 14:38:36,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:36,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:36,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 14:38:36,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 14:38:36,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:36,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:38:36,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:36,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661305875] [2025-03-17 14:38:36,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661305875] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:36,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78058300] [2025-03-17 14:38:36,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:36,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:36,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:36,353 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-17 14:38:36,355 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-17 14:38:36,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 14:38:36,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 14:38:36,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:36,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:36,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:36,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:38:36,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:38:36,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78058300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:36,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:38:36,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 14:38:36,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308833623] [2025-03-17 14:38:36,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:36,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:38:36,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:36,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:38:36,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:36,470 INFO L87 Difference]: Start difference. First operand 630 states and 651 transitions. Second operand has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 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-17 14:38:36,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:36,930 INFO L93 Difference]: Finished difference Result 633 states and 654 transitions. [2025-03-17 14:38:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:38:36,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 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 98 [2025-03-17 14:38:36,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:36,932 INFO L225 Difference]: With dead ends: 633 [2025-03-17 14:38:36,932 INFO L226 Difference]: Without dead ends: 612 [2025-03-17 14:38:36,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:36,933 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 221 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:36,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 316 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 14:38:36,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-03-17 14:38:36,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 609. [2025-03-17 14:38:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 529 states have (on average 1.1909262759924386) internal successors, (630), 608 states have internal predecessors, (630), 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-17 14:38:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 630 transitions. [2025-03-17 14:38:36,940 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 630 transitions. Word has length 98 [2025-03-17 14:38:36,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:36,941 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 630 transitions. [2025-03-17 14:38:36,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 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-17 14:38:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 630 transitions. [2025-03-17 14:38:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 14:38:36,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:36,941 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:36,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:38:37,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:37,142 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr170ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:37,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:37,142 INFO L85 PathProgramCache]: Analyzing trace with hash 998395704, now seen corresponding path program 1 times [2025-03-17 14:38:37,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:37,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371608596] [2025-03-17 14:38:37,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:37,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:37,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 14:38:37,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 14:38:37,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:37,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:37,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:38:37,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:37,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371608596] [2025-03-17 14:38:37,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371608596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:37,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576031117] [2025-03-17 14:38:37,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:37,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:37,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:37,231 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-17 14:38:37,232 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-17 14:38:37,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 14:38:37,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 14:38:37,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:37,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:37,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:37,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:38:37,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:37,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:38:37,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576031117] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:37,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:37,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 14:38:37,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128983862] [2025-03-17 14:38:37,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:37,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:38:37,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:37,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:38:37,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:38:37,417 INFO L87 Difference]: Start difference. First operand 609 states and 630 transitions. Second operand has 10 states, 9 states have (on average 21.0) internal successors, (189), 10 states have internal predecessors, (189), 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-17 14:38:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:38,022 INFO L93 Difference]: Finished difference Result 669 states and 696 transitions. [2025-03-17 14:38:38,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:38:38,022 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 21.0) internal successors, (189), 10 states have internal predecessors, (189), 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 99 [2025-03-17 14:38:38,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:38,024 INFO L225 Difference]: With dead ends: 669 [2025-03-17 14:38:38,024 INFO L226 Difference]: Without dead ends: 666 [2025-03-17 14:38:38,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:38:38,025 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 409 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:38,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 375 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 14:38:38,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-17 14:38:38,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 663. [2025-03-17 14:38:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 583 states have (on average 1.1801029159519725) internal successors, (688), 662 states have internal predecessors, (688), 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-17 14:38:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 688 transitions. [2025-03-17 14:38:38,032 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 688 transitions. Word has length 99 [2025-03-17 14:38:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:38,033 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 688 transitions. [2025-03-17 14:38:38,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 21.0) internal successors, (189), 10 states have internal predecessors, (189), 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-17 14:38:38,033 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 688 transitions. [2025-03-17 14:38:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 14:38:38,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:38,034 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:38,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:38:38,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:38,234 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr178ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:38,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:38,234 INFO L85 PathProgramCache]: Analyzing trace with hash 348018766, now seen corresponding path program 1 times [2025-03-17 14:38:38,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:38,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032695037] [2025-03-17 14:38:38,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:38,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:38,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 14:38:38,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 14:38:38,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:38,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-17 14:38:38,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:38,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032695037] [2025-03-17 14:38:38,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032695037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:38,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:38,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:38,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038081243] [2025-03-17 14:38:38,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:38,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:38,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:38,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:38,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:38,295 INFO L87 Difference]: Start difference. First operand 663 states and 688 transitions. Second operand has 4 states, 3 states have (on average 28.0) internal successors, (84), 4 states have internal predecessors, (84), 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-17 14:38:38,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:38,580 INFO L93 Difference]: Finished difference Result 663 states and 688 transitions. [2025-03-17 14:38:38,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:38,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.0) internal successors, (84), 4 states have internal predecessors, (84), 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 131 [2025-03-17 14:38:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:38,583 INFO L225 Difference]: With dead ends: 663 [2025-03-17 14:38:38,583 INFO L226 Difference]: Without dead ends: 662 [2025-03-17 14:38:38,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:38,584 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 191 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:38,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 184 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:38:38,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-17 14:38:38,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-17 14:38:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 583 states have (on average 1.1783876500857633) internal successors, (687), 661 states have internal predecessors, (687), 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-17 14:38:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 687 transitions. [2025-03-17 14:38:38,593 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 687 transitions. Word has length 131 [2025-03-17 14:38:38,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:38,593 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 687 transitions. [2025-03-17 14:38:38,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.0) internal successors, (84), 4 states have internal predecessors, (84), 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-17 14:38:38,593 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 687 transitions. [2025-03-17 14:38:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 14:38:38,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:38,594 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:38,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:38:38,594 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr214ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:38,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:38,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1839765064, now seen corresponding path program 2 times [2025-03-17 14:38:38,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:38,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666075169] [2025-03-17 14:38:38,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:38,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:38,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-03-17 14:38:38,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 137 statements. [2025-03-17 14:38:38,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:38:38,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-17 14:38:38,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:38,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666075169] [2025-03-17 14:38:38,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666075169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:38,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948242853] [2025-03-17 14:38:38,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:38,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:38,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:38,672 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-17 14:38:38,673 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-17 14:38:38,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-03-17 14:38:38,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 137 statements. [2025-03-17 14:38:38,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:38:38,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:38,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:38,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:39,059 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-17 14:38:39,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-17 14:38:39,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948242853] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:39,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:39,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2025-03-17 14:38:39,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045212195] [2025-03-17 14:38:39,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:39,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:38:39,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:39,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:38:39,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:38:39,235 INFO L87 Difference]: Start difference. First operand 662 states and 687 transitions. Second operand has 9 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 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-17 14:38:39,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:39,515 INFO L93 Difference]: Finished difference Result 662 states and 687 transitions. [2025-03-17 14:38:39,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:38:39,516 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 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 137 [2025-03-17 14:38:39,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:39,517 INFO L225 Difference]: With dead ends: 662 [2025-03-17 14:38:39,517 INFO L226 Difference]: Without dead ends: 652 [2025-03-17 14:38:39,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:38:39,518 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 1712 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:39,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 61 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:38:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-03-17 14:38:39,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 547. [2025-03-17 14:38:39,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 478 states have (on average 1.1820083682008369) internal successors, (565), 546 states have internal predecessors, (565), 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-17 14:38:39,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 565 transitions. [2025-03-17 14:38:39,524 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 565 transitions. Word has length 137 [2025-03-17 14:38:39,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:39,524 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 565 transitions. [2025-03-17 14:38:39,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 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-17 14:38:39,525 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 565 transitions. [2025-03-17 14:38:39,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 14:38:39,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:39,525 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:39,531 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-17 14:38:39,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 14:38:39,726 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:39,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:39,726 INFO L85 PathProgramCache]: Analyzing trace with hash -617358444, now seen corresponding path program 1 times [2025-03-17 14:38:39,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:39,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887966429] [2025-03-17 14:38:39,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:39,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:39,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 14:38:39,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 14:38:39,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:39,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:39,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:38:39,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:39,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887966429] [2025-03-17 14:38:39,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887966429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:39,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:39,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:39,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208038994] [2025-03-17 14:38:39,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:39,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:39,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:39,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:39,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:39,804 INFO L87 Difference]: Start difference. First operand 547 states and 565 transitions. Second operand has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 4 states have internal predecessors, (134), 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-17 14:38:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:40,195 INFO L93 Difference]: Finished difference Result 595 states and 614 transitions. [2025-03-17 14:38:40,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:40,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 4 states have internal predecessors, (134), 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 138 [2025-03-17 14:38:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:40,196 INFO L225 Difference]: With dead ends: 595 [2025-03-17 14:38:40,196 INFO L226 Difference]: Without dead ends: 593 [2025-03-17 14:38:40,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:40,197 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 182 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:40,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 276 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 14:38:40,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-17 14:38:40,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 550. [2025-03-17 14:38:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 481 states have (on average 1.180873180873181) internal successors, (568), 549 states have internal predecessors, (568), 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-17 14:38:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 568 transitions. [2025-03-17 14:38:40,203 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 568 transitions. Word has length 138 [2025-03-17 14:38:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:40,203 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 568 transitions. [2025-03-17 14:38:40,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 4 states have internal predecessors, (134), 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-17 14:38:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 568 transitions. [2025-03-17 14:38:40,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 14:38:40,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:40,204 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:40,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:38:40,204 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:40,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:40,205 INFO L85 PathProgramCache]: Analyzing trace with hash 715939618, now seen corresponding path program 1 times [2025-03-17 14:38:40,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:40,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169352067] [2025-03-17 14:38:40,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:40,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:40,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 14:38:40,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 14:38:40,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:40,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:38:40,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:40,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169352067] [2025-03-17 14:38:40,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169352067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:40,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733458589] [2025-03-17 14:38:40,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:40,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:40,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:40,292 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-17 14:38:40,294 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-17 14:38:40,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 14:38:40,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 14:38:40,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:40,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:40,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:40,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:38:40,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:38:40,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733458589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:40,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:38:40,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 14:38:40,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512640482] [2025-03-17 14:38:40,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:40,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:38:40,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:40,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:38:40,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:40,413 INFO L87 Difference]: Start difference. First operand 550 states and 568 transitions. Second operand has 5 states, 4 states have (on average 35.0) internal successors, (140), 5 states have internal predecessors, (140), 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-17 14:38:40,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:40,778 INFO L93 Difference]: Finished difference Result 593 states and 612 transitions. [2025-03-17 14:38:40,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:38:40,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 35.0) internal successors, (140), 5 states have internal predecessors, (140), 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 144 [2025-03-17 14:38:40,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:40,780 INFO L225 Difference]: With dead ends: 593 [2025-03-17 14:38:40,780 INFO L226 Difference]: Without dead ends: 572 [2025-03-17 14:38:40,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:40,781 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 221 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:40,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 271 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 14:38:40,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-17 14:38:40,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 529. [2025-03-17 14:38:40,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 481 states have (on average 1.137214137214137) internal successors, (547), 528 states have internal predecessors, (547), 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-17 14:38:40,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 547 transitions. [2025-03-17 14:38:40,787 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 547 transitions. Word has length 144 [2025-03-17 14:38:40,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:40,787 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 547 transitions. [2025-03-17 14:38:40,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 35.0) internal successors, (140), 5 states have internal predecessors, (140), 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-17 14:38:40,787 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 547 transitions. [2025-03-17 14:38:40,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-17 14:38:40,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:40,788 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:40,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:38:40,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 14:38:40,989 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:40,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:40,989 INFO L85 PathProgramCache]: Analyzing trace with hash -750722262, now seen corresponding path program 1 times [2025-03-17 14:38:40,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:40,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536346874] [2025-03-17 14:38:40,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:40,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:41,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 14:38:41,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 14:38:41,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:41,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:41,059 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-17 14:38:41,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:41,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536346874] [2025-03-17 14:38:41,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536346874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:41,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:41,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:41,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611767017] [2025-03-17 14:38:41,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:41,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:41,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:41,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:41,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:41,061 INFO L87 Difference]: Start difference. First operand 529 states and 547 transitions. Second operand has 4 states, 3 states have (on average 42.666666666666664) internal successors, (128), 4 states have internal predecessors, (128), 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-17 14:38:41,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:41,325 INFO L93 Difference]: Finished difference Result 534 states and 553 transitions. [2025-03-17 14:38:41,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:41,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 42.666666666666664) internal successors, (128), 4 states have internal predecessors, (128), 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 177 [2025-03-17 14:38:41,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:41,327 INFO L225 Difference]: With dead ends: 534 [2025-03-17 14:38:41,327 INFO L226 Difference]: Without dead ends: 533 [2025-03-17 14:38:41,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:41,328 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 191 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:41,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 154 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:38:41,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-17 14:38:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 439. [2025-03-17 14:38:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 392 states have (on average 1.1581632653061225) internal successors, (454), 438 states have internal predecessors, (454), 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-17 14:38:41,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 454 transitions. [2025-03-17 14:38:41,333 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 454 transitions. Word has length 177 [2025-03-17 14:38:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:41,333 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 454 transitions. [2025-03-17 14:38:41,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 42.666666666666664) internal successors, (128), 4 states have internal predecessors, (128), 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-17 14:38:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 454 transitions. [2025-03-17 14:38:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-17 14:38:41,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:41,334 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:41,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:38:41,334 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:41,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:41,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1332332784, now seen corresponding path program 1 times [2025-03-17 14:38:41,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:41,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927349873] [2025-03-17 14:38:41,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:41,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:41,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 14:38:41,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 14:38:41,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:41,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:38:41,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:41,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927349873] [2025-03-17 14:38:41,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927349873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:41,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:41,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:41,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746428346] [2025-03-17 14:38:41,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:41,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:41,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:41,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:41,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:41,410 INFO L87 Difference]: Start difference. First operand 439 states and 454 transitions. Second operand has 4 states, 3 states have (on average 57.333333333333336) internal successors, (172), 4 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-17 14:38:41,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:41,652 INFO L93 Difference]: Finished difference Result 449 states and 466 transitions. [2025-03-17 14:38:41,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:41,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 57.333333333333336) internal successors, (172), 4 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) Word has length 181 [2025-03-17 14:38:41,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:41,654 INFO L225 Difference]: With dead ends: 449 [2025-03-17 14:38:41,654 INFO L226 Difference]: Without dead ends: 448 [2025-03-17 14:38:41,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:41,654 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 191 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:41,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 151 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:38:41,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-17 14:38:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 395. [2025-03-17 14:38:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 349 states have (on average 1.171919770773639) internal successors, (409), 394 states have internal predecessors, (409), 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-17 14:38:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 409 transitions. [2025-03-17 14:38:41,659 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 409 transitions. Word has length 181 [2025-03-17 14:38:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:41,659 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 409 transitions. [2025-03-17 14:38:41,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 57.333333333333336) internal successors, (172), 4 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-17 14:38:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 409 transitions. [2025-03-17 14:38:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-17 14:38:41,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:41,660 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:41,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 14:38:41,660 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:41,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1143305190, now seen corresponding path program 1 times [2025-03-17 14:38:41,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:41,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966308825] [2025-03-17 14:38:41,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:41,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:41,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 14:38:41,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 14:38:41,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:41,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:38:41,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:41,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966308825] [2025-03-17 14:38:41,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966308825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:41,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:41,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:41,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221461927] [2025-03-17 14:38:41,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:41,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:41,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:41,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:41,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:41,743 INFO L87 Difference]: Start difference. First operand 395 states and 409 transitions. Second operand has 4 states, 3 states have (on average 59.333333333333336) internal successors, (178), 4 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-17 14:38:42,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:42,102 INFO L93 Difference]: Finished difference Result 524 states and 541 transitions. [2025-03-17 14:38:42,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:42,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 59.333333333333336) internal successors, (178), 4 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 184 [2025-03-17 14:38:42,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:42,104 INFO L225 Difference]: With dead ends: 524 [2025-03-17 14:38:42,104 INFO L226 Difference]: Without dead ends: 522 [2025-03-17 14:38:42,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:42,104 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 182 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:42,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 227 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:38:42,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-17 14:38:42,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 398. [2025-03-17 14:38:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 352 states have (on average 1.1704545454545454) internal successors, (412), 397 states have internal predecessors, (412), 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-17 14:38:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 412 transitions. [2025-03-17 14:38:42,110 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 412 transitions. Word has length 184 [2025-03-17 14:38:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:42,110 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 412 transitions. [2025-03-17 14:38:42,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 59.333333333333336) internal successors, (178), 4 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-17 14:38:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 412 transitions. [2025-03-17 14:38:42,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 14:38:42,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:42,111 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:42,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 14:38:42,112 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:42,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:42,112 INFO L85 PathProgramCache]: Analyzing trace with hash -900612120, now seen corresponding path program 1 times [2025-03-17 14:38:42,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:42,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120907045] [2025-03-17 14:38:42,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:42,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:42,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 14:38:42,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 14:38:42,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:42,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:38:42,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:42,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120907045] [2025-03-17 14:38:42,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120907045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:42,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805947474] [2025-03-17 14:38:42,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:42,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:42,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:42,220 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-17 14:38:42,221 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-17 14:38:42,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 14:38:42,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 14:38:42,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:42,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:42,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:42,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:38:42,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:38:42,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805947474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:42,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:38:42,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 14:38:42,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603180203] [2025-03-17 14:38:42,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:42,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:38:42,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:42,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:38:42,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:42,353 INFO L87 Difference]: Start difference. First operand 398 states and 412 transitions. Second operand has 5 states, 4 states have (on average 46.0) internal successors, (184), 5 states have internal predecessors, (184), 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-17 14:38:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:42,756 INFO L93 Difference]: Finished difference Result 522 states and 539 transitions. [2025-03-17 14:38:42,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:38:42,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 46.0) internal successors, (184), 5 states have internal predecessors, (184), 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 190 [2025-03-17 14:38:42,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:42,762 INFO L225 Difference]: With dead ends: 522 [2025-03-17 14:38:42,762 INFO L226 Difference]: Without dead ends: 501 [2025-03-17 14:38:42,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:42,762 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 221 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:42,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 205 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 14:38:42,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-03-17 14:38:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 377. [2025-03-17 14:38:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 352 states have (on average 1.1107954545454546) internal successors, (391), 376 states have internal predecessors, (391), 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-17 14:38:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 391 transitions. [2025-03-17 14:38:42,767 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 391 transitions. Word has length 190 [2025-03-17 14:38:42,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:42,767 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 391 transitions. [2025-03-17 14:38:42,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 46.0) internal successors, (184), 5 states have internal predecessors, (184), 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-17 14:38:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 391 transitions. [2025-03-17 14:38:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-17 14:38:42,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:42,769 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:42,775 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-17 14:38:42,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:42,973 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:42,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:42,973 INFO L85 PathProgramCache]: Analyzing trace with hash -833650932, now seen corresponding path program 1 times [2025-03-17 14:38:42,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:42,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559366959] [2025-03-17 14:38:42,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:42,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:42,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-17 14:38:42,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-17 14:38:42,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:42,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 14:38:43,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:43,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559366959] [2025-03-17 14:38:43,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559366959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:43,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:43,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:43,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006248388] [2025-03-17 14:38:43,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:43,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:43,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:43,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:43,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:43,040 INFO L87 Difference]: Start difference. First operand 377 states and 391 transitions. Second operand has 4 states, 3 states have (on average 72.0) internal successors, (216), 4 states have internal predecessors, (216), 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-17 14:38:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:43,275 INFO L93 Difference]: Finished difference Result 392 states and 409 transitions. [2025-03-17 14:38:43,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:43,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 72.0) internal successors, (216), 4 states have internal predecessors, (216), 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 227 [2025-03-17 14:38:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:43,276 INFO L225 Difference]: With dead ends: 392 [2025-03-17 14:38:43,276 INFO L226 Difference]: Without dead ends: 391 [2025-03-17 14:38:43,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:43,277 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 191 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:43,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 141 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:38:43,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-17 14:38:43,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 333. [2025-03-17 14:38:43,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 309 states have (on average 1.1197411003236246) internal successors, (346), 332 states have internal predecessors, (346), 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-17 14:38:43,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 346 transitions. [2025-03-17 14:38:43,281 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 346 transitions. Word has length 227 [2025-03-17 14:38:43,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:43,281 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 346 transitions. [2025-03-17 14:38:43,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 72.0) internal successors, (216), 4 states have internal predecessors, (216), 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-17 14:38:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 346 transitions. [2025-03-17 14:38:43,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-17 14:38:43,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:43,282 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:43,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 14:38:43,283 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:43,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:43,283 INFO L85 PathProgramCache]: Analyzing trace with hash -375626784, now seen corresponding path program 1 times [2025-03-17 14:38:43,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:43,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451272682] [2025-03-17 14:38:43,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:43,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:43,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 14:38:43,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 14:38:43,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:43,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:38:43,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:43,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451272682] [2025-03-17 14:38:43,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451272682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:43,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:43,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:43,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214724213] [2025-03-17 14:38:43,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:43,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:38:43,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:43,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:38:43,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:38:43,397 INFO L87 Difference]: Start difference. First operand 333 states and 346 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-17 14:38:43,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:43,408 INFO L93 Difference]: Finished difference Result 443 states and 460 transitions. [2025-03-17 14:38:43,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:38:43,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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 230 [2025-03-17 14:38:43,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:43,411 INFO L225 Difference]: With dead ends: 443 [2025-03-17 14:38:43,411 INFO L226 Difference]: Without dead ends: 323 [2025-03-17 14:38:43,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:38:43,412 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:43,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 265 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:43,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-17 14:38:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2025-03-17 14:38:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 301 states have (on average 1.1096345514950166) internal successors, (334), 322 states have internal predecessors, (334), 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-17 14:38:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 334 transitions. [2025-03-17 14:38:43,419 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 334 transitions. Word has length 230 [2025-03-17 14:38:43,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:43,419 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 334 transitions. [2025-03-17 14:38:43,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-17 14:38:43,419 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 334 transitions. [2025-03-17 14:38:43,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-17 14:38:43,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:43,421 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:43,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 14:38:43,421 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:43,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:43,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1444184449, now seen corresponding path program 1 times [2025-03-17 14:38:43,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:43,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112879400] [2025-03-17 14:38:43,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:43,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:43,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 14:38:43,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 14:38:43,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:43,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:38:43,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:43,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112879400] [2025-03-17 14:38:43,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112879400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:43,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:43,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:43,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052501453] [2025-03-17 14:38:43,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:43,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:43,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:43,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:43,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:43,504 INFO L87 Difference]: Start difference. First operand 323 states and 334 transitions. Second operand has 4 states, 3 states have (on average 74.0) internal successors, (222), 4 states have internal predecessors, (222), 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-17 14:38:43,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:43,796 INFO L93 Difference]: Finished difference Result 492 states and 507 transitions. [2025-03-17 14:38:43,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:43,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 74.0) internal successors, (222), 4 states have internal predecessors, (222), 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 230 [2025-03-17 14:38:43,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:43,798 INFO L225 Difference]: With dead ends: 492 [2025-03-17 14:38:43,798 INFO L226 Difference]: Without dead ends: 490 [2025-03-17 14:38:43,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:43,799 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 177 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:43,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 174 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:38:43,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-17 14:38:43,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 326. [2025-03-17 14:38:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 304 states have (on average 1.1085526315789473) internal successors, (337), 325 states have internal predecessors, (337), 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-17 14:38:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 337 transitions. [2025-03-17 14:38:43,803 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 337 transitions. Word has length 230 [2025-03-17 14:38:43,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:43,803 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 337 transitions. [2025-03-17 14:38:43,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 74.0) internal successors, (222), 4 states have internal predecessors, (222), 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-17 14:38:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 337 transitions. [2025-03-17 14:38:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-17 14:38:43,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:43,804 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:43,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 14:38:43,805 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:43,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:43,805 INFO L85 PathProgramCache]: Analyzing trace with hash -914735244, now seen corresponding path program 1 times [2025-03-17 14:38:43,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:43,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931553984] [2025-03-17 14:38:43,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:43,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:43,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-17 14:38:43,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-17 14:38:43,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:43,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:38:43,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:43,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931553984] [2025-03-17 14:38:43,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931553984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:43,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293044828] [2025-03-17 14:38:43,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:43,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:43,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:43,909 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-17 14:38:43,911 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-17 14:38:43,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-17 14:38:44,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-17 14:38:44,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:44,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:44,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:44,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:38:44,068 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:38:44,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293044828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:44,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:38:44,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 14:38:44,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639666569] [2025-03-17 14:38:44,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:44,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:38:44,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:44,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:38:44,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:44,069 INFO L87 Difference]: Start difference. First operand 326 states and 337 transitions. Second operand has 5 states, 4 states have (on average 57.0) internal successors, (228), 5 states have internal predecessors, (228), 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-17 14:38:44,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:44,464 INFO L93 Difference]: Finished difference Result 490 states and 505 transitions. [2025-03-17 14:38:44,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:38:44,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 57.0) internal successors, (228), 5 states have internal predecessors, (228), 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 236 [2025-03-17 14:38:44,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:44,466 INFO L225 Difference]: With dead ends: 490 [2025-03-17 14:38:44,466 INFO L226 Difference]: Without dead ends: 471 [2025-03-17 14:38:44,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:44,467 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 211 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:44,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 166 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 14:38:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-17 14:38:44,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 307. [2025-03-17 14:38:44,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 304 states have (on average 1.0460526315789473) internal successors, (318), 306 states have internal predecessors, (318), 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-17 14:38:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 318 transitions. [2025-03-17 14:38:44,471 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 318 transitions. Word has length 236 [2025-03-17 14:38:44,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:44,471 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 318 transitions. [2025-03-17 14:38:44,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 57.0) internal successors, (228), 5 states have internal predecessors, (228), 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-17 14:38:44,471 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 318 transitions. [2025-03-17 14:38:44,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-17 14:38:44,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:44,472 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:44,480 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-17 14:38:44,673 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,SelfDestructingSolverStorable23 [2025-03-17 14:38:44,673 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:44,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:44,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1189518605, now seen corresponding path program 1 times [2025-03-17 14:38:44,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:44,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320724987] [2025-03-17 14:38:44,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:44,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:44,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-17 14:38:44,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-17 14:38:44,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:44,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 14:38:44,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:44,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320724987] [2025-03-17 14:38:44,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320724987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:44,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716487796] [2025-03-17 14:38:44,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:44,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:44,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:44,805 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-17 14:38:44,806 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-17 14:38:44,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-17 14:38:44,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-17 14:38:44,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:44,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:44,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:38:44,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 14:38:44,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:38:44,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716487796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:44,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:38:44,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 14:38:44,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939846527] [2025-03-17 14:38:44,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:44,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:38:44,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:44,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:38:44,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:38:44,947 INFO L87 Difference]: Start difference. First operand 307 states and 318 transitions. Second operand has 6 states, 5 states have (on average 47.6) internal successors, (238), 6 states have internal predecessors, (238), 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-17 14:38:45,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:45,242 INFO L93 Difference]: Finished difference Result 471 states and 486 transitions. [2025-03-17 14:38:45,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:38:45,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 47.6) internal successors, (238), 6 states have internal predecessors, (238), 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 248 [2025-03-17 14:38:45,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:45,248 INFO L225 Difference]: With dead ends: 471 [2025-03-17 14:38:45,248 INFO L226 Difference]: Without dead ends: 470 [2025-03-17 14:38:45,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:38:45,249 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 433 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:45,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 131 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:38:45,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-17 14:38:45,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 306. [2025-03-17 14:38:45,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 304 states have (on average 1.042763157894737) internal successors, (317), 305 states have internal predecessors, (317), 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-17 14:38:45,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 317 transitions. [2025-03-17 14:38:45,258 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 317 transitions. Word has length 248 [2025-03-17 14:38:45,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:45,258 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 317 transitions. [2025-03-17 14:38:45,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 47.6) internal successors, (238), 6 states have internal predecessors, (238), 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-17 14:38:45,259 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 317 transitions. [2025-03-17 14:38:45,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-17 14:38:45,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:45,260 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:45,273 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-17 14:38:45,460 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,SelfDestructingSolverStorable24 [2025-03-17 14:38:45,460 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:45,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:45,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1779628935, now seen corresponding path program 1 times [2025-03-17 14:38:45,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:45,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263635594] [2025-03-17 14:38:45,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:45,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:45,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 14:38:45,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 14:38:45,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:45,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 14:38:45,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:45,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263635594] [2025-03-17 14:38:45,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263635594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:45,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895313544] [2025-03-17 14:38:45,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:45,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:45,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:45,572 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-17 14:38:45,585 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-17 14:38:45,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 14:38:45,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 14:38:45,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:45,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:45,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:38:45,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 14:38:45,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 14:38:45,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895313544] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:45,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:45,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 14:38:45,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572991344] [2025-03-17 14:38:45,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:45,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:38:45,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:45,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:38:45,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:38:45,757 INFO L87 Difference]: Start difference. First operand 306 states and 317 transitions. Second operand has 12 states, 11 states have (on average 23.818181818181817) internal successors, (262), 12 states have internal predecessors, (262), 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-17 14:38:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:46,319 INFO L93 Difference]: Finished difference Result 492 states and 512 transitions. [2025-03-17 14:38:46,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:38:46,320 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 23.818181818181817) internal successors, (262), 12 states have internal predecessors, (262), 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 249 [2025-03-17 14:38:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:46,321 INFO L225 Difference]: With dead ends: 492 [2025-03-17 14:38:46,321 INFO L226 Difference]: Without dead ends: 491 [2025-03-17 14:38:46,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:38:46,322 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 609 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:46,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 346 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 14:38:46,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-03-17 14:38:46,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 327. [2025-03-17 14:38:46,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 325 states have (on average 1.0492307692307692) internal successors, (341), 326 states have internal predecessors, (341), 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-17 14:38:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 341 transitions. [2025-03-17 14:38:46,327 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 341 transitions. Word has length 249 [2025-03-17 14:38:46,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:46,327 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 341 transitions. [2025-03-17 14:38:46,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 23.818181818181817) internal successors, (262), 12 states have internal predecessors, (262), 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-17 14:38:46,327 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 341 transitions. [2025-03-17 14:38:46,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-17 14:38:46,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:46,328 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:46,337 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-17 14:38:46,528 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,SelfDestructingSolverStorable25 [2025-03-17 14:38:46,529 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:46,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:46,529 INFO L85 PathProgramCache]: Analyzing trace with hash 517970098, now seen corresponding path program 2 times [2025-03-17 14:38:46,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:46,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600996154] [2025-03-17 14:38:46,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:46,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:46,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 270 statements into 2 equivalence classes. [2025-03-17 14:38:46,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 270 statements. [2025-03-17 14:38:46,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:38:46,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:46,581 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-17 14:38:46,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:46,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600996154] [2025-03-17 14:38:46,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600996154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:46,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927360339] [2025-03-17 14:38:46,582 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:46,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:46,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:46,584 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-17 14:38:46,585 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-17 14:38:46,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 270 statements into 2 equivalence classes. [2025-03-17 14:38:46,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 270 statements. [2025-03-17 14:38:46,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:38:46,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:46,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:46,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:46,893 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-17 14:38:46,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-17 14:38:47,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927360339] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:47,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:47,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-17 14:38:47,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403011474] [2025-03-17 14:38:47,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:47,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:38:47,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:47,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:38:47,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:38:47,142 INFO L87 Difference]: Start difference. First operand 327 states and 341 transitions. Second operand has 5 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 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-17 14:38:47,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:47,334 INFO L93 Difference]: Finished difference Result 327 states and 341 transitions. [2025-03-17 14:38:47,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:38:47,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 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 270 [2025-03-17 14:38:47,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:47,335 INFO L225 Difference]: With dead ends: 327 [2025-03-17 14:38:47,335 INFO L226 Difference]: Without dead ends: 290 [2025-03-17 14:38:47,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 536 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:47,336 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 238 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:47,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 68 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:38:47,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-17 14:38:47,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-03-17 14:38:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 1.0311418685121108) internal successors, (298), 289 states have internal predecessors, (298), 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-17 14:38:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 298 transitions. [2025-03-17 14:38:47,339 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 298 transitions. Word has length 270 [2025-03-17 14:38:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:47,339 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 298 transitions. [2025-03-17 14:38:47,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 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-17 14:38:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 298 transitions. [2025-03-17 14:38:47,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-17 14:38:47,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:47,340 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:47,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 14:38:47,540 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,SelfDestructingSolverStorable26 [2025-03-17 14:38:47,541 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 219 more)] === [2025-03-17 14:38:47,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:47,541 INFO L85 PathProgramCache]: Analyzing trace with hash -573548758, now seen corresponding path program 1 times [2025-03-17 14:38:47,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:47,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426686861] [2025-03-17 14:38:47,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:47,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:47,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 14:38:47,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 14:38:47,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:47,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:38:47,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:47,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426686861] [2025-03-17 14:38:47,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426686861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:47,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:47,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:47,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814106549] [2025-03-17 14:38:47,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:47,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:47,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:47,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:47,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:47,615 INFO L87 Difference]: Start difference. First operand 290 states and 298 transitions. Second operand has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 4 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-17 14:38:47,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:47,815 INFO L93 Difference]: Finished difference Result 310 states and 322 transitions. [2025-03-17 14:38:47,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:47,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 4 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) Word has length 273 [2025-03-17 14:38:47,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:47,816 INFO L225 Difference]: With dead ends: 310 [2025-03-17 14:38:47,816 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:38:47,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:47,816 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 181 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:47,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 104 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:38:47,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:38:47,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:38:47,817 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-17 14:38:47,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:38:47,817 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 273 [2025-03-17 14:38:47,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:47,817 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:38:47,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 4 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-17 14:38:47,817 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:38:47,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (221 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (220 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (219 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (218 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (217 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (216 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (215 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (214 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (213 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (212 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (211 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (210 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (209 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (208 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (207 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (206 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (205 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (204 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (203 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (202 of 222 remaining) [2025-03-17 14:38:47,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (201 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (200 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (199 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (198 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (197 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (196 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (195 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (194 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (193 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (192 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (191 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (190 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (189 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (188 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (187 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (186 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (185 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (184 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (183 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (182 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (181 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (180 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (179 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (178 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (177 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (176 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (175 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (174 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (173 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (172 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (171 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (170 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (169 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (168 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (167 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (166 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (165 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (164 of 222 remaining) [2025-03-17 14:38:47,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (163 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (162 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (161 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (160 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (159 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (158 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (157 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (156 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (155 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (154 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (153 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (152 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (151 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (150 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (149 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (148 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (147 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (146 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 222 remaining) [2025-03-17 14:38:47,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 222 remaining) [2025-03-17 14:38:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr141ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr146ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr147ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr148ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr149ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr150ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr151ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr152ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr153ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr154ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr155ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr156ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr157ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr158ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr159ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 222 remaining) [2025-03-17 14:38:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr160ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr161ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr162ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr163ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr164ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr165ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr166ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr167ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr168ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr169ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr170ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr171ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr172ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr173ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr174ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr175ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr176ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr177ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr178ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr179ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr180ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr181ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr182ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr183ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr184ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr185ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr186ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr187ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr188ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr189ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr190ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr191ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr192ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr193ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr194ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr195ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr196ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr197ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr198ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 222 remaining) [2025-03-17 14:38:47,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr199ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr200ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr201ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr202ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr203ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr204ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr205ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr206ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr207ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr208ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr209ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr210ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr211ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr212ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr213ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr214ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr215ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr216ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr217ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr218ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 222 remaining) [2025-03-17 14:38:47,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr219ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 222 remaining) [2025-03-17 14:38:47,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr220ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 222 remaining) [2025-03-17 14:38:47,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr221ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 222 remaining) [2025-03-17 14:38:47,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 14:38:47,830 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:47,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:38:48,021 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:38:48,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:38:48 BoogieIcfgContainer [2025-03-17 14:38:48,034 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:38:48,034 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:38:48,034 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:38:48,034 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:38:48,035 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:38:29" (3/4) ... [2025-03-17 14:38:48,036 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:38:48,050 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-17 14:38:48,050 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-17 14:38:48,051 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:38:48,051 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:38:48,052 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:38:48,130 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:38:48,130 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:38:48,130 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:38:48,131 INFO L158 Benchmark]: Toolchain (without parser) took 19197.31ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 105.9MB in the beginning and 138.3MB in the end (delta: -32.4MB). Peak memory consumption was 149.7MB. Max. memory is 16.1GB. [2025-03-17 14:38:48,131 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:38:48,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.46ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 91.4MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:38:48,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.21ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:38:48,131 INFO L158 Benchmark]: Boogie Preprocessor took 50.37ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:38:48,131 INFO L158 Benchmark]: IcfgBuilder took 658.53ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 38.7MB in the end (delta: 48.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-17 14:38:48,131 INFO L158 Benchmark]: TraceAbstraction took 18099.45ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 38.7MB in the beginning and 150.2MB in the end (delta: -111.5MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. [2025-03-17 14:38:48,132 INFO L158 Benchmark]: Witness Printer took 96.04ms. Allocated memory is still 327.2MB. Free memory was 150.2MB in the beginning and 138.3MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:38:48,132 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.37ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.46ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 91.4MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.21ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.37ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 658.53ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 38.7MB in the end (delta: 48.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18099.45ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 38.7MB in the beginning and 150.2MB in the end (delta: -111.5MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. * Witness Printer took 96.04ms. Allocated memory is still 327.2MB. Free memory was 150.2MB in the beginning and 138.3MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 104]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 98]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 98]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 98]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 98]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 102]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 102]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 102]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 102]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 91]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 86]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 74]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 73]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 72]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: 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: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: 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: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: 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, 473 locations, 493 edges, 222 error locations. Started 1 CEGAR loops. OverallTime: 17.9s, OverallIterations: 28, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10432 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10432 mSDsluCounter, 8234 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3717 mSDsCounter, 649 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19316 IncrementalHoareTripleChecker+Invalid, 19965 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 649 mSolverCounterUnsat, 4517 mSDtfsCounter, 19316 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2674 GetRequests, 2567 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=688occurred in iteration=7, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 1313 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 5559 NumberOfCodeBlocks, 4831 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 6323 ConstructedInterpolants, 0 QuantifiedInterpolants, 14086 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2912 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 44 InterpolantComputations, 23 PerfectInterpolantSequences, 1219/1406 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 222 specifications checked. All of them hold - InvariantResult [Line: 94]: Location Invariant Derived location invariant: (((((((2 <= CELLCOUNT) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) || ((((((2 <= CELLCOUNT) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (2 <= i)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0))) - InvariantResult [Line: 110]: Location Invariant Derived location invariant: (((((((i == 0) && (2 <= CELLCOUNT)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) || ((((((1 <= i) && (2 <= CELLCOUNT)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0))) - InvariantResult [Line: 30]: Location Invariant Derived location invariant: (((((((2 <= CELLCOUNT) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) || ((((((2 <= CELLCOUNT) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (2 <= i)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0))) - InvariantResult [Line: 62]: Location Invariant Derived location invariant: (((((((2 <= CELLCOUNT) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) || ((((((2 <= CELLCOUNT) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (2 <= i)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0))) - InvariantResult [Line: 78]: Location Invariant Derived location invariant: (((((((2 <= CELLCOUNT) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) || ((((((2 <= CELLCOUNT) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (2 <= i)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0))) - InvariantResult [Line: 46]: Location Invariant Derived location invariant: (((((((2 <= CELLCOUNT) && (i == 1)) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0)) || ((((((2 <= CELLCOUNT) && (2 == MINVAL)) && (CELLCOUNT <= 2147483647)) && (CCCELVOL1 == 1)) && (2 <= i)) && (((CELLCOUNT >= 0) ? (CELLCOUNT % 5) : ((CELLCOUNT % 5) + 5)) == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:38:48,153 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