./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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/systemc/kundu1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:33:57,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:33:57,157 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:33:57,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:33:57,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:33:57,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:33:57,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:33:57,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:33:57,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:33:57,185 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:33:57,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:33:57,185 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:33:57,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:33:57,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:33:57,186 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:33:57,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:33:57,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:33:57,186 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:33:57,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:33:57,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:33:57,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:33:57,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:33:57,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:33:57,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:33:57,186 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:33:57,186 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:33:57,186 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:33:57,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:33:57,186 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:33:57,186 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:33:57,186 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:33:57,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:33:57,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:33:57,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:33:57,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:33:57,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:33:57,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:33:57,187 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:33:57,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:33:57,187 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:33:57,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:33:57,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:33:57,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:33:57,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:33:57,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:33:57,187 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2025-03-04 11:33:57,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:33:57,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:33:57,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:33:57,403 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:33:57,403 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:33:57,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu1.cil.c [2025-03-04 11:33:58,556 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f52f6abed/d612f9e024ff4f3aa7cbe9c4022ad5c3/FLAG0b8e2cc5f [2025-03-04 11:33:58,781 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:33:58,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2025-03-04 11:33:58,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f52f6abed/d612f9e024ff4f3aa7cbe9c4022ad5c3/FLAG0b8e2cc5f [2025-03-04 11:33:58,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f52f6abed/d612f9e024ff4f3aa7cbe9c4022ad5c3 [2025-03-04 11:33:58,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:33:58,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:33:58,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:33:58,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:33:58,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:33:58,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:33:58" (1/1) ... [2025-03-04 11:33:58,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7415562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:58, skipping insertion in model container [2025-03-04 11:33:58,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:33:58" (1/1) ... [2025-03-04 11:33:58,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:33:58,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:33:58,987 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:33:59,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:33:59,034 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:33:59,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:59 WrapperNode [2025-03-04 11:33:59,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:33:59,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:33:59,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:33:59,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:33:59,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:59" (1/1) ... [2025-03-04 11:33:59,045 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:59" (1/1) ... [2025-03-04 11:33:59,064 INFO L138 Inliner]: procedures = 32, calls = 37, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 259 [2025-03-04 11:33:59,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:33:59,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:33:59,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:33:59,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:33:59,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:59" (1/1) ... [2025-03-04 11:33:59,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:59" (1/1) ... [2025-03-04 11:33:59,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:59" (1/1) ... [2025-03-04 11:33:59,087 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:33:59,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:59" (1/1) ... [2025-03-04 11:33:59,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:59" (1/1) ... [2025-03-04 11:33:59,090 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:59" (1/1) ... [2025-03-04 11:33:59,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:59" (1/1) ... [2025-03-04 11:33:59,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:59" (1/1) ... [2025-03-04 11:33:59,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:59" (1/1) ... [2025-03-04 11:33:59,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:33:59,094 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:33:59,094 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:33:59,094 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:33:59,094 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:59" (1/1) ... [2025-03-04 11:33:59,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:33:59,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:59,119 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-04 11:33:59,121 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-04 11:33:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:33:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-04 11:33:59,137 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-04 11:33:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-04 11:33:59,137 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-04 11:33:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-04 11:33:59,137 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-04 11:33:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-04 11:33:59,137 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-04 11:33:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-04 11:33:59,137 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-04 11:33:59,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:33:59,138 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-04 11:33:59,138 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-04 11:33:59,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:33:59,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:33:59,191 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:33:59,193 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:33:59,472 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-03-04 11:33:59,474 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:33:59,484 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:33:59,485 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:33:59,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:33:59 BoogieIcfgContainer [2025-03-04 11:33:59,485 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:33:59,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:33:59,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:33:59,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:33:59,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:33:58" (1/3) ... [2025-03-04 11:33:59,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a07c73d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:33:59, skipping insertion in model container [2025-03-04 11:33:59,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:59" (2/3) ... [2025-03-04 11:33:59,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a07c73d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:33:59, skipping insertion in model container [2025-03-04 11:33:59,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:33:59" (3/3) ... [2025-03-04 11:33:59,494 INFO L128 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2025-03-04 11:33:59,504 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:33:59,505 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG kundu1.cil.c that has 7 procedures, 127 locations, 1 initial locations, 4 loop locations, and 8 error locations. [2025-03-04 11:33:59,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:33:59,557 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;@33a902a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:33:59,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 11:33:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 108 states have internal predecessors, (142), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 11:33:59,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 11:33:59,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:59,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:59,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:33:59,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:59,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1830220166, now seen corresponding path program 1 times [2025-03-04 11:33:59,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:59,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069827144] [2025-03-04 11:33:59,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:59,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:59,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 11:33:59,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:33:59,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:59,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:59,783 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-04 11:33:59,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:59,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069827144] [2025-03-04 11:33:59,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069827144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:59,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:59,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:33:59,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124764244] [2025-03-04 11:33:59,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:59,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:33:59,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:59,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:33:59,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:33:59,807 INFO L87 Difference]: Start difference. First operand has 127 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 108 states have internal predecessors, (142), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:33:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:59,927 INFO L93 Difference]: Finished difference Result 348 states and 477 transitions. [2025-03-04 11:33:59,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:33:59,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2025-03-04 11:33:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:59,936 INFO L225 Difference]: With dead ends: 348 [2025-03-04 11:33:59,936 INFO L226 Difference]: Without dead ends: 215 [2025-03-04 11:33:59,939 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-04 11:33:59,943 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 275 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:59,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 536 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-04 11:33:59,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 201. [2025-03-04 11:33:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 163 states have (on average 1.4049079754601228) internal successors, (229), 171 states have internal predecessors, (229), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 11:33:59,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 269 transitions. [2025-03-04 11:33:59,999 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 269 transitions. Word has length 48 [2025-03-04 11:33:59,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:59,999 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 269 transitions. [2025-03-04 11:34:00,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 269 transitions. [2025-03-04 11:34:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 11:34:00,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:00,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:00,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:34:00,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:00,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:00,002 INFO L85 PathProgramCache]: Analyzing trace with hash 6310589, now seen corresponding path program 1 times [2025-03-04 11:34:00,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:00,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803778965] [2025-03-04 11:34:00,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:00,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:00,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 11:34:00,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:34:00,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:00,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:00,107 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-04 11:34:00,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:00,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803778965] [2025-03-04 11:34:00,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803778965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:00,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:00,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:34:00,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680841191] [2025-03-04 11:34:00,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:00,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:00,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:00,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:00,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:00,109 INFO L87 Difference]: Start difference. First operand 201 states and 269 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:00,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:00,153 INFO L93 Difference]: Finished difference Result 395 states and 532 transitions. [2025-03-04 11:34:00,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:34:00,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2025-03-04 11:34:00,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:00,155 INFO L225 Difference]: With dead ends: 395 [2025-03-04 11:34:00,155 INFO L226 Difference]: Without dead ends: 204 [2025-03-04 11:34:00,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:00,165 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:00,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 590 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:00,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-04 11:34:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-04 11:34:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 166 states have (on average 1.391566265060241) internal successors, (231), 174 states have internal predecessors, (231), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 11:34:00,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 271 transitions. [2025-03-04 11:34:00,178 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 271 transitions. Word has length 48 [2025-03-04 11:34:00,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:00,179 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 271 transitions. [2025-03-04 11:34:00,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:00,179 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 271 transitions. [2025-03-04 11:34:00,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 11:34:00,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:00,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:00,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:34:00,180 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:00,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:00,180 INFO L85 PathProgramCache]: Analyzing trace with hash 699412286, now seen corresponding path program 1 times [2025-03-04 11:34:00,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:00,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100225989] [2025-03-04 11:34:00,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:00,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:00,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 11:34:00,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:34:00,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:00,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:00,247 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-04 11:34:00,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:00,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100225989] [2025-03-04 11:34:00,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100225989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:00,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:00,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:34:00,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859109372] [2025-03-04 11:34:00,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:00,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:00,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:00,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:00,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:00,249 INFO L87 Difference]: Start difference. First operand 204 states and 271 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:00,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:00,492 INFO L93 Difference]: Finished difference Result 843 states and 1104 transitions. [2025-03-04 11:34:00,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:34:00,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2025-03-04 11:34:00,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:00,497 INFO L225 Difference]: With dead ends: 843 [2025-03-04 11:34:00,498 INFO L226 Difference]: Without dead ends: 621 [2025-03-04 11:34:00,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:34:00,500 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 626 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:00,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 628 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:34:00,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-03-04 11:34:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 446. [2025-03-04 11:34:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 373 states have (on average 1.3780160857908847) internal successors, (514), 380 states have internal predecessors, (514), 41 states have call successors, (41), 23 states have call predecessors, (41), 24 states have return successors, (43), 43 states have call predecessors, (43), 41 states have call successors, (43) [2025-03-04 11:34:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 598 transitions. [2025-03-04 11:34:00,537 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 598 transitions. Word has length 48 [2025-03-04 11:34:00,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:00,538 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 598 transitions. [2025-03-04 11:34:00,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:00,538 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 598 transitions. [2025-03-04 11:34:00,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 11:34:00,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:00,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:00,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:34:00,540 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-04 11:34:00,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:00,540 INFO L85 PathProgramCache]: Analyzing trace with hash 137574691, now seen corresponding path program 1 times [2025-03-04 11:34:00,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:00,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682997974] [2025-03-04 11:34:00,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:00,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:00,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 11:34:00,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 11:34:00,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:00,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:00,595 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-04 11:34:00,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:00,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682997974] [2025-03-04 11:34:00,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682997974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:00,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:00,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:34:00,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655721611] [2025-03-04 11:34:00,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:00,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:34:00,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:00,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:34:00,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:34:00,596 INFO L87 Difference]: Start difference. First operand 446 states and 598 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:00,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:00,718 INFO L93 Difference]: Finished difference Result 1157 states and 1544 transitions. [2025-03-04 11:34:00,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:34:00,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2025-03-04 11:34:00,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:00,722 INFO L225 Difference]: With dead ends: 1157 [2025-03-04 11:34:00,724 INFO L226 Difference]: Without dead ends: 721 [2025-03-04 11:34:00,725 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-04 11:34:00,725 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 247 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:00,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 659 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:34:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-03-04 11:34:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 573. [2025-03-04 11:34:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 470 states have (on average 1.3085106382978724) internal successors, (615), 478 states have internal predecessors, (615), 60 states have call successors, (60), 35 states have call predecessors, (60), 35 states have return successors, (64), 60 states have call predecessors, (64), 60 states have call successors, (64) [2025-03-04 11:34:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 739 transitions. [2025-03-04 11:34:00,783 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 739 transitions. Word has length 51 [2025-03-04 11:34:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:00,783 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 739 transitions. [2025-03-04 11:34:00,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 739 transitions. [2025-03-04 11:34:00,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 11:34:00,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:00,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:00,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:34:00,786 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-04 11:34:00,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:00,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1340149478, now seen corresponding path program 1 times [2025-03-04 11:34:00,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:00,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207383046] [2025-03-04 11:34:00,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:00,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:00,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 11:34:00,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 11:34:00,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:00,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:00,868 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-04 11:34:00,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:00,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207383046] [2025-03-04 11:34:00,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207383046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:00,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:00,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:34:00,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215524836] [2025-03-04 11:34:00,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:00,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:00,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:00,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:00,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:00,870 INFO L87 Difference]: Start difference. First operand 573 states and 739 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:00,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:00,913 INFO L93 Difference]: Finished difference Result 1148 states and 1498 transitions. [2025-03-04 11:34:00,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:34:00,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2025-03-04 11:34:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:00,917 INFO L225 Difference]: With dead ends: 1148 [2025-03-04 11:34:00,917 INFO L226 Difference]: Without dead ends: 585 [2025-03-04 11:34:00,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:00,920 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:00,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 589 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:00,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-03-04 11:34:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2025-03-04 11:34:00,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 482 states have (on average 1.2946058091286308) internal successors, (624), 490 states have internal predecessors, (624), 60 states have call successors, (60), 35 states have call predecessors, (60), 35 states have return successors, (64), 60 states have call predecessors, (64), 60 states have call successors, (64) [2025-03-04 11:34:00,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 748 transitions. [2025-03-04 11:34:00,953 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 748 transitions. Word has length 51 [2025-03-04 11:34:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:00,954 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 748 transitions. [2025-03-04 11:34:00,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 748 transitions. [2025-03-04 11:34:00,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 11:34:00,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:00,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:00,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:34:00,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:00,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:00,958 INFO L85 PathProgramCache]: Analyzing trace with hash -737059865, now seen corresponding path program 1 times [2025-03-04 11:34:00,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:00,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782179613] [2025-03-04 11:34:00,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:00,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:00,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 11:34:00,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 11:34:00,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:00,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:01,009 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-04 11:34:01,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:01,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782179613] [2025-03-04 11:34:01,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782179613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:01,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:01,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:34:01,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644860292] [2025-03-04 11:34:01,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:01,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:34:01,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:01,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:34:01,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:34:01,011 INFO L87 Difference]: Start difference. First operand 585 states and 748 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:01,171 INFO L93 Difference]: Finished difference Result 1701 states and 2207 transitions. [2025-03-04 11:34:01,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:34:01,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2025-03-04 11:34:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:01,177 INFO L225 Difference]: With dead ends: 1701 [2025-03-04 11:34:01,177 INFO L226 Difference]: Without dead ends: 1127 [2025-03-04 11:34:01,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:01,180 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 160 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:01,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 351 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:34:01,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2025-03-04 11:34:01,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1121. [2025-03-04 11:34:01,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 921 states have (on average 1.266015200868621) internal successors, (1166), 933 states have internal predecessors, (1166), 119 states have call successors, (119), 70 states have call predecessors, (119), 73 states have return successors, (156), 119 states have call predecessors, (156), 119 states have call successors, (156) [2025-03-04 11:34:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1441 transitions. [2025-03-04 11:34:01,244 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1441 transitions. Word has length 51 [2025-03-04 11:34:01,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:01,244 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1441 transitions. [2025-03-04 11:34:01,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:34:01,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1441 transitions. [2025-03-04 11:34:01,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 11:34:01,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:01,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:01,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:34:01,247 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:01,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:01,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1813123661, now seen corresponding path program 1 times [2025-03-04 11:34:01,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:01,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085829464] [2025-03-04 11:34:01,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:01,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:01,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:34:01,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:34:01,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:01,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:01,298 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-04 11:34:01,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:01,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085829464] [2025-03-04 11:34:01,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085829464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:01,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:01,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:34:01,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982198929] [2025-03-04 11:34:01,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:01,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:01,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:01,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:01,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:34:01,299 INFO L87 Difference]: Start difference. First operand 1121 states and 1441 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:34:01,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:01,395 INFO L93 Difference]: Finished difference Result 2747 states and 3537 transitions. [2025-03-04 11:34:01,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:01,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2025-03-04 11:34:01,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:01,405 INFO L225 Difference]: With dead ends: 2747 [2025-03-04 11:34:01,405 INFO L226 Difference]: Without dead ends: 1773 [2025-03-04 11:34:01,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:34:01,408 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 109 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:01,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 273 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:01,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2025-03-04 11:34:01,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1773. [2025-03-04 11:34:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1466 states have (on average 1.2537517053206002) internal successors, (1838), 1481 states have internal predecessors, (1838), 183 states have call successors, (183), 110 states have call predecessors, (183), 116 states have return successors, (244), 183 states have call predecessors, (244), 183 states have call successors, (244) [2025-03-04 11:34:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2265 transitions. [2025-03-04 11:34:01,501 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2265 transitions. Word has length 52 [2025-03-04 11:34:01,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:01,502 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2265 transitions. [2025-03-04 11:34:01,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:34:01,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2265 transitions. [2025-03-04 11:34:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 11:34:01,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:01,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:01,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:34:01,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:01,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:01,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1275042773, now seen corresponding path program 1 times [2025-03-04 11:34:01,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:01,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660421048] [2025-03-04 11:34:01,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:01,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:01,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:34:01,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:34:01,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:01,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:01,547 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-04 11:34:01,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:01,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660421048] [2025-03-04 11:34:01,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660421048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:01,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:01,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:34:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257789934] [2025-03-04 11:34:01,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:01,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:01,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:01,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:01,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:34:01,550 INFO L87 Difference]: Start difference. First operand 1773 states and 2265 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:34:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:01,630 INFO L93 Difference]: Finished difference Result 1974 states and 2517 transitions. [2025-03-04 11:34:01,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:01,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2025-03-04 11:34:01,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:01,640 INFO L225 Difference]: With dead ends: 1974 [2025-03-04 11:34:01,640 INFO L226 Difference]: Without dead ends: 1970 [2025-03-04 11:34:01,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:34:01,642 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 108 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:01,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 295 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:01,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2025-03-04 11:34:01,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1966. [2025-03-04 11:34:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1632 states have (on average 1.2506127450980393) internal successors, (2041), 1648 states have internal predecessors, (2041), 199 states have call successors, (199), 120 states have call predecessors, (199), 127 states have return successors, (265), 199 states have call predecessors, (265), 199 states have call successors, (265) [2025-03-04 11:34:01,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2505 transitions. [2025-03-04 11:34:01,751 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 2505 transitions. Word has length 52 [2025-03-04 11:34:01,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:01,751 INFO L471 AbstractCegarLoop]: Abstraction has 1966 states and 2505 transitions. [2025-03-04 11:34:01,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:34:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2505 transitions. [2025-03-04 11:34:01,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 11:34:01,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:01,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:01,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:34:01,754 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:01,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:01,755 INFO L85 PathProgramCache]: Analyzing trace with hash -993645998, now seen corresponding path program 1 times [2025-03-04 11:34:01,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:01,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592613442] [2025-03-04 11:34:01,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:01,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 11:34:01,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 11:34:01,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:01,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:01,828 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-04 11:34:01,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:01,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592613442] [2025-03-04 11:34:01,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592613442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:01,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:01,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:34:01,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949275403] [2025-03-04 11:34:01,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:01,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:34:01,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:01,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:34:01,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:34:01,830 INFO L87 Difference]: Start difference. First operand 1966 states and 2505 transitions. Second operand has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:34:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:02,005 INFO L93 Difference]: Finished difference Result 3177 states and 4056 transitions. [2025-03-04 11:34:02,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:34:02,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 61 [2025-03-04 11:34:02,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:02,017 INFO L225 Difference]: With dead ends: 3177 [2025-03-04 11:34:02,017 INFO L226 Difference]: Without dead ends: 2139 [2025-03-04 11:34:02,020 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-04 11:34:02,022 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 213 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:02,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 475 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:34:02,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2025-03-04 11:34:02,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2137. [2025-03-04 11:34:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 1776 states have (on average 1.2449324324324325) internal successors, (2211), 1793 states have internal predecessors, (2211), 215 states have call successors, (215), 130 states have call predecessors, (215), 138 states have return successors, (286), 215 states have call predecessors, (286), 215 states have call successors, (286) [2025-03-04 11:34:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 2712 transitions. [2025-03-04 11:34:02,140 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 2712 transitions. Word has length 61 [2025-03-04 11:34:02,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:02,140 INFO L471 AbstractCegarLoop]: Abstraction has 2137 states and 2712 transitions. [2025-03-04 11:34:02,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:34:02,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2712 transitions. [2025-03-04 11:34:02,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 11:34:02,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:02,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:02,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 11:34:02,141 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:02,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:02,142 INFO L85 PathProgramCache]: Analyzing trace with hash -738254789, now seen corresponding path program 1 times [2025-03-04 11:34:02,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:02,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98303717] [2025-03-04 11:34:02,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:02,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:02,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 11:34:02,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 11:34:02,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:02,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:02,191 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-04 11:34:02,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:02,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98303717] [2025-03-04 11:34:02,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98303717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:02,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:02,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:34:02,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156867017] [2025-03-04 11:34:02,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:02,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:34:02,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:02,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:34:02,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:34:02,192 INFO L87 Difference]: Start difference. First operand 2137 states and 2712 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:34:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:02,323 INFO L93 Difference]: Finished difference Result 3012 states and 3821 transitions. [2025-03-04 11:34:02,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:34:02,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-03-04 11:34:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:02,334 INFO L225 Difference]: With dead ends: 3012 [2025-03-04 11:34:02,334 INFO L226 Difference]: Without dead ends: 3010 [2025-03-04 11:34:02,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:34:02,336 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 302 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:02,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 365 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:34:02,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2025-03-04 11:34:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3002. [2025-03-04 11:34:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 2506 states have (on average 1.2418196328810853) internal successors, (3112), 2528 states have internal predecessors, (3112), 295 states have call successors, (295), 180 states have call predecessors, (295), 193 states have return successors, (397), 295 states have call predecessors, (397), 295 states have call successors, (397) [2025-03-04 11:34:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 3804 transitions. [2025-03-04 11:34:02,433 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 3804 transitions. Word has length 62 [2025-03-04 11:34:02,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:02,433 INFO L471 AbstractCegarLoop]: Abstraction has 3002 states and 3804 transitions. [2025-03-04 11:34:02,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:34:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 3804 transitions. [2025-03-04 11:34:02,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 11:34:02,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:02,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:02,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 11:34:02,434 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:02,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:02,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1312416851, now seen corresponding path program 1 times [2025-03-04 11:34:02,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:02,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143830357] [2025-03-04 11:34:02,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:02,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:02,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 11:34:02,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 11:34:02,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:02,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:34:02,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:02,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143830357] [2025-03-04 11:34:02,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143830357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:02,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:02,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:34:02,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050694231] [2025-03-04 11:34:02,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:02,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:02,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:02,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:02,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:02,476 INFO L87 Difference]: Start difference. First operand 3002 states and 3804 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:34:02,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:02,735 INFO L93 Difference]: Finished difference Result 6898 states and 8863 transitions. [2025-03-04 11:34:02,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:34:02,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 72 [2025-03-04 11:34:02,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:02,755 INFO L225 Difference]: With dead ends: 6898 [2025-03-04 11:34:02,755 INFO L226 Difference]: Without dead ends: 3912 [2025-03-04 11:34:02,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:34:02,762 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 686 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:02,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 659 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:34:02,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3912 states. [2025-03-04 11:34:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3912 to 3778. [2025-03-04 11:34:02,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3778 states, 3116 states have (on average 1.2166238767650834) internal successors, (3791), 3144 states have internal predecessors, (3791), 397 states have call successors, (397), 240 states have call predecessors, (397), 257 states have return successors, (571), 397 states have call predecessors, (571), 397 states have call successors, (571) [2025-03-04 11:34:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3778 states to 3778 states and 4759 transitions. [2025-03-04 11:34:02,913 INFO L78 Accepts]: Start accepts. Automaton has 3778 states and 4759 transitions. Word has length 72 [2025-03-04 11:34:02,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:02,913 INFO L471 AbstractCegarLoop]: Abstraction has 3778 states and 4759 transitions. [2025-03-04 11:34:02,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:34:02,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3778 states and 4759 transitions. [2025-03-04 11:34:02,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 11:34:02,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:02,917 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:02,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:34:02,918 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:02,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:02,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1120357393, now seen corresponding path program 1 times [2025-03-04 11:34:02,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:02,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684145120] [2025-03-04 11:34:02,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:02,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 11:34:02,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 11:34:02,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:02,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:34:02,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:02,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684145120] [2025-03-04 11:34:02,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684145120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:02,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:02,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:34:02,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022715427] [2025-03-04 11:34:02,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:02,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:34:02,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:02,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:34:02,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:02,967 INFO L87 Difference]: Start difference. First operand 3778 states and 4759 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:34:03,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:03,335 INFO L93 Difference]: Finished difference Result 7678 states and 9646 transitions. [2025-03-04 11:34:03,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:34:03,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 85 [2025-03-04 11:34:03,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:03,349 INFO L225 Difference]: With dead ends: 7678 [2025-03-04 11:34:03,349 INFO L226 Difference]: Without dead ends: 3798 [2025-03-04 11:34:03,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:03,354 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 884 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:03,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 978 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:34:03,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2025-03-04 11:34:03,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3652. [2025-03-04 11:34:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3652 states, 3019 states have (on average 1.2020536601523684) internal successors, (3629), 3046 states have internal predecessors, (3629), 378 states have call successors, (378), 230 states have call predecessors, (378), 247 states have return successors, (477), 378 states have call predecessors, (477), 378 states have call successors, (477) [2025-03-04 11:34:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3652 states and 4484 transitions. [2025-03-04 11:34:03,551 INFO L78 Accepts]: Start accepts. Automaton has 3652 states and 4484 transitions. Word has length 85 [2025-03-04 11:34:03,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:03,552 INFO L471 AbstractCegarLoop]: Abstraction has 3652 states and 4484 transitions. [2025-03-04 11:34:03,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:34:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3652 states and 4484 transitions. [2025-03-04 11:34:03,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 11:34:03,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:03,556 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:03,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 11:34:03,557 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:03,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:03,557 INFO L85 PathProgramCache]: Analyzing trace with hash -313339586, now seen corresponding path program 1 times [2025-03-04 11:34:03,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:03,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556932400] [2025-03-04 11:34:03,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:03,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:03,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 11:34:03,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 11:34:03,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:03,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:34:03,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556932400] [2025-03-04 11:34:03,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556932400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896769385] [2025-03-04 11:34:03,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:03,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:03,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:03,653 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-04 11:34:03,655 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-04 11:34:03,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 11:34:03,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 11:34:03,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:03,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:03,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:34:03,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 11:34:03,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:03,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896769385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:03,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:03,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2025-03-04 11:34:03,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699283287] [2025-03-04 11:34:03,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:03,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:03,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:03,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:03,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:34:03,862 INFO L87 Difference]: Start difference. First operand 3652 states and 4484 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 11:34:03,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:03,938 INFO L93 Difference]: Finished difference Result 4923 states and 6088 transitions. [2025-03-04 11:34:03,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:03,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 129 [2025-03-04 11:34:03,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:03,945 INFO L225 Difference]: With dead ends: 4923 [2025-03-04 11:34:03,945 INFO L226 Difference]: Without dead ends: 2006 [2025-03-04 11:34:03,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:34:03,949 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:03,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 148 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:03,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2025-03-04 11:34:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 2006. [2025-03-04 11:34:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2006 states, 1655 states have (on average 1.1897280966767372) internal successors, (1969), 1675 states have internal predecessors, (1969), 207 states have call successors, (207), 125 states have call predecessors, (207), 136 states have return successors, (253), 207 states have call predecessors, (253), 207 states have call successors, (253) [2025-03-04 11:34:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 2429 transitions. [2025-03-04 11:34:04,008 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 2429 transitions. Word has length 129 [2025-03-04 11:34:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:04,009 INFO L471 AbstractCegarLoop]: Abstraction has 2006 states and 2429 transitions. [2025-03-04 11:34:04,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 11:34:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2429 transitions. [2025-03-04 11:34:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 11:34:04,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:04,011 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:04,018 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-04 11:34:04,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 11:34:04,212 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:04,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:04,213 INFO L85 PathProgramCache]: Analyzing trace with hash 425139652, now seen corresponding path program 1 times [2025-03-04 11:34:04,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:04,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019744166] [2025-03-04 11:34:04,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:04,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:04,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 11:34:04,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 11:34:04,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:04,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 11:34:04,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:04,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019744166] [2025-03-04 11:34:04,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019744166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:04,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765622029] [2025-03-04 11:34:04,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:04,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:04,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:04,311 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-04 11:34:04,315 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-04 11:34:04,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 11:34:04,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 11:34:04,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:04,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:04,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:34:04,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:04,494 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 11:34:04,495 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:04,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765622029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:04,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:04,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2025-03-04 11:34:04,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622211844] [2025-03-04 11:34:04,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:04,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:04,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:04,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:04,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:34:04,496 INFO L87 Difference]: Start difference. First operand 2006 states and 2429 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 11:34:04,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:04,562 INFO L93 Difference]: Finished difference Result 4354 states and 5258 transitions. [2025-03-04 11:34:04,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:04,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 144 [2025-03-04 11:34:04,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:04,575 INFO L225 Difference]: With dead ends: 4354 [2025-03-04 11:34:04,575 INFO L226 Difference]: Without dead ends: 2566 [2025-03-04 11:34:04,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:34:04,580 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 61 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:04,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 290 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2025-03-04 11:34:04,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2561. [2025-03-04 11:34:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 2102 states have (on average 1.1774500475737393) internal successors, (2475), 2122 states have internal predecessors, (2475), 270 states have call successors, (270), 170 states have call predecessors, (270), 181 states have return successors, (323), 270 states have call predecessors, (323), 270 states have call successors, (323) [2025-03-04 11:34:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 3068 transitions. [2025-03-04 11:34:04,695 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 3068 transitions. Word has length 144 [2025-03-04 11:34:04,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:04,695 INFO L471 AbstractCegarLoop]: Abstraction has 2561 states and 3068 transitions. [2025-03-04 11:34:04,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 11:34:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 3068 transitions. [2025-03-04 11:34:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 11:34:04,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:04,699 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:04,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:34:04,899 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,SelfDestructingSolverStorable13 [2025-03-04 11:34:04,900 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:04,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:04,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1759148142, now seen corresponding path program 1 times [2025-03-04 11:34:04,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:04,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800938614] [2025-03-04 11:34:04,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:04,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:04,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 11:34:04,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 11:34:04,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:04,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:04,956 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 11:34:04,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:04,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800938614] [2025-03-04 11:34:04,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800938614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:04,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:04,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:34:04,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397133204] [2025-03-04 11:34:04,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:04,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:34:04,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:04,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:34:04,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:34:04,958 INFO L87 Difference]: Start difference. First operand 2561 states and 3068 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 11:34:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:05,074 INFO L93 Difference]: Finished difference Result 3763 states and 4536 transitions. [2025-03-04 11:34:05,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:34:05,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 152 [2025-03-04 11:34:05,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:05,086 INFO L225 Difference]: With dead ends: 3763 [2025-03-04 11:34:05,086 INFO L226 Difference]: Without dead ends: 2428 [2025-03-04 11:34:05,092 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-04 11:34:05,093 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 193 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:05,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 449 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:34:05,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2025-03-04 11:34:05,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2428. [2025-03-04 11:34:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2428 states, 1993 states have (on average 1.1761164074259909) internal successors, (2344), 2013 states have internal predecessors, (2344), 256 states have call successors, (256), 160 states have call predecessors, (256), 171 states have return successors, (305), 256 states have call predecessors, (305), 256 states have call successors, (305) [2025-03-04 11:34:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 2905 transitions. [2025-03-04 11:34:05,212 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 2905 transitions. Word has length 152 [2025-03-04 11:34:05,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:05,213 INFO L471 AbstractCegarLoop]: Abstraction has 2428 states and 2905 transitions. [2025-03-04 11:34:05,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 11:34:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 2905 transitions. [2025-03-04 11:34:05,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 11:34:05,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:05,216 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:05,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 11:34:05,216 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:05,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:05,216 INFO L85 PathProgramCache]: Analyzing trace with hash 211801512, now seen corresponding path program 1 times [2025-03-04 11:34:05,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:05,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223872671] [2025-03-04 11:34:05,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:05,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:05,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 11:34:05,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 11:34:05,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:05,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 11:34:05,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:05,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223872671] [2025-03-04 11:34:05,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223872671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:05,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157556923] [2025-03-04 11:34:05,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:05,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:05,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:05,314 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-04 11:34:05,316 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-04 11:34:05,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 11:34:05,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 11:34:05,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:05,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:05,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:34:05,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-04 11:34:05,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:05,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157556923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:05,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:05,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-03-04 11:34:05,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7025473] [2025-03-04 11:34:05,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:05,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:34:05,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:05,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:34:05,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:34:05,461 INFO L87 Difference]: Start difference. First operand 2428 states and 2905 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 11:34:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:05,519 INFO L93 Difference]: Finished difference Result 4071 states and 4868 transitions. [2025-03-04 11:34:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:34:05,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 167 [2025-03-04 11:34:05,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:05,530 INFO L225 Difference]: With dead ends: 4071 [2025-03-04 11:34:05,530 INFO L226 Difference]: Without dead ends: 1658 [2025-03-04 11:34:05,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:34:05,535 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:05,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 721 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:05,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2025-03-04 11:34:05,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1658. [2025-03-04 11:34:05,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1404 states have (on average 1.1766381766381766) internal successors, (1652), 1409 states have internal predecessors, (1652), 143 states have call successors, (143), 94 states have call predecessors, (143), 103 states have return successors, (176), 154 states have call predecessors, (176), 143 states have call successors, (176) [2025-03-04 11:34:05,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 1971 transitions. [2025-03-04 11:34:05,585 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 1971 transitions. Word has length 167 [2025-03-04 11:34:05,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:05,586 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 1971 transitions. [2025-03-04 11:34:05,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 11:34:05,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 1971 transitions. [2025-03-04 11:34:05,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 11:34:05,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:05,588 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:05,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 11:34:05,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:05,789 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:05,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:05,789 INFO L85 PathProgramCache]: Analyzing trace with hash 938440320, now seen corresponding path program 1 times [2025-03-04 11:34:05,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:05,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469874110] [2025-03-04 11:34:05,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:05,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:05,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 11:34:05,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 11:34:05,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:05,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 11:34:05,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:05,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469874110] [2025-03-04 11:34:05,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469874110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:05,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:05,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:34:05,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125022130] [2025-03-04 11:34:05,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:05,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:05,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:05,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:05,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:34:05,854 INFO L87 Difference]: Start difference. First operand 1658 states and 1971 transitions. Second operand has 3 states, 2 states have (on average 50.5) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 11:34:05,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:05,900 INFO L93 Difference]: Finished difference Result 1658 states and 1971 transitions. [2025-03-04 11:34:05,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:05,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 50.5) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 172 [2025-03-04 11:34:05,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:05,930 INFO L225 Difference]: With dead ends: 1658 [2025-03-04 11:34:05,930 INFO L226 Difference]: Without dead ends: 1656 [2025-03-04 11:34:05,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:34:05,931 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:05,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 136 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2025-03-04 11:34:06,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2025-03-04 11:34:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1404 states have (on average 1.170940170940171) internal successors, (1644), 1407 states have internal predecessors, (1644), 143 states have call successors, (143), 94 states have call predecessors, (143), 103 states have return successors, (176), 154 states have call predecessors, (176), 143 states have call successors, (176) [2025-03-04 11:34:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 1963 transitions. [2025-03-04 11:34:06,008 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 1963 transitions. Word has length 172 [2025-03-04 11:34:06,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:06,009 INFO L471 AbstractCegarLoop]: Abstraction has 1656 states and 1963 transitions. [2025-03-04 11:34:06,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 50.5) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 11:34:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 1963 transitions. [2025-03-04 11:34:06,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 11:34:06,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:06,012 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:06,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 11:34:06,012 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:06,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:06,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1199388573, now seen corresponding path program 1 times [2025-03-04 11:34:06,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:06,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783691568] [2025-03-04 11:34:06,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:06,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:06,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 11:34:06,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 11:34:06,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:06,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:06,112 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 11:34:06,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:06,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783691568] [2025-03-04 11:34:06,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783691568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:06,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745462926] [2025-03-04 11:34:06,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:06,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:06,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:06,118 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-04 11:34:06,119 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-04 11:34:06,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 11:34:06,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 11:34:06,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:06,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:06,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:34:06,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 11:34:06,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:06,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745462926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:06,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:06,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 11:34:06,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500231260] [2025-03-04 11:34:06,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:06,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:34:06,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:06,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:34:06,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:06,404 INFO L87 Difference]: Start difference. First operand 1656 states and 1963 transitions. Second operand has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 11:34:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:06,498 INFO L93 Difference]: Finished difference Result 1657 states and 1963 transitions. [2025-03-04 11:34:06,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:34:06,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 173 [2025-03-04 11:34:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:06,504 INFO L225 Difference]: With dead ends: 1657 [2025-03-04 11:34:06,504 INFO L226 Difference]: Without dead ends: 1655 [2025-03-04 11:34:06,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:06,505 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 107 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:06,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 335 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:06,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2025-03-04 11:34:06,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1654. [2025-03-04 11:34:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1404 states have (on average 1.1666666666666667) internal successors, (1638), 1405 states have internal predecessors, (1638), 143 states have call successors, (143), 94 states have call predecessors, (143), 103 states have return successors, (176), 154 states have call predecessors, (176), 143 states have call successors, (176) [2025-03-04 11:34:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 1957 transitions. [2025-03-04 11:34:06,552 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 1957 transitions. Word has length 173 [2025-03-04 11:34:06,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:06,553 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 1957 transitions. [2025-03-04 11:34:06,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 11:34:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1957 transitions. [2025-03-04 11:34:06,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 11:34:06,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:06,555 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:06,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:34:06,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:34:06,756 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:06,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1473659983, now seen corresponding path program 1 times [2025-03-04 11:34:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:06,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417216684] [2025-03-04 11:34:06,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:06,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:06,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 11:34:06,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 11:34:06,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:06,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 11:34:06,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:06,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417216684] [2025-03-04 11:34:06,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417216684] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:06,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450257644] [2025-03-04 11:34:06,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:06,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:06,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:06,825 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:34:06,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:34:06,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 11:34:06,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 11:34:06,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:06,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:06,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:34:06,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:07,084 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 11:34:07,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:34:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 11:34:07,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450257644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:34:07,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:34:07,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 11:34:07,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226750057] [2025-03-04 11:34:07,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:34:07,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:34:07,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:07,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:34:07,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:34:07,231 INFO L87 Difference]: Start difference. First operand 1654 states and 1957 transitions. Second operand has 7 states, 6 states have (on average 43.5) internal successors, (261), 7 states have internal predecessors, (261), 5 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2025-03-04 11:34:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:07,457 INFO L93 Difference]: Finished difference Result 4701 states and 5660 transitions. [2025-03-04 11:34:07,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:34:07,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 43.5) internal successors, (261), 7 states have internal predecessors, (261), 5 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) Word has length 174 [2025-03-04 11:34:07,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:07,473 INFO L225 Difference]: With dead ends: 4701 [2025-03-04 11:34:07,474 INFO L226 Difference]: Without dead ends: 4699 [2025-03-04 11:34:07,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:34:07,476 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 300 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:07,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 641 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:34:07,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4699 states. [2025-03-04 11:34:07,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4699 to 3584. [2025-03-04 11:34:07,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3584 states, 3100 states have (on average 1.1838709677419355) internal successors, (3670), 3095 states have internal predecessors, (3670), 281 states have call successors, (281), 178 states have call predecessors, (281), 199 states have return successors, (380), 310 states have call predecessors, (380), 281 states have call successors, (380) [2025-03-04 11:34:07,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 4331 transitions. [2025-03-04 11:34:07,590 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 4331 transitions. Word has length 174 [2025-03-04 11:34:07,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:07,592 INFO L471 AbstractCegarLoop]: Abstraction has 3584 states and 4331 transitions. [2025-03-04 11:34:07,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 43.5) internal successors, (261), 7 states have internal predecessors, (261), 5 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2025-03-04 11:34:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 4331 transitions. [2025-03-04 11:34:07,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 11:34:07,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:07,595 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:07,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:34:07,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:07,796 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:07,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:07,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1316158126, now seen corresponding path program 1 times [2025-03-04 11:34:07,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:07,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770223192] [2025-03-04 11:34:07,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:07,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:07,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 11:34:07,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 11:34:07,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:07,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-03-04 11:34:07,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:07,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770223192] [2025-03-04 11:34:07,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770223192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:07,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:07,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:34:07,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937023773] [2025-03-04 11:34:07,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:07,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:07,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:07,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:07,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:07,920 INFO L87 Difference]: Start difference. First operand 3584 states and 4331 transitions. Second operand has 5 states, 4 states have (on average 26.25) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 11:34:08,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:08,098 INFO L93 Difference]: Finished difference Result 5171 states and 6271 transitions. [2025-03-04 11:34:08,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:34:08,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.25) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 184 [2025-03-04 11:34:08,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:08,109 INFO L225 Difference]: With dead ends: 5171 [2025-03-04 11:34:08,110 INFO L226 Difference]: Without dead ends: 4022 [2025-03-04 11:34:08,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:08,113 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 364 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:08,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 379 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:34:08,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2025-03-04 11:34:08,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 2687. [2025-03-04 11:34:08,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2687 states, 2348 states have (on average 1.1835604770017036) internal successors, (2779), 2342 states have internal predecessors, (2779), 197 states have call successors, (197), 123 states have call predecessors, (197), 139 states have return successors, (285), 221 states have call predecessors, (285), 197 states have call successors, (285) [2025-03-04 11:34:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 3261 transitions. [2025-03-04 11:34:08,188 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 3261 transitions. Word has length 184 [2025-03-04 11:34:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:08,188 INFO L471 AbstractCegarLoop]: Abstraction has 2687 states and 3261 transitions. [2025-03-04 11:34:08,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.25) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 11:34:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3261 transitions. [2025-03-04 11:34:08,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-04 11:34:08,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:08,190 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:08,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 11:34:08,190 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:08,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:08,191 INFO L85 PathProgramCache]: Analyzing trace with hash 791378202, now seen corresponding path program 1 times [2025-03-04 11:34:08,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:08,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590687992] [2025-03-04 11:34:08,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:08,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:08,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 11:34:08,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 11:34:08,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:08,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 11:34:08,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:08,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590687992] [2025-03-04 11:34:08,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590687992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:08,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:08,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:34:08,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425027411] [2025-03-04 11:34:08,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:08,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:08,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:08,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:08,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:08,266 INFO L87 Difference]: Start difference. First operand 2687 states and 3261 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 11:34:08,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:08,419 INFO L93 Difference]: Finished difference Result 7507 states and 9135 transitions. [2025-03-04 11:34:08,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:34:08,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 185 [2025-03-04 11:34:08,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:08,432 INFO L225 Difference]: With dead ends: 7507 [2025-03-04 11:34:08,432 INFO L226 Difference]: Without dead ends: 4862 [2025-03-04 11:34:08,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:08,437 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 84 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:08,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 480 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:34:08,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2025-03-04 11:34:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 3941. [2025-03-04 11:34:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3941 states, 3434 states have (on average 1.1808386721025044) internal successors, (4055), 3424 states have internal predecessors, (4055), 296 states have call successors, (296), 184 states have call predecessors, (296), 208 states have return successors, (428), 332 states have call predecessors, (428), 296 states have call successors, (428) [2025-03-04 11:34:08,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 4779 transitions. [2025-03-04 11:34:08,542 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 4779 transitions. Word has length 185 [2025-03-04 11:34:08,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:08,543 INFO L471 AbstractCegarLoop]: Abstraction has 3941 states and 4779 transitions. [2025-03-04 11:34:08,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 11:34:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 4779 transitions. [2025-03-04 11:34:08,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-04 11:34:08,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:08,545 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:08,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 11:34:08,545 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:08,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:08,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1657701180, now seen corresponding path program 1 times [2025-03-04 11:34:08,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:08,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710121122] [2025-03-04 11:34:08,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:08,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:08,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 11:34:08,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 11:34:08,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:08,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-03-04 11:34:08,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:08,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710121122] [2025-03-04 11:34:08,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710121122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:08,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:08,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:34:08,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960416634] [2025-03-04 11:34:08,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:08,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:08,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:08,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:08,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:08,646 INFO L87 Difference]: Start difference. First operand 3941 states and 4779 transitions. Second operand has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 11:34:08,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:08,814 INFO L93 Difference]: Finished difference Result 4872 states and 5913 transitions. [2025-03-04 11:34:08,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:34:08,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 186 [2025-03-04 11:34:08,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:08,825 INFO L225 Difference]: With dead ends: 4872 [2025-03-04 11:34:08,825 INFO L226 Difference]: Without dead ends: 4871 [2025-03-04 11:34:08,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:08,830 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 120 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:08,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 574 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:34:08,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2025-03-04 11:34:08,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 2680. [2025-03-04 11:34:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2680 states, 2330 states have (on average 1.1755364806866953) internal successors, (2739), 2323 states have internal predecessors, (2739), 204 states have call successors, (204), 128 states have call predecessors, (204), 144 states have return successors, (292), 228 states have call predecessors, (292), 204 states have call successors, (292) [2025-03-04 11:34:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 3235 transitions. [2025-03-04 11:34:08,913 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 3235 transitions. Word has length 186 [2025-03-04 11:34:08,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:08,913 INFO L471 AbstractCegarLoop]: Abstraction has 2680 states and 3235 transitions. [2025-03-04 11:34:08,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 11:34:08,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 3235 transitions. [2025-03-04 11:34:08,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-04 11:34:08,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:08,922 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 13, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:08,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 11:34:08,922 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:08,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:08,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1042877605, now seen corresponding path program 1 times [2025-03-04 11:34:08,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:08,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820344581] [2025-03-04 11:34:08,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:08,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:08,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-04 11:34:08,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-04 11:34:08,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:08,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 168 proven. 85 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [2025-03-04 11:34:09,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:09,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820344581] [2025-03-04 11:34:09,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820344581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:09,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687012302] [2025-03-04 11:34:09,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:09,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:09,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:09,080 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:34:09,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:34:09,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-04 11:34:09,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-04 11:34:09,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:09,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:09,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:34:09,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 873 proven. 0 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2025-03-04 11:34:09,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:09,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687012302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:09,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:09,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-04 11:34:09,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114326706] [2025-03-04 11:34:09,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:09,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:09,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:09,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:09,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:34:09,313 INFO L87 Difference]: Start difference. First operand 2680 states and 3235 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 11:34:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:09,438 INFO L93 Difference]: Finished difference Result 6658 states and 8073 transitions. [2025-03-04 11:34:09,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:09,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 446 [2025-03-04 11:34:09,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:09,450 INFO L225 Difference]: With dead ends: 6658 [2025-03-04 11:34:09,450 INFO L226 Difference]: Without dead ends: 4173 [2025-03-04 11:34:09,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:34:09,455 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 53 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 351 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-04 11:34:09,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 351 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:09,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2025-03-04 11:34:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 4168. [2025-03-04 11:34:09,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4168 states, 3618 states have (on average 1.1705362078496406) internal successors, (4235), 3611 states have internal predecessors, (4235), 324 states have call successors, (324), 200 states have call predecessors, (324), 224 states have return successors, (444), 356 states have call predecessors, (444), 324 states have call successors, (444) [2025-03-04 11:34:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5003 transitions. [2025-03-04 11:34:09,622 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5003 transitions. Word has length 446 [2025-03-04 11:34:09,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:09,623 INFO L471 AbstractCegarLoop]: Abstraction has 4168 states and 5003 transitions. [2025-03-04 11:34:09,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 11:34:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5003 transitions. [2025-03-04 11:34:09,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-04 11:34:09,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:09,633 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 13, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:09,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 11:34:09,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:09,839 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:09,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:09,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1162764762, now seen corresponding path program 1 times [2025-03-04 11:34:09,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:09,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767471045] [2025-03-04 11:34:09,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:09,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:09,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-04 11:34:09,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-04 11:34:09,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:09,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 168 proven. 85 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [2025-03-04 11:34:10,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:10,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767471045] [2025-03-04 11:34:10,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767471045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:10,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014032206] [2025-03-04 11:34:10,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:10,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:10,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:10,006 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:34:10,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:34:10,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-04 11:34:10,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-04 11:34:10,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:10,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:10,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:34:10,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-03-04 11:34:10,252 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:10,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014032206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:10,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:10,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-04 11:34:10,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442126592] [2025-03-04 11:34:10,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:10,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:10,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:10,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:10,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:34:10,253 INFO L87 Difference]: Start difference. First operand 4168 states and 5003 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 11:34:10,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:10,423 INFO L93 Difference]: Finished difference Result 11034 states and 13209 transitions. [2025-03-04 11:34:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:10,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 446 [2025-03-04 11:34:10,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:10,442 INFO L225 Difference]: With dead ends: 11034 [2025-03-04 11:34:10,442 INFO L226 Difference]: Without dead ends: 7061 [2025-03-04 11:34:10,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:34:10,450 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 45 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 351 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-04 11:34:10,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 351 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:10,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7061 states. [2025-03-04 11:34:10,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7061 to 7056. [2025-03-04 11:34:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7056 states, 6138 states have (on average 1.153958944281525) internal successors, (7083), 6131 states have internal predecessors, (7083), 548 states have call successors, (548), 336 states have call predecessors, (548), 368 states have return successors, (708), 588 states have call predecessors, (708), 548 states have call successors, (708) [2025-03-04 11:34:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7056 states to 7056 states and 8339 transitions. [2025-03-04 11:34:10,691 INFO L78 Accepts]: Start accepts. Automaton has 7056 states and 8339 transitions. Word has length 446 [2025-03-04 11:34:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:10,692 INFO L471 AbstractCegarLoop]: Abstraction has 7056 states and 8339 transitions. [2025-03-04 11:34:10,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 11:34:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 7056 states and 8339 transitions. [2025-03-04 11:34:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-04 11:34:10,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:10,707 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 13, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:10,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 11:34:10,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:10,908 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:10,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:10,909 INFO L85 PathProgramCache]: Analyzing trace with hash -402630523, now seen corresponding path program 1 times [2025-03-04 11:34:10,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:10,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268396352] [2025-03-04 11:34:10,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:10,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:10,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-04 11:34:10,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-04 11:34:10,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:10,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 168 proven. 85 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [2025-03-04 11:34:11,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:11,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268396352] [2025-03-04 11:34:11,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268396352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:11,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268220391] [2025-03-04 11:34:11,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:11,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:11,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:11,060 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:34:11,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:34:11,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-04 11:34:11,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-04 11:34:11,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:11,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:11,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:34:11,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2025-03-04 11:34:11,264 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:11,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268220391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:11,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:11,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-04 11:34:11,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555786577] [2025-03-04 11:34:11,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:11,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:11,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:11,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:11,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:34:11,266 INFO L87 Difference]: Start difference. First operand 7056 states and 8339 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 11:34:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:11,373 INFO L93 Difference]: Finished difference Result 10525 states and 12462 transitions. [2025-03-04 11:34:11,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:11,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 446 [2025-03-04 11:34:11,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:11,386 INFO L225 Difference]: With dead ends: 10525 [2025-03-04 11:34:11,386 INFO L226 Difference]: Without dead ends: 3664 [2025-03-04 11:34:11,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:34:11,395 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 4 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:11,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 276 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:11,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2025-03-04 11:34:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 3664. [2025-03-04 11:34:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3664 states, 3210 states have (on average 1.1398753894080997) internal successors, (3659), 3211 states have internal predecessors, (3659), 260 states have call successors, (260), 168 states have call predecessors, (260), 192 states have return successors, (340), 284 states have call predecessors, (340), 260 states have call successors, (340) [2025-03-04 11:34:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3664 states to 3664 states and 4259 transitions. [2025-03-04 11:34:11,549 INFO L78 Accepts]: Start accepts. Automaton has 3664 states and 4259 transitions. Word has length 446 [2025-03-04 11:34:11,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:11,550 INFO L471 AbstractCegarLoop]: Abstraction has 3664 states and 4259 transitions. [2025-03-04 11:34:11,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 11:34:11,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3664 states and 4259 transitions. [2025-03-04 11:34:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-03-04 11:34:11,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:11,560 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 16, 11, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:11,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:34:11,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 11:34:11,761 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:11,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:11,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1340948899, now seen corresponding path program 1 times [2025-03-04 11:34:11,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:11,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82910816] [2025-03-04 11:34:11,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:11,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:11,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-03-04 11:34:11,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-03-04 11:34:11,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:11,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:11,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 167 proven. 88 refuted. 0 times theorem prover too weak. 1232 trivial. 0 not checked. [2025-03-04 11:34:11,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:11,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82910816] [2025-03-04 11:34:11,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82910816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:11,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207215200] [2025-03-04 11:34:11,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:11,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:11,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:11,897 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:34:11,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:34:11,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-03-04 11:34:12,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-03-04 11:34:12,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:12,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:12,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:34:12,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:12,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2025-03-04 11:34:12,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:12,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207215200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:12,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:12,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-04 11:34:12,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032318196] [2025-03-04 11:34:12,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:12,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:34:12,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:12,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:34:12,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:34:12,087 INFO L87 Difference]: Start difference. First operand 3664 states and 4259 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 11:34:12,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:12,136 INFO L93 Difference]: Finished difference Result 5373 states and 6262 transitions. [2025-03-04 11:34:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:34:12,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 451 [2025-03-04 11:34:12,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:12,144 INFO L225 Difference]: With dead ends: 5373 [2025-03-04 11:34:12,144 INFO L226 Difference]: Without dead ends: 1904 [2025-03-04 11:34:12,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:34:12,148 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 2 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:12,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 269 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:12,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2025-03-04 11:34:12,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1904. [2025-03-04 11:34:12,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1904 states, 1658 states have (on average 1.1115802171290712) internal successors, (1843), 1659 states have internal predecessors, (1843), 132 states have call successors, (132), 88 states have call predecessors, (132), 112 states have return successors, (172), 156 states have call predecessors, (172), 132 states have call successors, (172) [2025-03-04 11:34:12,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2147 transitions. [2025-03-04 11:34:12,208 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2147 transitions. Word has length 451 [2025-03-04 11:34:12,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:12,209 INFO L471 AbstractCegarLoop]: Abstraction has 1904 states and 2147 transitions. [2025-03-04 11:34:12,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-04 11:34:12,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2147 transitions. [2025-03-04 11:34:12,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-03-04 11:34:12,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:12,213 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 14, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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-04 11:34:12,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:34:12,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 11:34:12,414 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:12,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:12,414 INFO L85 PathProgramCache]: Analyzing trace with hash -281714961, now seen corresponding path program 1 times [2025-03-04 11:34:12,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:12,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55481945] [2025-03-04 11:34:12,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:12,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:12,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-04 11:34:12,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-04 11:34:12,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:12,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1813 backedges. 174 proven. 160 refuted. 0 times theorem prover too weak. 1479 trivial. 0 not checked. [2025-03-04 11:34:12,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:12,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55481945] [2025-03-04 11:34:12,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55481945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:12,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250074370] [2025-03-04 11:34:12,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:12,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:12,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:12,611 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:34:12,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:34:12,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-04 11:34:12,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-04 11:34:12,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:12,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:12,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 1229 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:34:12,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1813 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 1515 trivial. 0 not checked. [2025-03-04 11:34:12,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:12,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250074370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:12,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:12,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-03-04 11:34:12,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681055156] [2025-03-04 11:34:12,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:12,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:12,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:12,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:12,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:34:12,911 INFO L87 Difference]: Start difference. First operand 1904 states and 2147 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 11:34:13,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:13,109 INFO L93 Difference]: Finished difference Result 4923 states and 5575 transitions. [2025-03-04 11:34:13,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:34:13,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 516 [2025-03-04 11:34:13,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:13,120 INFO L225 Difference]: With dead ends: 4923 [2025-03-04 11:34:13,120 INFO L226 Difference]: Without dead ends: 3341 [2025-03-04 11:34:13,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:34:13,124 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 168 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:13,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 454 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:13,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3341 states. [2025-03-04 11:34:13,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3341 to 3291. [2025-03-04 11:34:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3291 states, 2875 states have (on average 1.1116521739130434) internal successors, (3196), 2876 states have internal predecessors, (3196), 223 states have call successors, (223), 146 states have call predecessors, (223), 191 states have return successors, (298), 268 states have call predecessors, (298), 223 states have call successors, (298) [2025-03-04 11:34:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 3717 transitions. [2025-03-04 11:34:13,265 INFO L78 Accepts]: Start accepts. Automaton has 3291 states and 3717 transitions. Word has length 516 [2025-03-04 11:34:13,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:13,265 INFO L471 AbstractCegarLoop]: Abstraction has 3291 states and 3717 transitions. [2025-03-04 11:34:13,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 11:34:13,265 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 3717 transitions. [2025-03-04 11:34:13,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-04 11:34:13,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:13,271 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 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-04 11:34:13,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:34:13,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 11:34:13,475 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:34:13,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:13,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1104581528, now seen corresponding path program 1 times [2025-03-04 11:34:13,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:13,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367306777] [2025-03-04 11:34:13,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:13,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:13,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-04 11:34:13,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-04 11:34:13,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:13,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:13,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1810 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2025-03-04 11:34:13,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:13,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367306777] [2025-03-04 11:34:13,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367306777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:34:13,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098654425] [2025-03-04 11:34:13,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:13,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:34:13,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:13,616 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:34:13,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:34:13,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-04 11:34:13,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-04 11:34:13,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:13,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:13,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:34:13,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:34:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1810 backedges. 1376 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2025-03-04 11:34:14,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:34:14,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098654425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:14,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:34:14,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-03-04 11:34:14,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086147758] [2025-03-04 11:34:14,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:14,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:14,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:14,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:14,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:34:14,456 INFO L87 Difference]: Start difference. First operand 3291 states and 3717 transitions. Second operand has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 4 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2025-03-04 11:34:14,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:14,542 INFO L93 Difference]: Finished difference Result 3481 states and 3934 transitions. [2025-03-04 11:34:14,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:34:14,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 4 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 540 [2025-03-04 11:34:14,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:14,547 INFO L225 Difference]: With dead ends: 3481 [2025-03-04 11:34:14,548 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:34:14,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:34:14,553 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 38 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:14,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 410 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:14,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:34:14,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:34:14,554 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-04 11:34:14,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:34:14,557 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 540 [2025-03-04 11:34:14,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:14,557 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:34:14,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 4 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2025-03-04 11:34:14,558 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:34:14,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:34:14,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-04 11:34:14,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-04 11:34:14,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-04 11:34:14,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-04 11:34:14,560 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-04 11:34:14,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-04 11:34:14,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-04 11:34:14,561 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-04 11:34:14,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 11:34:14,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 11:34:14,764 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:34:14,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:34:28,517 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:34:28,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:34:28 BoogieIcfgContainer [2025-03-04 11:34:28,545 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:34:28,545 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:34:28,545 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:34:28,545 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:34:28,546 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:33:59" (3/4) ... [2025-03-04 11:34:28,547 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:34:28,553 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure activate_threads [2025-03-04 11:34:28,553 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2025-03-04 11:34:28,553 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2025-03-04 11:34:28,553 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure update_channels [2025-03-04 11:34:28,553 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2025-03-04 11:34:28,554 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure error [2025-03-04 11:34:28,558 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-04 11:34:28,559 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 11:34:28,559 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:34:28,559 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:34:28,633 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:34:28,633 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:34:28,633 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:34:28,634 INFO L158 Benchmark]: Toolchain (without parser) took 29821.87ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 123.9MB in the beginning and 696.2MB in the end (delta: -572.3MB). Peak memory consumption was 538.7MB. Max. memory is 16.1GB. [2025-03-04 11:34:28,634 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:34:28,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.12ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 111.0MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:34:28,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.07ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 108.8MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:34:28,634 INFO L158 Benchmark]: Boogie Preprocessor took 26.18ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 107.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:34:28,634 INFO L158 Benchmark]: IcfgBuilder took 391.41ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 85.7MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 11:34:28,634 INFO L158 Benchmark]: TraceAbstraction took 29058.42ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 85.7MB in the beginning and 704.6MB in the end (delta: -618.9MB). Peak memory consumption was 730.2MB. Max. memory is 16.1GB. [2025-03-04 11:34:28,634 INFO L158 Benchmark]: Witness Printer took 88.03ms. Allocated memory is still 1.3GB. Free memory was 704.6MB in the beginning and 696.2MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:34:28,635 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.13ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.12ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 111.0MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.07ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 108.8MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.18ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 107.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 391.41ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 85.7MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 29058.42ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 85.7MB in the beginning and 704.6MB in the end (delta: -618.9MB). Peak memory consumption was 730.2MB. Max. memory is 16.1GB. * Witness Printer took 88.03ms. Allocated memory is still 1.3GB. Free memory was 704.6MB in the beginning and 696.2MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 179]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 179]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 160]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 160]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 97]: 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 7 procedures, 127 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 28, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5339 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5331 mSDsluCounter, 12662 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7210 mSDsCounter, 520 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1466 IncrementalHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 520 mSolverCounterUnsat, 5452 mSDtfsCounter, 1466 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3971 GetRequests, 3849 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7056occurred in iteration=24, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 6265 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 8824 NumberOfCodeBlocks, 8824 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 8958 ConstructedInterpolants, 0 QuantifiedInterpolants, 14661 SizeOfPredicates, 3 NumberOfNonLiveVariables, 8884 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 40 InterpolantComputations, 27 PerfectInterpolantSequences, 20023/20727 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 - InvariantResult [Line: 156]: Location Invariant Derived location invariant: (((((((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0)) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i == 1)) && (C_1_st != 0)) && (0 <= num))) || ((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0))) || ((((((((((P_1_pc == 1) && (i == 0)) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && (C_1_st != 0)) && (P_1_st != 0))) || (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i <= 2147483645)) && (C_1_st != 0)) && (0 <= num)) && (2 <= i))) - InvariantResult [Line: 93]: Location Invariant Derived location invariant: (((((((((((((((1 <= C_1_ev) && (P_1_pc == 1)) && (i == 0)) && (e <= 0)) && (C_1_pc == 0)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0)) || (((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((1 <= i) && (1 <= C_1_ev)) && (P_1_pc == 1)) && (e <= 0)) && (2 != C_1_pc)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i <= 2147483645)) && (0 <= num)) && (2 <= i)) && (P_1_st != 0))) || ((((((((1 <= i) && (1 <= C_1_ev)) && (P_1_pc == 1)) && (e <= 0)) && (2 != C_1_pc)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i == 1)) && (0 <= num)) && (P_1_st != 0))) || (((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) || (((((((((e <= 0) && (2 != C_1_pc)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) - InvariantResult [Line: 279]: Location Invariant Derived location invariant: (((((((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0)) || ((((((((((2 == C_1_pc) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || (((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i == 1)) && (0 <= num))) || (((((((1 <= i) && (1 <= C_1_ev)) && (P_1_pc == 1)) && (e <= 0)) && (2 != C_1_pc)) && (C_1_st != 0)) && (1 <= num))) || (((((((((P_1_pc == 1) && (i == 0)) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && (P_1_st != 0))) || ((((((e <= 0) && (2 != C_1_pc)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((P_1_pc == 1) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i <= 2147483645)) && (0 <= num)) && (2 <= i))) || ((((((((e <= 0) && (2 != C_1_pc)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0))) || (((((((1 <= i) && (1 <= C_1_ev)) && (P_1_pc == 1)) && (e <= 0)) && (2 != C_1_pc)) && (num == 0)) && (C_1_st != 0))) || (((((((1 <= C_1_ev) && (P_1_pc == 1)) && (i == 0)) && (e <= 0)) && (C_1_pc == 0)) && (C_1_st != 0)) && (1 <= num))) || ((((((((P_1_pc == 1) && (e <= 0)) && (2 != C_1_pc)) && (P_1_ev <= 0)) && (i == 1)) && (num == 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) - InvariantResult [Line: 445]: Location Invariant Derived location invariant: (((((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0)) || ((((((((((2 == C_1_pc) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || (((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i == 1)) && (0 <= num))) || (((((((1 <= i) && (1 <= C_1_ev)) && (P_1_pc == 1)) && (e <= 0)) && (2 != C_1_pc)) && (C_1_st != 0)) && (1 <= num))) || ((((((e <= 0) && (2 != C_1_pc)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((P_1_pc == 1) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (num <= 2)) && (max_loop <= 2)) && (i <= 2147483645)) && (0 <= num)) && (2 <= i))) || ((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0))) || (((((((1 <= i) && (1 <= C_1_ev)) && (P_1_pc == 1)) && (e <= 0)) && (2 != C_1_pc)) && (num == 0)) && (C_1_st != 0))) || (((((((1 <= C_1_ev) && (P_1_pc == 1)) && (i == 0)) && (e <= 0)) && (C_1_pc == 0)) && (C_1_st != 0)) && (1 <= num))) || ((((((((P_1_pc == 1) && (e <= 0)) && (2 != C_1_pc)) && (P_1_ev <= 0)) && (i == 1)) && (num == 1)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) RESULT: Ultimate proved your program to be correct! [2025-03-04 11:34:28,649 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