./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_11_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_11_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash fa5ae6c2527ebd11f7510cac1531f24c50e68df9c11b670327453eb5f8a744ee --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:46:31,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:46:31,514 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:46:31,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:46:31,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:46:31,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:46:31,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:46:31,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:46:31,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:46:31,537 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:46:31,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:46:31,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:46:31,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:46:31,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:46:31,537 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:46:31,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:46:31,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:46:31,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:46:31,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:46:31,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:46:31,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:46:31,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:46:31,538 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:46:31,538 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:46:31,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:46:31,538 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:46:31,538 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:46:31,538 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:46:31,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:46:31,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:46:31,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:46:31,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:46:31,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:46:31,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:46:31,539 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:46:31,539 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:46:31,539 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:46:31,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:46:31,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:46:31,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:46:31,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:46:31,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:46:31,540 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa5ae6c2527ebd11f7510cac1531f24c50e68df9c11b670327453eb5f8a744ee [2025-03-09 05:46:31,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:46:31,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:46:31,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:46:31,786 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:46:31,786 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:46:31,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_11_good.i [2025-03-09 05:46:32,975 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18cd305f1/e3ae3b6c65934b4ca6c24d9314578d1a/FLAGbb437388f [2025-03-09 05:46:33,306 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:46:33,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_postdec_11_good.i [2025-03-09 05:46:33,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18cd305f1/e3ae3b6c65934b4ca6c24d9314578d1a/FLAGbb437388f [2025-03-09 05:46:33,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18cd305f1/e3ae3b6c65934b4ca6c24d9314578d1a [2025-03-09 05:46:33,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:46:33,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:46:33,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:46:33,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:46:33,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:46:33,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:46:33" (1/1) ... [2025-03-09 05:46:33,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a3954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:33, skipping insertion in model container [2025-03-09 05:46:33,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:46:33" (1/1) ... [2025-03-09 05:46:33,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:46:33,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:46:33,975 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:46:34,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:46:34,120 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:46:34,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:34 WrapperNode [2025-03-09 05:46:34,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:46:34,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:46:34,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:46:34,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:46:34,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:34" (1/1) ... [2025-03-09 05:46:34,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:34" (1/1) ... [2025-03-09 05:46:34,159 INFO L138 Inliner]: procedures = 501, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 121 [2025-03-09 05:46:34,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:46:34,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:46:34,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:46:34,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:46:34,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:34" (1/1) ... [2025-03-09 05:46:34,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:34" (1/1) ... [2025-03-09 05:46:34,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:34" (1/1) ... [2025-03-09 05:46:34,176 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 05:46:34,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:34" (1/1) ... [2025-03-09 05:46:34,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:34" (1/1) ... [2025-03-09 05:46:34,180 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:34" (1/1) ... [2025-03-09 05:46:34,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:34" (1/1) ... [2025-03-09 05:46:34,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:34" (1/1) ... [2025-03-09 05:46:34,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:34" (1/1) ... [2025-03-09 05:46:34,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:46:34,185 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:46:34,185 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:46:34,185 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:46:34,186 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:34" (1/1) ... [2025-03-09 05:46:34,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:46:34,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:46:34,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 05:46:34,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 05:46:34,247 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-09 05:46:34,248 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-09 05:46:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 05:46:34,248 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 05:46:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2025-03-09 05:46:34,248 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2025-03-09 05:46:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:46:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:46:34,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:46:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsFalse [2025-03-09 05:46:34,248 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsFalse [2025-03-09 05:46:34,340 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:46:34,342 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:46:34,505 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-03-09 05:46:34,505 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:46:34,515 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:46:34,515 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:46:34,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:46:34 BoogieIcfgContainer [2025-03-09 05:46:34,515 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:46:34,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:46:34,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:46:34,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:46:34,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:46:33" (1/3) ... [2025-03-09 05:46:34,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7b6f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:46:34, skipping insertion in model container [2025-03-09 05:46:34,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:34" (2/3) ... [2025-03-09 05:46:34,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f7b6f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:46:34, skipping insertion in model container [2025-03-09 05:46:34,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:46:34" (3/3) ... [2025-03-09 05:46:34,523 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_postdec_11_good.i [2025-03-09 05:46:34,536 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:46:34,537 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE191_Integer_Underflow__int_min_postdec_11_good.i that has 5 procedures, 81 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-09 05:46:34,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:46:34,597 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;@65043d03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:46:34,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 05:46:34,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 50 states have (on average 1.38) internal successors, (69), 62 states have internal predecessors, (69), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 05:46:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:46:34,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:46:34,606 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] [2025-03-09 05:46:34,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:46:34,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:46:34,611 INFO L85 PathProgramCache]: Analyzing trace with hash 15521373, now seen corresponding path program 1 times [2025-03-09 05:46:34,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:46:34,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230378396] [2025-03-09 05:46:34,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:46:34,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:46:34,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 05:46:34,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 05:46:34,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:46:34,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:46:34,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:46:34,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:46:34,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230378396] [2025-03-09 05:46:34,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230378396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:46:34,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:46:34,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:46:34,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676246696] [2025-03-09 05:46:34,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:46:34,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:46:34,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:46:34,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:46:34,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:46:34,867 INFO L87 Difference]: Start difference. First operand has 81 states, 50 states have (on average 1.38) internal successors, (69), 62 states have internal predecessors, (69), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:46:34,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:46:34,891 INFO L93 Difference]: Finished difference Result 155 states and 199 transitions. [2025-03-09 05:46:34,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:46:34,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-03-09 05:46:34,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:46:34,898 INFO L225 Difference]: With dead ends: 155 [2025-03-09 05:46:34,898 INFO L226 Difference]: Without dead ends: 78 [2025-03-09 05:46:34,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:46:34,902 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:46:34,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 213 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:46:34,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-09 05:46:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2025-03-09 05:46:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 58 states have internal predecessors, (65), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-09 05:46:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2025-03-09 05:46:34,938 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 22 [2025-03-09 05:46:34,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:46:34,940 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2025-03-09 05:46:34,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:46:34,940 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2025-03-09 05:46:34,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:46:34,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:46:34,942 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] [2025-03-09 05:46:34,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:46:34,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:46:34,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:46:34,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1791933090, now seen corresponding path program 1 times [2025-03-09 05:46:34,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:46:34,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68481097] [2025-03-09 05:46:34,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:46:34,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:46:34,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 05:46:34,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 05:46:34,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:46:34,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:46:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:46:35,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:46:35,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68481097] [2025-03-09 05:46:35,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68481097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:46:35,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:46:35,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:46:35,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368795603] [2025-03-09 05:46:35,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:46:35,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:46:35,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:46:35,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:46:35,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:46:35,042 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:46:35,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:46:35,065 INFO L93 Difference]: Finished difference Result 131 states and 168 transitions. [2025-03-09 05:46:35,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:46:35,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-03-09 05:46:35,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:46:35,066 INFO L225 Difference]: With dead ends: 131 [2025-03-09 05:46:35,066 INFO L226 Difference]: Without dead ends: 66 [2025-03-09 05:46:35,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-09 05:46:35,068 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:46:35,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:46:35,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-09 05:46:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-09 05:46:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-09 05:46:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2025-03-09 05:46:35,076 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 22 [2025-03-09 05:46:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:46:35,077 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2025-03-09 05:46:35,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:46:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2025-03-09 05:46:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 05:46:35,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:46:35,078 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 05:46:35,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 05:46:35,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:46:35,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:46:35,079 INFO L85 PathProgramCache]: Analyzing trace with hash -399191791, now seen corresponding path program 1 times [2025-03-09 05:46:35,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:46:35,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466836275] [2025-03-09 05:46:35,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:46:35,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:46:35,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 05:46:35,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 05:46:35,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:46:35,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:46:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 05:46:35,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:46:35,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466836275] [2025-03-09 05:46:35,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466836275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:46:35,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:46:35,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:46:35,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82532489] [2025-03-09 05:46:35,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:46:35,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:46:35,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:46:35,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:46:35,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:46:35,176 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 05:46:35,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:46:35,194 INFO L93 Difference]: Finished difference Result 119 states and 149 transitions. [2025-03-09 05:46:35,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:46:35,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2025-03-09 05:46:35,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:46:35,198 INFO L225 Difference]: With dead ends: 119 [2025-03-09 05:46:35,199 INFO L226 Difference]: Without dead ends: 65 [2025-03-09 05:46:35,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-09 05:46:35,200 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:46:35,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:46:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-09 05:46:35,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-09 05:46:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-09 05:46:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2025-03-09 05:46:35,208 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 40 [2025-03-09 05:46:35,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:46:35,208 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2025-03-09 05:46:35,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 05:46:35,208 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2025-03-09 05:46:35,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-09 05:46:35,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:46:35,209 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 05:46:35,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:46:35,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:46:35,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:46:35,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1804523872, now seen corresponding path program 1 times [2025-03-09 05:46:35,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:46:35,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799190173] [2025-03-09 05:46:35,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:46:35,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:46:35,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 05:46:35,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 05:46:35,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:46:35,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:46:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 05:46:35,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:46:35,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799190173] [2025-03-09 05:46:35,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799190173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:46:35,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:46:35,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:46:35,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995523430] [2025-03-09 05:46:35,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:46:35,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:46:35,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:46:35,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:46:35,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:46:35,296 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 05:46:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:46:35,321 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2025-03-09 05:46:35,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:46:35,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2025-03-09 05:46:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:46:35,322 INFO L225 Difference]: With dead ends: 114 [2025-03-09 05:46:35,323 INFO L226 Difference]: Without dead ends: 70 [2025-03-09 05:46:35,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:46:35,325 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:46:35,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:46:35,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-09 05:46:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-03-09 05:46:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 51 states have internal predecessors, (57), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-09 05:46:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2025-03-09 05:46:35,332 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 41 [2025-03-09 05:46:35,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:46:35,332 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2025-03-09 05:46:35,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 05:46:35,332 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2025-03-09 05:46:35,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-09 05:46:35,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:46:35,334 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 05:46:35,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 05:46:35,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:46:35,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:46:35,334 INFO L85 PathProgramCache]: Analyzing trace with hash 682988961, now seen corresponding path program 1 times [2025-03-09 05:46:35,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:46:35,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413371132] [2025-03-09 05:46:35,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:46:35,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:46:35,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 05:46:35,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 05:46:35,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:46:35,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:46:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 05:46:35,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:46:35,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413371132] [2025-03-09 05:46:35,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413371132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:46:35,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958911180] [2025-03-09 05:46:35,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:46:35,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:46:35,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:46:35,393 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:46:35,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 05:46:35,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 05:46:35,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 05:46:35,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:46:35,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:46:35,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:46:35,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:46:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:46:35,533 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:46:35,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958911180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:46:35,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:46:35,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 05:46:35,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071962904] [2025-03-09 05:46:35,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:46:35,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:46:35,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:46:35,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:46:35,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:46:35,535 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 05:46:35,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:46:35,558 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2025-03-09 05:46:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:46:35,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2025-03-09 05:46:35,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:46:35,560 INFO L225 Difference]: With dead ends: 108 [2025-03-09 05:46:35,560 INFO L226 Difference]: Without dead ends: 59 [2025-03-09 05:46:35,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:46:35,561 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:46:35,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:46:35,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-09 05:46:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-09 05:46:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 43 states have internal predecessors, (46), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-09 05:46:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2025-03-09 05:46:35,570 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 41 [2025-03-09 05:46:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:46:35,573 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2025-03-09 05:46:35,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 05:46:35,573 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2025-03-09 05:46:35,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 05:46:35,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:46:35,574 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2025-03-09 05:46:35,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 05:46:35,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:46:35,776 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:46:35,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:46:35,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1239126661, now seen corresponding path program 1 times [2025-03-09 05:46:35,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:46:35,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929757660] [2025-03-09 05:46:35,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:46:35,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:46:35,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 05:46:35,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 05:46:35,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:46:35,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:46:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-09 05:46:35,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:46:35,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929757660] [2025-03-09 05:46:35,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929757660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:46:35,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214114067] [2025-03-09 05:46:35,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:46:35,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:46:35,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:46:35,848 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:46:35,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 05:46:35,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 05:46:35,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 05:46:35,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:46:35,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:46:35,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:46:35,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:46:35,950 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 05:46:35,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:46:35,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214114067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:46:35,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:46:35,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 05:46:35,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566348898] [2025-03-09 05:46:35,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:46:35,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:46:35,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:46:35,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:46:35,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:46:35,952 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 05:46:35,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:46:35,966 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2025-03-09 05:46:35,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:46:35,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 53 [2025-03-09 05:46:35,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:46:35,970 INFO L225 Difference]: With dead ends: 97 [2025-03-09 05:46:35,970 INFO L226 Difference]: Without dead ends: 59 [2025-03-09 05:46:35,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:46:35,971 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:46:35,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:46:35,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-09 05:46:35,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-09 05:46:35,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 42 states have internal predecessors, (45), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-09 05:46:35,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2025-03-09 05:46:35,981 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 53 [2025-03-09 05:46:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:46:35,983 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2025-03-09 05:46:35,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 05:46:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2025-03-09 05:46:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-09 05:46:35,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:46:35,984 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2025-03-09 05:46:35,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 05:46:36,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 05:46:36,186 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:46:36,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:46:36,186 INFO L85 PathProgramCache]: Analyzing trace with hash 294375701, now seen corresponding path program 1 times [2025-03-09 05:46:36,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:46:36,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594397113] [2025-03-09 05:46:36,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:46:36,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:46:36,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 05:46:36,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 05:46:36,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:46:36,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:46:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-09 05:46:36,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:46:36,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594397113] [2025-03-09 05:46:36,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594397113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:46:36,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:46:36,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:46:36,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566032431] [2025-03-09 05:46:36,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:46:36,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:46:36,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:46:36,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:46:36,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:46:36,262 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-09 05:46:36,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:46:36,283 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2025-03-09 05:46:36,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:46:36,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 59 [2025-03-09 05:46:36,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:46:36,285 INFO L225 Difference]: With dead ends: 60 [2025-03-09 05:46:36,285 INFO L226 Difference]: Without dead ends: 59 [2025-03-09 05:46:36,285 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-09 05:46:36,285 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:46:36,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 186 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:46:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-09 05:46:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2025-03-09 05:46:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 41 states have internal predecessors, (44), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-09 05:46:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2025-03-09 05:46:36,291 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 59 [2025-03-09 05:46:36,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:46:36,291 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2025-03-09 05:46:36,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-09 05:46:36,291 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2025-03-09 05:46:36,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 05:46:36,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:46:36,292 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2025-03-09 05:46:36,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 05:46:36,292 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:46:36,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:46:36,293 INFO L85 PathProgramCache]: Analyzing trace with hash 535712140, now seen corresponding path program 1 times [2025-03-09 05:46:36,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:46:36,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701087862] [2025-03-09 05:46:36,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:46:36,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:46:36,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 05:46:36,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 05:46:36,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:46:36,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:46:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-09 05:46:36,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:46:36,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701087862] [2025-03-09 05:46:36,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701087862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:46:36,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:46:36,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:46:36,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673625283] [2025-03-09 05:46:36,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:46:36,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:46:36,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:46:36,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:46:36,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:46:36,358 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-09 05:46:36,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:46:36,376 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2025-03-09 05:46:36,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:46:36,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 60 [2025-03-09 05:46:36,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:46:36,378 INFO L225 Difference]: With dead ends: 65 [2025-03-09 05:46:36,378 INFO L226 Difference]: Without dead ends: 64 [2025-03-09 05:46:36,378 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-09 05:46:36,379 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:46:36,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 195 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:46:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-09 05:46:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2025-03-09 05:46:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-09 05:46:36,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2025-03-09 05:46:36,384 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 60 [2025-03-09 05:46:36,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:46:36,384 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2025-03-09 05:46:36,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-09 05:46:36,384 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2025-03-09 05:46:36,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-09 05:46:36,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:46:36,385 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2025-03-09 05:46:36,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 05:46:36,385 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:46:36,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:46:36,386 INFO L85 PathProgramCache]: Analyzing trace with hash 74228947, now seen corresponding path program 1 times [2025-03-09 05:46:36,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:46:36,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524507753] [2025-03-09 05:46:36,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:46:36,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:46:36,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 05:46:36,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 05:46:36,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:46:36,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:46:36,437 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-09 05:46:36,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:46:36,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524507753] [2025-03-09 05:46:36,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524507753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:46:36,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:46:36,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:46:36,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010754294] [2025-03-09 05:46:36,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:46:36,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:46:36,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:46:36,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:46:36,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:46:36,439 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-09 05:46:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:46:36,450 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2025-03-09 05:46:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:46:36,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 65 [2025-03-09 05:46:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:46:36,452 INFO L225 Difference]: With dead ends: 86 [2025-03-09 05:46:36,452 INFO L226 Difference]: Without dead ends: 56 [2025-03-09 05:46:36,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-09 05:46:36,453 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:46:36,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:46:36,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-09 05:46:36,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-09 05:46:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 05:46:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-03-09 05:46:36,458 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 65 [2025-03-09 05:46:36,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:46:36,458 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-03-09 05:46:36,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-09 05:46:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2025-03-09 05:46:36,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-09 05:46:36,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:46:36,459 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 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] [2025-03-09 05:46:36,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 05:46:36,459 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:46:36,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:46:36,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2129667799, now seen corresponding path program 1 times [2025-03-09 05:46:36,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:46:36,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972565275] [2025-03-09 05:46:36,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:46:36,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:46:36,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 05:46:36,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 05:46:36,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:46:36,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:46:36,515 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 05:46:36,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:46:36,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972565275] [2025-03-09 05:46:36,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972565275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:46:36,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192303313] [2025-03-09 05:46:36,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:46:36,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:46:36,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:46:36,518 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:46:36,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 05:46:36,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 05:46:36,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 05:46:36,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:46:36,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:46:36,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:46:36,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:46:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 05:46:36,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:46:36,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192303313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:46:36,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:46:36,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 05:46:36,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151044745] [2025-03-09 05:46:36,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:46:36,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:46:36,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:46:36,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:46:36,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:46:36,621 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-09 05:46:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:46:36,632 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2025-03-09 05:46:36,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:46:36,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 72 [2025-03-09 05:46:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:46:36,634 INFO L225 Difference]: With dead ends: 70 [2025-03-09 05:46:36,636 INFO L226 Difference]: Without dead ends: 56 [2025-03-09 05:46:36,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:46:36,637 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:46:36,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:46:36,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-09 05:46:36,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-09 05:46:36,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 05:46:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2025-03-09 05:46:36,651 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 72 [2025-03-09 05:46:36,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:46:36,651 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2025-03-09 05:46:36,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-09 05:46:36,651 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2025-03-09 05:46:36,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-09 05:46:36,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:46:36,652 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 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] [2025-03-09 05:46:36,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 05:46:36,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:46:36,857 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:46:36,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:46:36,857 INFO L85 PathProgramCache]: Analyzing trace with hash -492670067, now seen corresponding path program 1 times [2025-03-09 05:46:36,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:46:36,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405572695] [2025-03-09 05:46:36,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:46:36,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:46:36,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-09 05:46:36,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-09 05:46:36,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:46:36,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:46:36,920 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 05:46:36,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:46:36,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405572695] [2025-03-09 05:46:36,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405572695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:46:36,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:46:36,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:46:36,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104232455] [2025-03-09 05:46:36,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:46:36,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:46:36,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:46:36,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:46:36,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:46:36,923 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-09 05:46:36,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:46:36,944 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2025-03-09 05:46:36,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:46:36,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2025-03-09 05:46:36,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:46:36,946 INFO L225 Difference]: With dead ends: 56 [2025-03-09 05:46:36,946 INFO L226 Difference]: Without dead ends: 55 [2025-03-09 05:46:36,946 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-09 05:46:36,946 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 3 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:46:36,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 175 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:46:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-09 05:46:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-09 05:46:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 05:46:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2025-03-09 05:46:36,953 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 79 [2025-03-09 05:46:36,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:46:36,953 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2025-03-09 05:46:36,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-09 05:46:36,953 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2025-03-09 05:46:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-09 05:46:36,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:46:36,954 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 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] [2025-03-09 05:46:36,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 05:46:36,954 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:46:36,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:46:36,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1907097093, now seen corresponding path program 1 times [2025-03-09 05:46:36,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:46:36,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451534636] [2025-03-09 05:46:36,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:46:36,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:46:36,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 05:46:36,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 05:46:36,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:46:36,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:46:36,996 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-09 05:46:36,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:46:36,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451534636] [2025-03-09 05:46:36,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451534636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:46:36,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:46:36,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:46:36,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142437680] [2025-03-09 05:46:36,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:46:36,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:46:36,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:46:36,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:46:36,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:46:36,997 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-09 05:46:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:46:37,006 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2025-03-09 05:46:37,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:46:37,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2025-03-09 05:46:37,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:46:37,007 INFO L225 Difference]: With dead ends: 61 [2025-03-09 05:46:37,007 INFO L226 Difference]: Without dead ends: 55 [2025-03-09 05:46:37,008 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-09 05:46:37,008 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:46:37,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:46:37,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-09 05:46:37,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-09 05:46:37,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 05:46:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2025-03-09 05:46:37,015 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 80 [2025-03-09 05:46:37,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:46:37,015 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2025-03-09 05:46:37,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-09 05:46:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2025-03-09 05:46:37,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-09 05:46:37,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:46:37,016 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 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] [2025-03-09 05:46:37,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 05:46:37,016 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 05:46:37,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:46:37,016 INFO L85 PathProgramCache]: Analyzing trace with hash 99642630, now seen corresponding path program 1 times [2025-03-09 05:46:37,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:46:37,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094211176] [2025-03-09 05:46:37,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:46:37,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:46:37,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 05:46:37,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 05:46:37,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:46:37,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:46:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 05:46:37,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:46:37,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094211176] [2025-03-09 05:46:37,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094211176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:46:37,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647350226] [2025-03-09 05:46:37,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:46:37,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:46:37,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:46:37,088 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:46:37,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 05:46:37,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 05:46:37,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 05:46:37,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:46:37,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:46:37,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:46:37,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:46:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-09 05:46:37,217 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:46:37,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647350226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:46:37,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:46:37,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 05:46:37,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414278606] [2025-03-09 05:46:37,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:46:37,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:46:37,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:46:37,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:46:37,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:46:37,221 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-09 05:46:37,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:46:37,228 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2025-03-09 05:46:37,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:46:37,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2025-03-09 05:46:37,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:46:37,229 INFO L225 Difference]: With dead ends: 58 [2025-03-09 05:46:37,229 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 05:46:37,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:46:37,231 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:46:37,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:46:37,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 05:46:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 05:46:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:46:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 05:46:37,232 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2025-03-09 05:46:37,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:46:37,233 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 05:46:37,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-09 05:46:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 05:46:37,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 05:46:37,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-09 05:46:37,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-09 05:46:37,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-09 05:46:37,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-09 05:46:37,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-09 05:46:37,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-09 05:46:37,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-09 05:46:37,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-09 05:46:37,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 05:46:37,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:46:37,446 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:46:37,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 05:46:37,488 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 05:46:37,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 05:46:37 BoogieIcfgContainer [2025-03-09 05:46:37,494 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 05:46:37,494 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 05:46:37,494 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 05:46:37,494 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 05:46:37,495 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:46:34" (3/4) ... [2025-03-09 05:46:37,496 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 05:46:37,500 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-09 05:46:37,500 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure globalReturnsFalse [2025-03-09 05:46:37,500 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-09 05:46:37,500 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrue [2025-03-09 05:46:37,503 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-09 05:46:37,503 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-09 05:46:37,503 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 05:46:37,503 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 05:46:37,573 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 05:46:37,573 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 05:46:37,573 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 05:46:37,575 INFO L158 Benchmark]: Toolchain (without parser) took 4221.33ms. Allocated memory is still 142.6MB. Free memory was 108.8MB in the beginning and 35.3MB in the end (delta: 73.5MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. [2025-03-09 05:46:37,575 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:46:37,576 INFO L158 Benchmark]: CACSL2BoogieTranslator took 766.38ms. Allocated memory is still 142.6MB. Free memory was 108.8MB in the beginning and 48.7MB in the end (delta: 60.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-09 05:46:37,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.20ms. Allocated memory is still 142.6MB. Free memory was 48.7MB in the beginning and 45.9MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 05:46:37,576 INFO L158 Benchmark]: Boogie Preprocessor took 23.81ms. Allocated memory is still 142.6MB. Free memory was 45.9MB in the beginning and 44.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:46:37,576 INFO L158 Benchmark]: IcfgBuilder took 330.41ms. Allocated memory is still 142.6MB. Free memory was 44.2MB in the beginning and 97.2MB in the end (delta: -53.0MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2025-03-09 05:46:37,577 INFO L158 Benchmark]: TraceAbstraction took 2976.51ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 41.1MB in the end (delta: 55.4MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2025-03-09 05:46:37,577 INFO L158 Benchmark]: Witness Printer took 79.48ms. Allocated memory is still 142.6MB. Free memory was 41.1MB in the beginning and 35.3MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:46:37,578 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.27ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 766.38ms. Allocated memory is still 142.6MB. Free memory was 108.8MB in the beginning and 48.7MB in the end (delta: 60.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.20ms. Allocated memory is still 142.6MB. Free memory was 48.7MB in the beginning and 45.9MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.81ms. Allocated memory is still 142.6MB. Free memory was 45.9MB in the beginning and 44.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 330.41ms. Allocated memory is still 142.6MB. Free memory was 44.2MB in the beginning and 97.2MB in the end (delta: -53.0MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2976.51ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 41.1MB in the end (delta: 55.4MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. * Witness Printer took 79.48ms. Allocated memory is still 142.6MB. Free memory was 41.1MB in the beginning and 35.3MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1628]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1611]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: 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 5 procedures, 81 locations, 123 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 2525 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1589 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 103 IncrementalHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 936 mSDtfsCounter, 103 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 960 NumberOfCodeBlocks, 960 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 943 ConstructedInterpolants, 0 QuantifiedInterpolants, 1135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 740 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 563/573 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 05:46:37,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE