./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-e2fb8be-m [2025-03-09 02:46:46,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:46:46,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:46:46,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:46:46,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:46:46,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:46:46,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:46:46,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:46:46,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:46:46,724 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:46:46,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:46:46,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:46:46,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:46:46,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:46:46,726 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:46:46,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:46:46,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:46:46,727 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:46:46,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:46:46,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:46:46,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:46:46,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:46:46,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:46:46,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:46:46,727 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:46:46,727 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:46:46,727 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:46:46,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:46:46,727 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:46:46,727 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:46:46,728 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:46:46,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:46:46,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:46:46,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:46:46,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:46:46,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:46:46,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:46:46,728 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:46:46,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:46:46,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:46:46,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:46:46,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:46:46,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:46:46,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:46:46,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:46:46,729 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-09 02:46:46,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:46:46,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:46:46,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:46:46,960 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:46:46,960 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:46:46,961 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-09 02:46:48,107 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77f4ece72/519a9aa57539472faddb5ec8049fb36e/FLAG2f8a19d39 [2025-03-09 02:46:48,366 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:46:48,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2025-03-09 02:46:48,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77f4ece72/519a9aa57539472faddb5ec8049fb36e/FLAG2f8a19d39 [2025-03-09 02:46:48,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77f4ece72/519a9aa57539472faddb5ec8049fb36e [2025-03-09 02:46:48,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:46:48,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:46:48,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:46:48,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:46:48,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:46:48,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:46:48" (1/1) ... [2025-03-09 02:46:48,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@200b0d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:48, skipping insertion in model container [2025-03-09 02:46:48,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:46:48" (1/1) ... [2025-03-09 02:46:48,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:46:48,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:46:48,896 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:46:48,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:46:48,944 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:46:48,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:48 WrapperNode [2025-03-09 02:46:48,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:46:48,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:46:48,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:46:48,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:46:48,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:48" (1/1) ... [2025-03-09 02:46:48,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:48" (1/1) ... [2025-03-09 02:46:48,978 INFO L138 Inliner]: procedures = 32, calls = 37, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 259 [2025-03-09 02:46:48,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:46:48,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:46:48,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:46:48,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:46:48,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:48" (1/1) ... [2025-03-09 02:46:48,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:48" (1/1) ... [2025-03-09 02:46:48,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:48" (1/1) ... [2025-03-09 02:46:49,001 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-09 02:46:49,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:48" (1/1) ... [2025-03-09 02:46:49,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:48" (1/1) ... [2025-03-09 02:46:49,004 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:48" (1/1) ... [2025-03-09 02:46:49,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:48" (1/1) ... [2025-03-09 02:46:49,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:48" (1/1) ... [2025-03-09 02:46:49,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:48" (1/1) ... [2025-03-09 02:46:49,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:46:49,007 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:46:49,007 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:46:49,007 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:46:49,008 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:48" (1/1) ... [2025-03-09 02:46:49,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:46:49,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:49,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:46:49,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:46:49,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:46:49,055 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-09 02:46:49,055 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-09 02:46:49,055 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-09 02:46:49,055 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-09 02:46:49,055 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-09 02:46:49,055 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-09 02:46:49,055 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-09 02:46:49,055 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-09 02:46:49,055 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-09 02:46:49,055 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-09 02:46:49,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:46:49,055 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-09 02:46:49,055 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-09 02:46:49,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:46:49,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:46:49,119 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:46:49,120 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:46:49,438 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-03-09 02:46:49,438 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:46:49,449 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:46:49,449 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:46:49,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:46:49 BoogieIcfgContainer [2025-03-09 02:46:49,449 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:46:49,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:46:49,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:46:49,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:46:49,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:46:48" (1/3) ... [2025-03-09 02:46:49,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6071080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:46:49, skipping insertion in model container [2025-03-09 02:46:49,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:48" (2/3) ... [2025-03-09 02:46:49,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6071080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:46:49, skipping insertion in model container [2025-03-09 02:46:49,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:46:49" (3/3) ... [2025-03-09 02:46:49,458 INFO L128 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2025-03-09 02:46:49,469 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:46:49,471 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG kundu1.cil.c that has 7 procedures, 121 locations, 1 initial locations, 4 loop locations, and 8 error locations. [2025-03-09 02:46:49,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:46:49,523 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;@d469426, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:46:49,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 02:46:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 102 states have internal predecessors, (136), 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-09 02:46:49,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 02:46:49,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:49,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:49,532 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-09 02:46:49,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:49,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1598187808, now seen corresponding path program 1 times [2025-03-09 02:46:49,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:49,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112244032] [2025-03-09 02:46:49,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:49,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:49,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:46:49,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:46:49,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:49,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:49,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:49,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:49,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112244032] [2025-03-09 02:46:49,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112244032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:49,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:49,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:46:49,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25282689] [2025-03-09 02:46:49,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:49,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:46:49,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:49,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:46:49,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:46:49,753 INFO L87 Difference]: Start difference. First operand has 121 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 102 states have internal predecessors, (136), 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 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:46:49,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:49,790 INFO L93 Difference]: Finished difference Result 232 states and 321 transitions. [2025-03-09 02:46:49,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:46:49,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2025-03-09 02:46:49,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:49,798 INFO L225 Difference]: With dead ends: 232 [2025-03-09 02:46:49,800 INFO L226 Difference]: Without dead ends: 109 [2025-03-09 02:46:49,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:46:49,807 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 151 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:49,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 155 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:49,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-09 02:46:49,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-09 02:46:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 92 states have internal predecessors, (122), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-09 02:46:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 146 transitions. [2025-03-09 02:46:49,855 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 146 transitions. Word has length 46 [2025-03-09 02:46:49,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:49,860 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 146 transitions. [2025-03-09 02:46:49,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:46:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 146 transitions. [2025-03-09 02:46:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 02:46:49,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:49,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:49,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:46:49,862 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-09 02:46:49,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:49,863 INFO L85 PathProgramCache]: Analyzing trace with hash -675504225, now seen corresponding path program 1 times [2025-03-09 02:46:49,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:49,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256960663] [2025-03-09 02:46:49,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:49,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:49,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:46:49,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:46:49,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:49,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:50,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:50,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256960663] [2025-03-09 02:46:50,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256960663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:50,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:50,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:46:50,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594579074] [2025-03-09 02:46:50,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:50,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:46:50,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:50,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:46:50,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:46:50,041 INFO L87 Difference]: Start difference. First operand 109 states and 146 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (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-09 02:46:50,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:50,191 INFO L93 Difference]: Finished difference Result 304 states and 409 transitions. [2025-03-09 02:46:50,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:46:50,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (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 46 [2025-03-09 02:46:50,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:50,194 INFO L225 Difference]: With dead ends: 304 [2025-03-09 02:46:50,194 INFO L226 Difference]: Without dead ends: 205 [2025-03-09 02:46:50,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:46:50,195 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 244 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:50,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 480 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:50,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-09 02:46:50,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 191. [2025-03-09 02:46:50,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 153 states have (on average 1.4248366013071896) internal successors, (218), 161 states have internal predecessors, (218), 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-09 02:46:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 258 transitions. [2025-03-09 02:46:50,221 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 258 transitions. Word has length 46 [2025-03-09 02:46:50,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:50,224 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 258 transitions. [2025-03-09 02:46:50,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (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-09 02:46:50,224 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 258 transitions. [2025-03-09 02:46:50,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 02:46:50,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:50,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:50,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:46:50,225 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-09 02:46:50,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:50,225 INFO L85 PathProgramCache]: Analyzing trace with hash -347336542, now seen corresponding path program 1 times [2025-03-09 02:46:50,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:50,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276453839] [2025-03-09 02:46:50,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:50,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:50,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:46:50,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:46:50,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:50,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:50,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:50,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:50,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276453839] [2025-03-09 02:46:50,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276453839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:50,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:50,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:50,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465631369] [2025-03-09 02:46:50,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:50,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:46:50,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:50,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:46:50,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:46:50,335 INFO L87 Difference]: Start difference. First operand 191 states and 258 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-09 02:46:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:50,377 INFO L93 Difference]: Finished difference Result 375 states and 511 transitions. [2025-03-09 02:46:50,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:46:50,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 46 [2025-03-09 02:46:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:50,381 INFO L225 Difference]: With dead ends: 375 [2025-03-09 02:46:50,381 INFO L226 Difference]: Without dead ends: 194 [2025-03-09 02:46:50,382 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-09 02:46:50,383 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 562 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-09 02:46:50,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 562 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-09 02:46:50,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-03-09 02:46:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 156 states have (on average 1.4102564102564104) internal successors, (220), 164 states have internal predecessors, (220), 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-09 02:46:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 260 transitions. [2025-03-09 02:46:50,399 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 260 transitions. Word has length 46 [2025-03-09 02:46:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:50,399 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 260 transitions. [2025-03-09 02:46:50,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-09 02:46:50,400 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 260 transitions. [2025-03-09 02:46:50,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 02:46:50,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:50,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:50,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:46:50,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:46:50,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:50,402 INFO L85 PathProgramCache]: Analyzing trace with hash 614277475, now seen corresponding path program 1 times [2025-03-09 02:46:50,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:50,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324032668] [2025-03-09 02:46:50,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:50,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:50,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:46:50,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:46:50,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:50,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:50,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:50,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324032668] [2025-03-09 02:46:50,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324032668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:50,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:50,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:50,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429649582] [2025-03-09 02:46:50,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:50,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:46:50,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:50,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:46:50,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:46:50,492 INFO L87 Difference]: Start difference. First operand 194 states and 260 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-09 02:46:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:50,802 INFO L93 Difference]: Finished difference Result 801 states and 1061 transitions. [2025-03-09 02:46:50,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:50,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 46 [2025-03-09 02:46:50,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:50,807 INFO L225 Difference]: With dead ends: 801 [2025-03-09 02:46:50,808 INFO L226 Difference]: Without dead ends: 589 [2025-03-09 02:46:50,809 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-09 02:46:50,809 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 596 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 594 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-09 02:46:50,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 594 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:46:50,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-09 02:46:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 419. [2025-03-09 02:46:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 346 states have (on average 1.4046242774566473) internal successors, (486), 353 states have internal predecessors, (486), 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-09 02:46:50,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 570 transitions. [2025-03-09 02:46:50,861 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 570 transitions. Word has length 46 [2025-03-09 02:46:50,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:50,861 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 570 transitions. [2025-03-09 02:46:50,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-09 02:46:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 570 transitions. [2025-03-09 02:46:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 02:46:50,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:50,862 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-09 02:46:50,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:46:50,862 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:46:50,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:50,862 INFO L85 PathProgramCache]: Analyzing trace with hash 194672010, now seen corresponding path program 1 times [2025-03-09 02:46:50,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:50,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934333855] [2025-03-09 02:46:50,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:50,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:50,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 02:46:50,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 02:46:50,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:50,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:50,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:50,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934333855] [2025-03-09 02:46:50,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934333855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:50,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:50,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:46:50,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890863561] [2025-03-09 02:46:50,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:50,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:46:50,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:50,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:46:50,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:46:50,917 INFO L87 Difference]: Start difference. First operand 419 states and 570 transitions. 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-09 02:46:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:51,046 INFO L93 Difference]: Finished difference Result 1098 states and 1484 transitions. [2025-03-09 02:46:51,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:46:51,047 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-09 02:46:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:51,050 INFO L225 Difference]: With dead ends: 1098 [2025-03-09 02:46:51,052 INFO L226 Difference]: Without dead ends: 689 [2025-03-09 02:46:51,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:46:51,055 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 237 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:51,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 631 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-03-09 02:46:51,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 545. [2025-03-09 02:46:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 442 states have (on average 1.3257918552036199) internal successors, (586), 450 states have internal predecessors, (586), 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-09 02:46:51,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 710 transitions. [2025-03-09 02:46:51,101 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 710 transitions. Word has length 48 [2025-03-09 02:46:51,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:51,101 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 710 transitions. [2025-03-09 02:46:51,102 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-09 02:46:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 710 transitions. [2025-03-09 02:46:51,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 02:46:51,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:51,103 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-09 02:46:51,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:46:51,104 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-09 02:46:51,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:51,105 INFO L85 PathProgramCache]: Analyzing trace with hash 85143207, now seen corresponding path program 1 times [2025-03-09 02:46:51,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:51,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342624216] [2025-03-09 02:46:51,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:51,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:51,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 02:46:51,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 02:46:51,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:51,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:51,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:51,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342624216] [2025-03-09 02:46:51,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342624216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:51,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:51,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:51,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879087778] [2025-03-09 02:46:51,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:51,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:46:51,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:51,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:46:51,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:46:51,185 INFO L87 Difference]: Start difference. First operand 545 states and 710 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-09 02:46:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:51,242 INFO L93 Difference]: Finished difference Result 1092 states and 1441 transitions. [2025-03-09 02:46:51,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:46:51,242 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-09 02:46:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:51,245 INFO L225 Difference]: With dead ends: 1092 [2025-03-09 02:46:51,245 INFO L226 Difference]: Without dead ends: 557 [2025-03-09 02:46:51,247 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-09 02:46:51,248 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 561 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-09 02:46:51,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 561 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:51,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-09 02:46:51,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2025-03-09 02:46:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 454 states have (on average 1.3105726872246697) internal successors, (595), 462 states have internal predecessors, (595), 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-09 02:46:51,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 719 transitions. [2025-03-09 02:46:51,284 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 719 transitions. Word has length 48 [2025-03-09 02:46:51,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:51,284 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 719 transitions. [2025-03-09 02:46:51,285 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-09 02:46:51,285 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 719 transitions. [2025-03-09 02:46:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 02:46:51,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:51,287 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-09 02:46:51,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:46:51,288 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:46:51,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:51,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1952913082, now seen corresponding path program 1 times [2025-03-09 02:46:51,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:51,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969636125] [2025-03-09 02:46:51,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:51,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:51,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 02:46:51,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 02:46:51,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:51,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:51,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:51,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969636125] [2025-03-09 02:46:51,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969636125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:51,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:51,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:46:51,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207454094] [2025-03-09 02:46:51,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:51,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:46:51,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:51,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:46:51,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:46:51,360 INFO L87 Difference]: Start difference. First operand 557 states and 719 transitions. 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), 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-09 02:46:51,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:51,508 INFO L93 Difference]: Finished difference Result 1619 states and 2120 transitions. [2025-03-09 02:46:51,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:46:51,509 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), 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 48 [2025-03-09 02:46:51,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:51,515 INFO L225 Difference]: With dead ends: 1619 [2025-03-09 02:46:51,515 INFO L226 Difference]: Without dead ends: 1073 [2025-03-09 02:46:51,517 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-09 02:46:51,518 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 158 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:51,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 331 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2025-03-09 02:46:51,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1067. [2025-03-09 02:46:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 870 states have (on average 1.2793103448275862) internal successors, (1113), 881 states have internal predecessors, (1113), 116 states have call successors, (116), 70 states have call predecessors, (116), 73 states have return successors, (153), 116 states have call predecessors, (153), 116 states have call successors, (153) [2025-03-09 02:46:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1382 transitions. [2025-03-09 02:46:51,595 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1382 transitions. Word has length 48 [2025-03-09 02:46:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:51,595 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1382 transitions. [2025-03-09 02:46:51,595 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), 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-09 02:46:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1382 transitions. [2025-03-09 02:46:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 02:46:51,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:51,596 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] [2025-03-09 02:46:51,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:46:51,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:46:51,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash 212281503, now seen corresponding path program 1 times [2025-03-09 02:46:51,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:51,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071703592] [2025-03-09 02:46:51,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:51,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:51,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 02:46:51,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 02:46:51,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:51,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:51,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:51,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071703592] [2025-03-09 02:46:51,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071703592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:51,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:51,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:46:51,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137970624] [2025-03-09 02:46:51,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:51,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:46:51,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:51,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:46:51,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:46:51,650 INFO L87 Difference]: Start difference. First operand 1067 states and 1382 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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-09 02:46:51,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:51,763 INFO L93 Difference]: Finished difference Result 2623 states and 3408 transitions. [2025-03-09 02:46:51,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:46:51,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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 49 [2025-03-09 02:46:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:51,772 INFO L225 Difference]: With dead ends: 2623 [2025-03-09 02:46:51,772 INFO L226 Difference]: Without dead ends: 1691 [2025-03-09 02:46:51,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:46:51,776 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 105 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 259 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-09 02:46:51,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 259 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:51,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2025-03-09 02:46:51,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1691. [2025-03-09 02:46:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1387 states have (on average 1.2667627974044702) internal successors, (1757), 1401 states have internal predecessors, (1757), 180 states have call successors, (180), 110 states have call predecessors, (180), 116 states have return successors, (241), 180 states have call predecessors, (241), 180 states have call successors, (241) [2025-03-09 02:46:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2178 transitions. [2025-03-09 02:46:51,891 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2178 transitions. Word has length 49 [2025-03-09 02:46:51,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:51,891 INFO L471 AbstractCegarLoop]: Abstraction has 1691 states and 2178 transitions. [2025-03-09 02:46:51,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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-09 02:46:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2178 transitions. [2025-03-09 02:46:51,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 02:46:51,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:51,893 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] [2025-03-09 02:46:51,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 02:46:51,893 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:46:51,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:51,894 INFO L85 PathProgramCache]: Analyzing trace with hash 393564704, now seen corresponding path program 1 times [2025-03-09 02:46:51,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:51,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431870434] [2025-03-09 02:46:51,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:51,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:51,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 02:46:51,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 02:46:51,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:51,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:51,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:51,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:51,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431870434] [2025-03-09 02:46:51,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431870434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:51,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:51,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:46:51,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217828199] [2025-03-09 02:46:51,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:51,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:46:51,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:51,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:46:51,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:46:51,944 INFO L87 Difference]: Start difference. First operand 1691 states and 2178 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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-09 02:46:52,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:52,032 INFO L93 Difference]: Finished difference Result 1885 states and 2423 transitions. [2025-03-09 02:46:52,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:46:52,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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 49 [2025-03-09 02:46:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:52,041 INFO L225 Difference]: With dead ends: 1885 [2025-03-09 02:46:52,041 INFO L226 Difference]: Without dead ends: 1881 [2025-03-09 02:46:52,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:46:52,043 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 105 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 261 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-09 02:46:52,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 261 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:52,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2025-03-09 02:46:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1877. [2025-03-09 02:46:52,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1546 states have (on average 1.2632600258732212) internal successors, (1953), 1561 states have internal predecessors, (1953), 196 states have call successors, (196), 120 states have call predecessors, (196), 127 states have return successors, (262), 196 states have call predecessors, (262), 196 states have call successors, (262) [2025-03-09 02:46:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2411 transitions. [2025-03-09 02:46:52,141 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2411 transitions. Word has length 49 [2025-03-09 02:46:52,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:52,141 INFO L471 AbstractCegarLoop]: Abstraction has 1877 states and 2411 transitions. [2025-03-09 02:46:52,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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-09 02:46:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2411 transitions. [2025-03-09 02:46:52,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-09 02:46:52,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:52,142 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] [2025-03-09 02:46:52,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 02:46:52,142 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:46:52,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:52,143 INFO L85 PathProgramCache]: Analyzing trace with hash 78568520, now seen corresponding path program 1 times [2025-03-09 02:46:52,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:52,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083832427] [2025-03-09 02:46:52,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:52,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:52,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:46:52,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:46:52,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:52,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:52,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:52,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083832427] [2025-03-09 02:46:52,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083832427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:52,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:52,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:46:52,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326247081] [2025-03-09 02:46:52,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:52,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:46:52,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:52,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:46:52,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:46:52,227 INFO L87 Difference]: Start difference. First operand 1877 states and 2411 transitions. Second operand has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 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-09 02:46:52,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:52,420 INFO L93 Difference]: Finished difference Result 3039 states and 3913 transitions. [2025-03-09 02:46:52,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:46:52,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 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 57 [2025-03-09 02:46:52,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:52,432 INFO L225 Difference]: With dead ends: 3039 [2025-03-09 02:46:52,432 INFO L226 Difference]: Without dead ends: 2043 [2025-03-09 02:46:52,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:46:52,443 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 205 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 449 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-09 02:46:52,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 449 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2025-03-09 02:46:52,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2041. [2025-03-09 02:46:52,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2041 states, 1683 states have (on average 1.2572786690433748) internal successors, (2116), 1699 states have internal predecessors, (2116), 212 states have call successors, (212), 130 states have call predecessors, (212), 138 states have return successors, (283), 212 states have call predecessors, (283), 212 states have call successors, (283) [2025-03-09 02:46:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 2611 transitions. [2025-03-09 02:46:52,536 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 2611 transitions. Word has length 57 [2025-03-09 02:46:52,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:52,536 INFO L471 AbstractCegarLoop]: Abstraction has 2041 states and 2611 transitions. [2025-03-09 02:46:52,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 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-09 02:46:52,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2611 transitions. [2025-03-09 02:46:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 02:46:52,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:52,537 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] [2025-03-09 02:46:52,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 02:46:52,538 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:46:52,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:52,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1859343100, now seen corresponding path program 1 times [2025-03-09 02:46:52,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:52,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220015890] [2025-03-09 02:46:52,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:52,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:52,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 02:46:52,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 02:46:52,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:52,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:46:52,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:52,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220015890] [2025-03-09 02:46:52,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220015890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:52,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:52,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:46:52,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520763084] [2025-03-09 02:46:52,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:52,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:46:52,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:52,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:46:52,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:46:52,593 INFO L87 Difference]: Start difference. First operand 2041 states and 2611 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 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-09 02:46:52,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:52,775 INFO L93 Difference]: Finished difference Result 2881 states and 3685 transitions. [2025-03-09 02:46:52,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:46:52,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 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 58 [2025-03-09 02:46:52,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:52,789 INFO L225 Difference]: With dead ends: 2881 [2025-03-09 02:46:52,789 INFO L226 Difference]: Without dead ends: 2879 [2025-03-09 02:46:52,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:46:52,791 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 291 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 346 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-09 02:46:52,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 346 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:52,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2025-03-09 02:46:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2871. [2025-03-09 02:46:52,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2378 states have (on average 1.253994953742641) internal successors, (2982), 2399 states have internal predecessors, (2982), 292 states have call successors, (292), 180 states have call predecessors, (292), 193 states have return successors, (394), 292 states have call predecessors, (394), 292 states have call successors, (394) [2025-03-09 02:46:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 3668 transitions. [2025-03-09 02:46:52,938 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 3668 transitions. Word has length 58 [2025-03-09 02:46:52,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:52,939 INFO L471 AbstractCegarLoop]: Abstraction has 2871 states and 3668 transitions. [2025-03-09 02:46:52,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 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-09 02:46:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 3668 transitions. [2025-03-09 02:46:52,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-09 02:46:52,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:52,940 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:52,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 02:46:52,940 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:46:52,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:52,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1920255505, now seen corresponding path program 1 times [2025-03-09 02:46:52,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:52,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659521933] [2025-03-09 02:46:52,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:52,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:52,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 02:46:52,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 02:46:52,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:52,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 02:46:53,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:53,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659521933] [2025-03-09 02:46:53,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659521933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:53,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:53,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:53,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019520856] [2025-03-09 02:46:53,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:53,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:46:53,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:53,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:46:53,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:46:53,011 INFO L87 Difference]: Start difference. First operand 2871 states and 3668 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-09 02:46:53,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:53,262 INFO L93 Difference]: Finished difference Result 6615 states and 8572 transitions. [2025-03-09 02:46:53,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:53,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 67 [2025-03-09 02:46:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:53,282 INFO L225 Difference]: With dead ends: 6615 [2025-03-09 02:46:53,282 INFO L226 Difference]: Without dead ends: 3755 [2025-03-09 02:46:53,290 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-09 02:46:53,290 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 575 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:53,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 628 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:53,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2025-03-09 02:46:53,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 3621. [2025-03-09 02:46:53,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 2965 states have (on average 1.226981450252951) internal successors, (3638), 2991 states have internal predecessors, (3638), 391 states have call successors, (391), 240 states have call predecessors, (391), 257 states have return successors, (565), 391 states have call predecessors, (565), 391 states have call successors, (565) [2025-03-09 02:46:53,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 4594 transitions. [2025-03-09 02:46:53,451 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 4594 transitions. Word has length 67 [2025-03-09 02:46:53,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:53,451 INFO L471 AbstractCegarLoop]: Abstraction has 3621 states and 4594 transitions. [2025-03-09 02:46:53,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-09 02:46:53,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 4594 transitions. [2025-03-09 02:46:53,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-09 02:46:53,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:53,454 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 02:46:53,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 02:46:53,454 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:46:53,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:53,455 INFO L85 PathProgramCache]: Analyzing trace with hash 344057316, now seen corresponding path program 1 times [2025-03-09 02:46:53,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:53,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439043095] [2025-03-09 02:46:53,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:53,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:53,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-09 02:46:53,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-09 02:46:53,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:53,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:46:53,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:53,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439043095] [2025-03-09 02:46:53,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439043095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:53,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:53,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:53,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888123521] [2025-03-09 02:46:53,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:53,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:46:53,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:53,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:46:53,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:53,526 INFO L87 Difference]: Start difference. First operand 3621 states and 4594 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-09 02:46:53,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:53,902 INFO L93 Difference]: Finished difference Result 7373 states and 9333 transitions. [2025-03-09 02:46:53,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:46:53,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 79 [2025-03-09 02:46:53,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:53,918 INFO L225 Difference]: With dead ends: 7373 [2025-03-09 02:46:53,918 INFO L226 Difference]: Without dead ends: 3649 [2025-03-09 02:46:53,927 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-09 02:46:53,927 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 961 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:53,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 892 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:46:53,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states. [2025-03-09 02:46:54,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 3503. [2025-03-09 02:46:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3503 states, 2873 states have (on average 1.2119735468151758) internal successors, (3482), 2899 states have internal predecessors, (3482), 375 states have call successors, (375), 230 states have call predecessors, (375), 247 states have return successors, (474), 375 states have call predecessors, (474), 375 states have call successors, (474) [2025-03-09 02:46:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 4331 transitions. [2025-03-09 02:46:54,121 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 4331 transitions. Word has length 79 [2025-03-09 02:46:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:54,122 INFO L471 AbstractCegarLoop]: Abstraction has 3503 states and 4331 transitions. [2025-03-09 02:46:54,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-09 02:46:54,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 4331 transitions. [2025-03-09 02:46:54,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-09 02:46:54,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:54,130 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:54,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 02:46:54,130 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:46:54,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:54,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1958713016, now seen corresponding path program 1 times [2025-03-09 02:46:54,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:54,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833690395] [2025-03-09 02:46:54,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:54,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:54,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-09 02:46:54,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-09 02:46:54,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:54,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-09 02:46:54,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:54,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833690395] [2025-03-09 02:46:54,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833690395] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:46:54,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637570848] [2025-03-09 02:46:54,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:54,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:54,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:54,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:54,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:46:54,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-09 02:46:54,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-09 02:46:54,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:54,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:54,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 02:46:54,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-09 02:46:54,434 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:54,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637570848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:54,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:46:54,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2025-03-09 02:46:54,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886835113] [2025-03-09 02:46:54,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:54,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:46:54,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:54,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:46:54,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:46:54,435 INFO L87 Difference]: Start difference. First operand 3503 states and 4331 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 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-09 02:46:54,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:54,537 INFO L93 Difference]: Finished difference Result 4730 states and 5891 transitions. [2025-03-09 02:46:54,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:46:54,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 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 122 [2025-03-09 02:46:54,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:54,545 INFO L225 Difference]: With dead ends: 4730 [2025-03-09 02:46:54,546 INFO L226 Difference]: Without dead ends: 1933 [2025-03-09 02:46:54,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 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-09 02:46:54,551 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 141 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-09 02:46:54,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 141 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:54,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2025-03-09 02:46:54,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1933. [2025-03-09 02:46:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1933 states, 1582 states have (on average 1.1984829329962072) internal successors, (1896), 1602 states have internal predecessors, (1896), 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-09 02:46:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 2356 transitions. [2025-03-09 02:46:54,627 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 2356 transitions. Word has length 122 [2025-03-09 02:46:54,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:54,627 INFO L471 AbstractCegarLoop]: Abstraction has 1933 states and 2356 transitions. [2025-03-09 02:46:54,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 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-09 02:46:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2356 transitions. [2025-03-09 02:46:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-09 02:46:54,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:54,632 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:54,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:54,833 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,SelfDestructingSolverStorable13 [2025-03-09 02:46:54,834 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:46:54,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:54,834 INFO L85 PathProgramCache]: Analyzing trace with hash 662550737, now seen corresponding path program 1 times [2025-03-09 02:46:54,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:54,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973000977] [2025-03-09 02:46:54,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:54,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:54,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-09 02:46:54,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-09 02:46:54,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:54,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-09 02:46:54,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:54,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973000977] [2025-03-09 02:46:54,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973000977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:46:54,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508042910] [2025-03-09 02:46:54,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:54,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:54,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:54,939 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:54,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:46:54,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-09 02:46:55,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-09 02:46:55,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:55,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:55,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 02:46:55,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:55,143 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-09 02:46:55,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:55,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508042910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:55,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:46:55,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2025-03-09 02:46:55,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219325154] [2025-03-09 02:46:55,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:55,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:46:55,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:55,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:46:55,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:46:55,144 INFO L87 Difference]: Start difference. First operand 1933 states and 2356 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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-09 02:46:55,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:55,245 INFO L93 Difference]: Finished difference Result 4194 states and 5098 transitions. [2025-03-09 02:46:55,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:46:55,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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 136 [2025-03-09 02:46:55,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:55,258 INFO L225 Difference]: With dead ends: 4194 [2025-03-09 02:46:55,258 INFO L226 Difference]: Without dead ends: 2469 [2025-03-09 02:46:55,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 137 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-09 02:46:55,262 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 59 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 277 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-09 02:46:55,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 277 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:55,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2025-03-09 02:46:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2464. [2025-03-09 02:46:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2464 states, 2005 states have (on average 1.1860349127182044) internal successors, (2378), 2025 states have internal predecessors, (2378), 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-09 02:46:55,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 2971 transitions. [2025-03-09 02:46:55,378 INFO L78 Accepts]: Start accepts. Automaton has 2464 states and 2971 transitions. Word has length 136 [2025-03-09 02:46:55,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:55,379 INFO L471 AbstractCegarLoop]: Abstraction has 2464 states and 2971 transitions. [2025-03-09 02:46:55,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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-09 02:46:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 2971 transitions. [2025-03-09 02:46:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-09 02:46:55,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:55,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:55,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:55,583 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,SelfDestructingSolverStorable14 [2025-03-09 02:46:55,583 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:46:55,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:55,584 INFO L85 PathProgramCache]: Analyzing trace with hash -714573838, now seen corresponding path program 1 times [2025-03-09 02:46:55,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:55,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040181620] [2025-03-09 02:46:55,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:55,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:55,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-09 02:46:55,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-09 02:46:55,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:55,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-09 02:46:55,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:55,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040181620] [2025-03-09 02:46:55,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040181620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:55,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:55,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:46:55,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050547870] [2025-03-09 02:46:55,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:55,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:46:55,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:55,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:46:55,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:46:55,649 INFO L87 Difference]: Start difference. First operand 2464 states and 2971 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-09 02:46:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:55,790 INFO L93 Difference]: Finished difference Result 3625 states and 4398 transitions. [2025-03-09 02:46:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:46:55,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 144 [2025-03-09 02:46:55,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:55,798 INFO L225 Difference]: With dead ends: 3625 [2025-03-09 02:46:55,799 INFO L226 Difference]: Without dead ends: 2336 [2025-03-09 02:46:55,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:46:55,801 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 187 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 429 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-09 02:46:55,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 429 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:55,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2025-03-09 02:46:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2336. [2025-03-09 02:46:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 1901 states have (on average 1.1846396633350869) internal successors, (2252), 1921 states have internal predecessors, (2252), 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-09 02:46:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 2813 transitions. [2025-03-09 02:46:55,879 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 2813 transitions. Word has length 144 [2025-03-09 02:46:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:55,880 INFO L471 AbstractCegarLoop]: Abstraction has 2336 states and 2813 transitions. [2025-03-09 02:46:55,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-09 02:46:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 2813 transitions. [2025-03-09 02:46:55,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-09 02:46:55,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:55,883 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:55,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 02:46:55,883 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:46:55,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:55,884 INFO L85 PathProgramCache]: Analyzing trace with hash -660445039, now seen corresponding path program 1 times [2025-03-09 02:46:55,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:55,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734646736] [2025-03-09 02:46:55,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:55,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:55,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-09 02:46:55,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-09 02:46:55,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:55,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 24 proven. 34 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-09 02:46:55,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:55,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734646736] [2025-03-09 02:46:55,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734646736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:46:55,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827958368] [2025-03-09 02:46:55,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:55,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:55,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:55,986 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:55,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:46:56,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-09 02:46:56,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-09 02:46:56,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:56,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:56,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:46:56,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:56,140 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-09 02:46:56,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:56,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827958368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:56,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:46:56,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-03-09 02:46:56,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929460640] [2025-03-09 02:46:56,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:56,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:46:56,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:56,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:46:56,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:46:56,142 INFO L87 Difference]: Start difference. First operand 2336 states and 2813 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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-09 02:46:56,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:56,234 INFO L93 Difference]: Finished difference Result 3913 states and 4710 transitions. [2025-03-09 02:46:56,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:56,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 159 [2025-03-09 02:46:56,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:56,243 INFO L225 Difference]: With dead ends: 3913 [2025-03-09 02:46:56,243 INFO L226 Difference]: Without dead ends: 1592 [2025-03-09 02:46:56,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 157 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-09 02:46:56,247 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 691 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-09 02:46:56,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 691 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2025-03-09 02:46:56,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1592. [2025-03-09 02:46:56,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1338 states have (on average 1.1853512705530642) internal successors, (1586), 1343 states have internal predecessors, (1586), 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-09 02:46:56,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 1905 transitions. [2025-03-09 02:46:56,326 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 1905 transitions. Word has length 159 [2025-03-09 02:46:56,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:56,326 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 1905 transitions. [2025-03-09 02:46:56,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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-09 02:46:56,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 1905 transitions. [2025-03-09 02:46:56,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-09 02:46:56,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:56,328 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:56,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:56,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:56,529 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:46:56,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:56,530 INFO L85 PathProgramCache]: Analyzing trace with hash -161003879, now seen corresponding path program 1 times [2025-03-09 02:46:56,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:56,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361584671] [2025-03-09 02:46:56,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:56,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:56,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-09 02:46:56,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-09 02:46:56,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:56,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-09 02:46:56,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:56,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361584671] [2025-03-09 02:46:56,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361584671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:56,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:56,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:46:56,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636500073] [2025-03-09 02:46:56,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:56,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:46:56,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:56,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:46:56,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:46:56,591 INFO L87 Difference]: Start difference. First operand 1592 states and 1905 transitions. Second operand has 3 states, 2 states have (on average 47.0) internal successors, (94), 3 states have internal predecessors, (94), 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-09 02:46:56,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:56,674 INFO L93 Difference]: Finished difference Result 1592 states and 1905 transitions. [2025-03-09 02:46:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:46:56,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 47.0) internal successors, (94), 3 states have internal predecessors, (94), 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 164 [2025-03-09 02:46:56,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:56,681 INFO L225 Difference]: With dead ends: 1592 [2025-03-09 02:46:56,681 INFO L226 Difference]: Without dead ends: 1590 [2025-03-09 02:46:56,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:46:56,682 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 130 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-09 02:46:56,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 130 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:56,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2025-03-09 02:46:56,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1590. [2025-03-09 02:46:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1338 states have (on average 1.1793721973094171) internal successors, (1578), 1341 states have internal predecessors, (1578), 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-09 02:46:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 1897 transitions. [2025-03-09 02:46:56,779 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 1897 transitions. Word has length 164 [2025-03-09 02:46:56,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:56,780 INFO L471 AbstractCegarLoop]: Abstraction has 1590 states and 1897 transitions. [2025-03-09 02:46:56,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 47.0) internal successors, (94), 3 states have internal predecessors, (94), 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-09 02:46:56,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 1897 transitions. [2025-03-09 02:46:56,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-09 02:46:56,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:56,783 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:56,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 02:46:56,783 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:46:56,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash 723374415, now seen corresponding path program 1 times [2025-03-09 02:46:56,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:56,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499994142] [2025-03-09 02:46:56,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:56,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:56,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-09 02:46:56,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-09 02:46:56,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:56,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:56,864 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-09 02:46:56,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:56,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499994142] [2025-03-09 02:46:56,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499994142] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:46:56,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454539640] [2025-03-09 02:46:56,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:56,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:56,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:56,869 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:56,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:46:56,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-09 02:46:56,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-09 02:46:56,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:56,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:56,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:46:56,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-09 02:46:57,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:57,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454539640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:57,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:46:57,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 02:46:57,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010590891] [2025-03-09 02:46:57,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:57,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:46:57,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:57,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:46:57,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:46:57,141 INFO L87 Difference]: Start difference. First operand 1590 states and 1897 transitions. Second operand has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 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-09 02:46:57,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:57,223 INFO L93 Difference]: Finished difference Result 1591 states and 1897 transitions. [2025-03-09 02:46:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:46:57,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 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 165 [2025-03-09 02:46:57,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:57,229 INFO L225 Difference]: With dead ends: 1591 [2025-03-09 02:46:57,229 INFO L226 Difference]: Without dead ends: 1589 [2025-03-09 02:46:57,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:46:57,230 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 109 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:57,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 320 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:46:57,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2025-03-09 02:46:57,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1588. [2025-03-09 02:46:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1338 states have (on average 1.1748878923766817) internal successors, (1572), 1339 states have internal predecessors, (1572), 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-09 02:46:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 1891 transitions. [2025-03-09 02:46:57,285 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 1891 transitions. Word has length 165 [2025-03-09 02:46:57,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:57,285 INFO L471 AbstractCegarLoop]: Abstraction has 1588 states and 1891 transitions. [2025-03-09 02:46:57,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 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-09 02:46:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 1891 transitions. [2025-03-09 02:46:57,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-09 02:46:57,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:57,287 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:57,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 02:46:57,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:57,492 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:46:57,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:57,493 INFO L85 PathProgramCache]: Analyzing trace with hash 949770466, now seen corresponding path program 1 times [2025-03-09 02:46:57,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:57,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084197226] [2025-03-09 02:46:57,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:57,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:57,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-09 02:46:57,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-09 02:46:57,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:57,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-09 02:46:57,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:57,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084197226] [2025-03-09 02:46:57,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084197226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:46:57,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613814713] [2025-03-09 02:46:57,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:57,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:57,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:57,566 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:57,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:46:57,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-09 02:46:57,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-09 02:46:57,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:57,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:57,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:46:57,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-09 02:46:57,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:46:57,969 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-09 02:46:57,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613814713] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:46:57,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:46:57,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 02:46:57,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395063290] [2025-03-09 02:46:57,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:46:57,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:57,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:57,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:57,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:57,971 INFO L87 Difference]: Start difference. First operand 1588 states and 1891 transitions. Second operand has 7 states, 6 states have (on average 40.5) internal successors, (243), 7 states have internal predecessors, (243), 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-09 02:46:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:58,186 INFO L93 Difference]: Finished difference Result 4523 states and 5482 transitions. [2025-03-09 02:46:58,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:58,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 40.5) internal successors, (243), 7 states have internal predecessors, (243), 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 166 [2025-03-09 02:46:58,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:58,205 INFO L225 Difference]: With dead ends: 4523 [2025-03-09 02:46:58,205 INFO L226 Difference]: Without dead ends: 4521 [2025-03-09 02:46:58,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:58,208 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 314 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:58,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 613 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4521 states. [2025-03-09 02:46:58,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4521 to 3446. [2025-03-09 02:46:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3446 states, 2962 states have (on average 1.1924375422012155) internal successors, (3532), 2957 states have internal predecessors, (3532), 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-09 02:46:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 3446 states and 4193 transitions. [2025-03-09 02:46:58,336 INFO L78 Accepts]: Start accepts. Automaton has 3446 states and 4193 transitions. Word has length 166 [2025-03-09 02:46:58,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:58,336 INFO L471 AbstractCegarLoop]: Abstraction has 3446 states and 4193 transitions. [2025-03-09 02:46:58,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 40.5) internal successors, (243), 7 states have internal predecessors, (243), 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-09 02:46:58,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3446 states and 4193 transitions. [2025-03-09 02:46:58,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-09 02:46:58,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:58,339 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2025-03-09 02:46:58,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:58,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:58,540 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-09 02:46:58,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:58,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1561498024, now seen corresponding path program 1 times [2025-03-09 02:46:58,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:58,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966174967] [2025-03-09 02:46:58,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:58,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:58,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-09 02:46:58,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-09 02:46:58,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:58,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-09 02:46:58,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:58,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966174967] [2025-03-09 02:46:58,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966174967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:58,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:58,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:46:58,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376586710] [2025-03-09 02:46:58,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:58,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:46:58,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:58,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:46:58,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:46:58,677 INFO L87 Difference]: Start difference. First operand 3446 states and 4193 transitions. Second operand has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 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-09 02:46:58,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:58,851 INFO L93 Difference]: Finished difference Result 4975 states and 6075 transitions. [2025-03-09 02:46:58,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:58,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 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 175 [2025-03-09 02:46:58,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:58,865 INFO L225 Difference]: With dead ends: 4975 [2025-03-09 02:46:58,865 INFO L226 Difference]: Without dead ends: 3871 [2025-03-09 02:46:58,869 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-09 02:46:58,870 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 346 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 363 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-09 02:46:58,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 363 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:58,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2025-03-09 02:46:58,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 2584. [2025-03-09 02:46:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2584 states, 2245 states have (on average 1.1919821826280623) internal successors, (2676), 2239 states have internal predecessors, (2676), 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-09 02:46:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 3158 transitions. [2025-03-09 02:46:58,987 INFO L78 Accepts]: Start accepts. Automaton has 2584 states and 3158 transitions. Word has length 175 [2025-03-09 02:46:58,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:58,989 INFO L471 AbstractCegarLoop]: Abstraction has 2584 states and 3158 transitions. [2025-03-09 02:46:58,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 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-09 02:46:58,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 3158 transitions. [2025-03-09 02:46:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-09 02:46:58,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:58,992 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:58,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 02:46:58,992 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-09 02:46:58,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:58,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2054275569, now seen corresponding path program 1 times [2025-03-09 02:46:58,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:58,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819798163] [2025-03-09 02:46:58,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:58,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:59,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-09 02:46:59,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-09 02:46:59,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:59,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-09 02:46:59,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:59,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819798163] [2025-03-09 02:46:59,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819798163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:59,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:59,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:59,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633004324] [2025-03-09 02:46:59,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:59,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:46:59,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:59,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:46:59,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:46:59,077 INFO L87 Difference]: Start difference. First operand 2584 states and 3158 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-09 02:46:59,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:59,215 INFO L93 Difference]: Finished difference Result 7218 states and 8846 transitions. [2025-03-09 02:46:59,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:46:59,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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 176 [2025-03-09 02:46:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:59,233 INFO L225 Difference]: With dead ends: 7218 [2025-03-09 02:46:59,233 INFO L226 Difference]: Without dead ends: 4673 [2025-03-09 02:46:59,239 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-09 02:46:59,240 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 82 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 457 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-09 02:46:59,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 457 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:59,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4673 states. [2025-03-09 02:46:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4673 to 3788. [2025-03-09 02:46:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3788 states, 3281 states have (on average 1.189271563547699) internal successors, (3902), 3271 states have internal predecessors, (3902), 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-09 02:46:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 4626 transitions. [2025-03-09 02:46:59,400 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 4626 transitions. Word has length 176 [2025-03-09 02:46:59,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:59,401 INFO L471 AbstractCegarLoop]: Abstraction has 3788 states and 4626 transitions. [2025-03-09 02:46:59,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-09 02:46:59,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 4626 transitions. [2025-03-09 02:46:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-09 02:46:59,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:59,404 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:59,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 02:46:59,404 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:46:59,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:59,404 INFO L85 PathProgramCache]: Analyzing trace with hash 800974804, now seen corresponding path program 1 times [2025-03-09 02:46:59,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:59,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13567845] [2025-03-09 02:46:59,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:59,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:59,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-09 02:46:59,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-09 02:46:59,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:59,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-09 02:46:59,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:59,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13567845] [2025-03-09 02:46:59,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13567845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:59,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:59,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:46:59,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499092637] [2025-03-09 02:46:59,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:59,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:46:59,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:59,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:46:59,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:46:59,512 INFO L87 Difference]: Start difference. First operand 3788 states and 4626 transitions. Second operand has 5 states, 4 states have (on average 25.25) internal successors, (101), 5 states have internal predecessors, (101), 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-09 02:46:59,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:59,675 INFO L93 Difference]: Finished difference Result 4683 states and 5724 transitions. [2025-03-09 02:46:59,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:59,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 25.25) internal successors, (101), 5 states have internal predecessors, (101), 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 177 [2025-03-09 02:46:59,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:59,688 INFO L225 Difference]: With dead ends: 4683 [2025-03-09 02:46:59,688 INFO L226 Difference]: Without dead ends: 4682 [2025-03-09 02:46:59,690 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-09 02:46:59,691 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 116 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:59,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 617 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:59,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2025-03-09 02:46:59,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 2575. [2025-03-09 02:46:59,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2575 states, 2225 states have (on average 1.1838202247191012) internal successors, (2634), 2218 states have internal predecessors, (2634), 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-09 02:46:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2575 states and 3130 transitions. [2025-03-09 02:46:59,805 INFO L78 Accepts]: Start accepts. Automaton has 2575 states and 3130 transitions. Word has length 177 [2025-03-09 02:46:59,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:59,805 INFO L471 AbstractCegarLoop]: Abstraction has 2575 states and 3130 transitions. [2025-03-09 02:46:59,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 25.25) internal successors, (101), 5 states have internal predecessors, (101), 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-09 02:46:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 3130 transitions. [2025-03-09 02:46:59,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-09 02:46:59,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:59,814 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 13, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2025-03-09 02:46:59,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 02:46:59,814 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-09 02:46:59,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:59,815 INFO L85 PathProgramCache]: Analyzing trace with hash -292662463, now seen corresponding path program 1 times [2025-03-09 02:46:59,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:59,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005203595] [2025-03-09 02:46:59,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:59,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:59,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-09 02:46:59,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-09 02:46:59,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:59,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 150 proven. 85 refuted. 0 times theorem prover too weak. 1150 trivial. 0 not checked. [2025-03-09 02:47:00,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:00,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005203595] [2025-03-09 02:47:00,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005203595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:47:00,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371649189] [2025-03-09 02:47:00,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:00,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:00,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:00,018 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:47:00,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 02:47:00,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-09 02:47:00,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-09 02:47:00,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:00,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:00,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 02:47:00,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:00,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 839 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-03-09 02:47:00,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:47:00,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371649189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:00,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:47:00,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-09 02:47:00,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902228648] [2025-03-09 02:47:00,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:00,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:47:00,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:00,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:47:00,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:47:00,277 INFO L87 Difference]: Start difference. First operand 2575 states and 3130 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-09 02:47:00,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:00,451 INFO L93 Difference]: Finished difference Result 6361 states and 7776 transitions. [2025-03-09 02:47:00,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:47:00,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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 426 [2025-03-09 02:47:00,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:00,465 INFO L225 Difference]: With dead ends: 6361 [2025-03-09 02:47:00,465 INFO L226 Difference]: Without dead ends: 3972 [2025-03-09 02:47:00,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 428 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-09 02:47:00,472 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 52 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:00,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 337 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:47:00,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2025-03-09 02:47:00,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 3967. [2025-03-09 02:47:00,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3967 states, 3417 states have (on average 1.1805677494878548) internal successors, (4034), 3410 states have internal predecessors, (4034), 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-09 02:47:00,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3967 states to 3967 states and 4802 transitions. [2025-03-09 02:47:00,616 INFO L78 Accepts]: Start accepts. Automaton has 3967 states and 4802 transitions. Word has length 426 [2025-03-09 02:47:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:00,616 INFO L471 AbstractCegarLoop]: Abstraction has 3967 states and 4802 transitions. [2025-03-09 02:47:00,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-09 02:47:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3967 states and 4802 transitions. [2025-03-09 02:47:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-09 02:47:00,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:00,627 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 13, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2025-03-09 02:47:00,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 02:47:00,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:00,828 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-09 02:47:00,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:00,829 INFO L85 PathProgramCache]: Analyzing trace with hash 714018784, now seen corresponding path program 1 times [2025-03-09 02:47:00,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:00,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451678140] [2025-03-09 02:47:00,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:00,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:00,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-09 02:47:00,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-09 02:47:00,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:00,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:01,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 150 proven. 85 refuted. 0 times theorem prover too weak. 1150 trivial. 0 not checked. [2025-03-09 02:47:01,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:01,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451678140] [2025-03-09 02:47:01,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451678140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:47:01,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942344124] [2025-03-09 02:47:01,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:01,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:01,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:01,016 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:47:01,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 02:47:01,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-09 02:47:01,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-09 02:47:01,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:01,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:01,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 02:47:01,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 853 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-09 02:47:01,245 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:47:01,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942344124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:01,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:47:01,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-09 02:47:01,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556402337] [2025-03-09 02:47:01,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:01,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:47:01,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:01,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:47:01,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:47:01,246 INFO L87 Difference]: Start difference. First operand 3967 states and 4802 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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-09 02:47:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:01,409 INFO L93 Difference]: Finished difference Result 10449 states and 12624 transitions. [2025-03-09 02:47:01,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:47:01,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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 426 [2025-03-09 02:47:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:01,431 INFO L225 Difference]: With dead ends: 10449 [2025-03-09 02:47:01,432 INFO L226 Difference]: Without dead ends: 6668 [2025-03-09 02:47:01,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 428 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-09 02:47:01,441 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 44 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:47:01,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 337 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:47:01,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6668 states. [2025-03-09 02:47:01,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6668 to 6663. [2025-03-09 02:47:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6663 states, 5745 states have (on average 1.164490861618799) internal successors, (6690), 5738 states have internal predecessors, (6690), 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-09 02:47:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6663 states to 6663 states and 7946 transitions. [2025-03-09 02:47:01,695 INFO L78 Accepts]: Start accepts. Automaton has 6663 states and 7946 transitions. Word has length 426 [2025-03-09 02:47:01,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:01,696 INFO L471 AbstractCegarLoop]: Abstraction has 6663 states and 7946 transitions. [2025-03-09 02:47:01,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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-09 02:47:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 6663 states and 7946 transitions. [2025-03-09 02:47:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-09 02:47:01,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:01,713 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 13, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2025-03-09 02:47:01,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 02:47:01,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:01,914 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-09 02:47:01,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:01,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1162134369, now seen corresponding path program 1 times [2025-03-09 02:47:01,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:01,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929122700] [2025-03-09 02:47:01,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:01,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:01,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-09 02:47:01,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-09 02:47:01,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:01,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 150 proven. 85 refuted. 0 times theorem prover too weak. 1150 trivial. 0 not checked. [2025-03-09 02:47:02,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:02,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929122700] [2025-03-09 02:47:02,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929122700] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:47:02,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212499901] [2025-03-09 02:47:02,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:02,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:02,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:02,072 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:47:02,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 02:47:02,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-09 02:47:02,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-09 02:47:02,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:02,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:02,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:47:02,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2025-03-09 02:47:02,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:47:02,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212499901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:02,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:47:02,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-09 02:47:02,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689672470] [2025-03-09 02:47:02,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:02,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:47:02,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:02,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:47:02,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:47:02,260 INFO L87 Difference]: Start difference. First operand 6663 states and 7946 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-09 02:47:02,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:02,359 INFO L93 Difference]: Finished difference Result 9940 states and 11877 transitions. [2025-03-09 02:47:02,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:47:02,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 426 [2025-03-09 02:47:02,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:02,371 INFO L225 Difference]: With dead ends: 9940 [2025-03-09 02:47:02,371 INFO L226 Difference]: Without dead ends: 3463 [2025-03-09 02:47:02,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 428 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-09 02:47:02,380 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 4 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 264 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-09 02:47:02,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 264 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:47:02,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2025-03-09 02:47:02,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 3463. [2025-03-09 02:47:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3463 states, 3009 states have (on average 1.1492190096377535) internal successors, (3458), 3010 states have internal predecessors, (3458), 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-09 02:47:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 4058 transitions. [2025-03-09 02:47:02,541 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 4058 transitions. Word has length 426 [2025-03-09 02:47:02,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:02,542 INFO L471 AbstractCegarLoop]: Abstraction has 3463 states and 4058 transitions. [2025-03-09 02:47:02,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-09 02:47:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 4058 transitions. [2025-03-09 02:47:02,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-03-09 02:47:02,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:02,556 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 16, 11, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2025-03-09 02:47:02,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-09 02:47:02,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,SelfDestructingSolverStorable25 [2025-03-09 02:47:02,760 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-09 02:47:02,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:02,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1559767531, now seen corresponding path program 1 times [2025-03-09 02:47:02,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:02,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819254673] [2025-03-09 02:47:02,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:02,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:02,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-09 02:47:02,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-09 02:47:02,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:02,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 149 proven. 88 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2025-03-09 02:47:02,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:02,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819254673] [2025-03-09 02:47:02,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819254673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:47:02,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718144416] [2025-03-09 02:47:02,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:02,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:02,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:02,889 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:47:02,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 02:47:02,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-09 02:47:03,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-09 02:47:03,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:03,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:03,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:47:03,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 566 proven. 0 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2025-03-09 02:47:03,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:47:03,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718144416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:03,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:47:03,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-09 02:47:03,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413653972] [2025-03-09 02:47:03,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:03,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:47:03,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:03,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:47:03,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:47:03,077 INFO L87 Difference]: Start difference. First operand 3463 states and 4058 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-09 02:47:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:03,131 INFO L93 Difference]: Finished difference Result 5076 states and 5965 transitions. [2025-03-09 02:47:03,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:47:03,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 431 [2025-03-09 02:47:03,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:03,139 INFO L225 Difference]: With dead ends: 5076 [2025-03-09 02:47:03,139 INFO L226 Difference]: Without dead ends: 1799 [2025-03-09 02:47:03,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 433 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-09 02:47:03,143 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 2 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 257 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-09 02:47:03,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 257 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:47:03,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2025-03-09 02:47:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2025-03-09 02:47:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1553 states have (on average 1.1191242755956214) internal successors, (1738), 1554 states have internal predecessors, (1738), 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-09 02:47:03,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2042 transitions. [2025-03-09 02:47:03,200 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2042 transitions. Word has length 431 [2025-03-09 02:47:03,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:03,200 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2042 transitions. [2025-03-09 02:47:03,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-09 02:47:03,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2042 transitions. [2025-03-09 02:47:03,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-09 02:47:03,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:03,206 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 14, 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, 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] [2025-03-09 02:47:03,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 02:47:03,406 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,SelfDestructingSolverStorable26 [2025-03-09 02:47:03,407 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-09 02:47:03,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:03,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1639799845, now seen corresponding path program 1 times [2025-03-09 02:47:03,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:03,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290695790] [2025-03-09 02:47:03,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:03,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:03,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-09 02:47:03,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-09 02:47:03,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:03,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:03,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1761 backedges. 156 proven. 160 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2025-03-09 02:47:03,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:03,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290695790] [2025-03-09 02:47:03,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290695790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:47:03,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542263414] [2025-03-09 02:47:03,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:03,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:03,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:03,557 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:47:03,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 02:47:03,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-09 02:47:03,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-09 02:47:03,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:03,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:03,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:47:03,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:03,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1761 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 1475 trivial. 0 not checked. [2025-03-09 02:47:03,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:47:03,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542263414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:03,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:47:03,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-03-09 02:47:03,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613385295] [2025-03-09 02:47:03,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:03,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:03,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:03,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:03,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:47:03,856 INFO L87 Difference]: Start difference. First operand 1799 states and 2042 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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-09 02:47:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:04,062 INFO L93 Difference]: Finished difference Result 4650 states and 5302 transitions. [2025-03-09 02:47:04,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:47:04,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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 496 [2025-03-09 02:47:04,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:04,073 INFO L225 Difference]: With dead ends: 4650 [2025-03-09 02:47:04,073 INFO L226 Difference]: Without dead ends: 3154 [2025-03-09 02:47:04,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 496 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-09 02:47:04,077 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 162 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 433 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-09 02:47:04,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 433 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:47:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2025-03-09 02:47:04,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 3104. [2025-03-09 02:47:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3104 states, 2688 states have (on average 1.1194196428571428) internal successors, (3009), 2689 states have internal predecessors, (3009), 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-09 02:47:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 3530 transitions. [2025-03-09 02:47:04,255 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 3530 transitions. Word has length 496 [2025-03-09 02:47:04,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:04,257 INFO L471 AbstractCegarLoop]: Abstraction has 3104 states and 3530 transitions. [2025-03-09 02:47:04,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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-09 02:47:04,257 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 3530 transitions. [2025-03-09 02:47:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-09 02:47:04,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:47:04,265 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:47:04,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 02:47:04,466 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,SelfDestructingSolverStorable27 [2025-03-09 02:47:04,466 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:47:04,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:47:04,466 INFO L85 PathProgramCache]: Analyzing trace with hash 393791750, now seen corresponding path program 1 times [2025-03-09 02:47:04,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:47:04,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620788501] [2025-03-09 02:47:04,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:04,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:47:04,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-09 02:47:04,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-09 02:47:04,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:04,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1755 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2025-03-09 02:47:04,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:47:04,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620788501] [2025-03-09 02:47:04,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620788501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:47:04,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113291407] [2025-03-09 02:47:04,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:47:04,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:47:04,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:47:04,638 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:47:04,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 02:47:04,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-09 02:47:04,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-09 02:47:04,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:47:04,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:47:04,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:47:04,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:47:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1755 backedges. 1333 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2025-03-09 02:47:05,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:47:05,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113291407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:47:05,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:47:05,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-03-09 02:47:05,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003439892] [2025-03-09 02:47:05,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:47:05,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:47:05,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:47:05,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:47:05,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:47:05,471 INFO L87 Difference]: Start difference. First operand 3104 states and 3530 transitions. Second operand has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 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-09 02:47:05,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:47:05,554 INFO L93 Difference]: Finished difference Result 3282 states and 3735 transitions. [2025-03-09 02:47:05,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:47:05,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 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 517 [2025-03-09 02:47:05,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:47:05,558 INFO L225 Difference]: With dead ends: 3282 [2025-03-09 02:47:05,558 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:47:05,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 514 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-09 02:47:05,562 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 37 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 390 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-09 02:47:05,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 390 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:47:05,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:47:05,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:47:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:47:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:47:05,564 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 517 [2025-03-09 02:47:05,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:47:05,565 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:47:05,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.0) internal successors, (265), 5 states have internal predecessors, (265), 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-09 02:47:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:47:05,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:47:05,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-09 02:47:05,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-09 02:47:05,567 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-09 02:47:05,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-09 02:47:05,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-09 02:47:05,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-09 02:47:05,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-09 02:47:05,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-09 02:47:05,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 02:47:05,770 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,SelfDestructingSolverStorable28 [2025-03-09 02:47:05,773 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, 1] [2025-03-09 02:47:05,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:47:20,485 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:47:20,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:47:20 BoogieIcfgContainer [2025-03-09 02:47:20,512 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:47:20,513 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:47:20,513 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:47:20,513 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:47:20,514 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:46:49" (3/4) ... [2025-03-09 02:47:20,515 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:47:20,524 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure activate_threads [2025-03-09 02:47:20,524 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2025-03-09 02:47:20,524 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2025-03-09 02:47:20,524 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure update_channels [2025-03-09 02:47:20,524 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2025-03-09 02:47:20,525 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure error [2025-03-09 02:47:20,534 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-09 02:47:20,535 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-09 02:47:20,535 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:47:20,536 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:47:20,629 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:47:20,629 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:47:20,629 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:47:20,630 INFO L158 Benchmark]: Toolchain (without parser) took 31922.81ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 112.2MB in the beginning and 981.7MB in the end (delta: -869.4MB). Peak memory consumption was 463.7MB. Max. memory is 16.1GB. [2025-03-09 02:47:20,631 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory was 148.5MB in the beginning and 148.2MB in the end (delta: 293.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:47:20,631 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.87ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 98.6MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:47:20,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.97ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:47:20,631 INFO L158 Benchmark]: Boogie Preprocessor took 24.28ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 95.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:47:20,632 INFO L158 Benchmark]: IcfgBuilder took 442.22ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 74.7MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:47:20,632 INFO L158 Benchmark]: TraceAbstraction took 31061.23ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 74.2MB in the beginning and 990.2MB in the end (delta: -916.0MB). Peak memory consumption was 856.0MB. Max. memory is 16.1GB. [2025-03-09 02:47:20,633 INFO L158 Benchmark]: Witness Printer took 116.71ms. Allocated memory is still 1.5GB. Free memory was 990.2MB in the beginning and 981.7MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:47:20,636 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.19ms. Allocated memory is still 226.5MB. Free memory was 148.5MB in the beginning and 148.2MB in the end (delta: 293.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.87ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 98.6MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.97ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.28ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 95.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 442.22ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 74.7MB in the end (delta: 20.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 31061.23ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 74.2MB in the beginning and 990.2MB in the end (delta: -916.0MB). Peak memory consumption was 856.0MB. Max. memory is 16.1GB. * Witness Printer took 116.71ms. Allocated memory is still 1.5GB. Free memory was 990.2MB in the beginning and 981.7MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 121 locations, 181 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 29, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5325 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5317 mSDsluCounter, 12205 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6894 mSDsCounter, 524 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1445 IncrementalHoareTripleChecker+Invalid, 1969 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 524 mSolverCounterUnsat, 5311 mSDtfsCounter, 1445 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3804 GetRequests, 3681 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6663occurred in iteration=25, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 6048 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 8463 NumberOfCodeBlocks, 8463 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 8588 ConstructedInterpolants, 0 QuantifiedInterpolants, 13987 SizeOfPredicates, 3 NumberOfNonLiveVariables, 8722 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 41 InterpolantComputations, 28 PerfectInterpolantSequences, 19336/20028 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: 81]: Location Invariant Derived location invariant: (((((((((((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (P_1_i == 1)) && (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)) && (P_1_i == 1)) && (C_1_ev <= 0)) && (i == 1)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || (((((((((1 <= C_1_ev) && (P_1_pc == 1)) && (i == 0)) && (e <= 0)) && (P_1_i == 1)) && (C_1_pc == 0)) && (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 <= 2147483645)) && (P_1_i == 1)) && (0 <= num)) && (2 <= i)) && (P_1_st != 0))) || (((((((((1 <= i) && (1 <= C_1_ev)) && (P_1_pc == 1)) && (e <= 0)) && (2 != C_1_pc)) && (P_1_i == 1)) && (C_1_st != 0)) && (1 <= num)) && (P_1_st != 0))) || (((((((((1 <= i) && (1 <= C_1_ev)) && (P_1_pc == 1)) && (e <= 0)) && (2 != C_1_pc)) && (P_1_i == 1)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (P_1_i == 1)) && (C_1_ev <= 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)) && (P_1_i == 1)) && (i == 1)) && (0 <= num)) && (P_1_st != 0))) - InvariantResult [Line: 279]: Location Invariant Derived location invariant: (((((((((((((((((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (P_1_i == 1)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) || ((((((((1 <= C_1_ev) && (P_1_pc == 1)) && (i == 0)) && (e <= 0)) && (P_1_i == 1)) && (C_1_pc == 0)) && (C_1_st != 0)) && (1 <= num))) || ((((((P_1_i == 1) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || ((((((((((P_1_pc == 1) && (i == 0)) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (P_1_i == 1)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && (P_1_st != 0))) || (((((((e <= 0) && (2 != C_1_pc)) && (P_1_i == 1)) && (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)) && (P_1_i == 1)) && (C_1_pc == 0)) && (num == 1)) && (C_1_st != 0)) && (P_1_st != 0))) || (((((((((e <= 0) && (2 != C_1_pc)) && (P_1_ev <= 0)) && (P_1_i == 1)) && (C_1_ev <= 0)) && (i == 1)) && (P_1_pc == 0)) && (num == 0)) && (C_1_st != 0))) || (((((((i == 0) && (e <= 0)) && (P_1_i == 1)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) || ((((((((1 <= i) && (1 <= C_1_ev)) && (P_1_pc == 1)) && (e <= 0)) && (2 != C_1_pc)) && (P_1_i == 1)) && (C_1_st != 0)) && (1 <= num))) || ((((((((1 <= i) && (1 <= C_1_ev)) && (P_1_pc == 1)) && (e <= 0)) && (2 != C_1_pc)) && (P_1_i == 1)) && (num == 0)) && (C_1_st != 0))) || (((((((((P_1_pc == 1) && (e <= 0)) && (2 != C_1_pc)) && (P_1_ev <= 0)) && (P_1_i == 1)) && (i == 1)) && (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)) && (P_1_i == 1)) && (0 <= num)) && (2 <= i))) || (((((((((((2 == C_1_pc) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (P_1_i == 1)) && (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)) && (P_1_i == 1)) && (i == 1)) && (0 <= num))) || (((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (P_1_i == 1)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0))) - InvariantResult [Line: 140]: Location Invariant Derived location invariant: ((((((((((((i == 0) && (e <= 0)) && (P_1_i == 1)) && (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 <= 2147483645)) && (P_1_i == 1)) && (C_1_st != 0)) && (0 <= num)) && (2 <= i))) || (((((((((((P_1_pc == 1) && (i == 0)) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (P_1_i == 1)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && (C_1_st != 0)) && (P_1_st != 0))) || (((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (P_1_i == 1)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_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)) && (P_1_i == 1)) && (i == 1)) && (C_1_st != 0)) && (0 <= num))) - InvariantResult [Line: 445]: Location Invariant Derived location invariant: (((((((((((((((((((((i == 0) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (P_1_i == 1)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) || ((((((((1 <= C_1_ev) && (P_1_pc == 1)) && (i == 0)) && (e <= 0)) && (P_1_i == 1)) && (C_1_pc == 0)) && (C_1_st != 0)) && (1 <= num))) || ((((((P_1_i == 1) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0)) && (P_1_st != 0))) || (((((((e <= 0) && (2 != C_1_pc)) && (P_1_i == 1)) && (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)) && (P_1_i == 1)) && (C_1_pc == 0)) && (num == 1)) && (C_1_st != 0)) && (P_1_st != 0))) || (((((((i == 0) && (e <= 0)) && (P_1_i == 1)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (P_1_st != 0))) || ((((((((1 <= i) && (1 <= C_1_ev)) && (P_1_pc == 1)) && (e <= 0)) && (2 != C_1_pc)) && (P_1_i == 1)) && (C_1_st != 0)) && (1 <= num))) || ((((((((1 <= i) && (1 <= C_1_ev)) && (P_1_pc == 1)) && (e <= 0)) && (2 != C_1_pc)) && (P_1_i == 1)) && (num == 0)) && (C_1_st != 0))) || (((((((((P_1_pc == 1) && (e <= 0)) && (2 != C_1_pc)) && (P_1_ev <= 0)) && (P_1_i == 1)) && (i == 1)) && (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)) && (P_1_i == 1)) && (0 <= num)) && (2 <= i))) || (((((((((((2 == C_1_pc) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (P_1_ev <= 0)) && (P_1_i == 1)) && (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)) && (P_1_i == 1)) && (i == 1)) && (0 <= num))) || (((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (P_1_i == 1)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_st != 0))) RESULT: Ultimate proved your program to be correct! [2025-03-09 02:47:20,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE